./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-difference-det.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-difference-det.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 739dc04b5c5aa67083a96cc98ccb84e17de2a97ca235c28aa84e8c99a10b0a9e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:47:47,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:47:47,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:47:47,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:47:47,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:47:47,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:47:47,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:47:47,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:47:47,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:47:47,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:47:47,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:47:47,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:47:47,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:47:47,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:47:47,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:47:47,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:47:47,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:47:47,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:47:47,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:47:47,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:47:47,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:47:47,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:47:47,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:47:47,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:47:47,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:47:47,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:47:47,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:47:47,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:47:47,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:47:47,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:47:47,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:47:47,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:47:47,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:47:47,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:47:47,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:47:47,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:47:47,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:47:47,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:47:47,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:47:47,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:47:47,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:47:47,298 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:47:47,319 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:47:47,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:47:47,320 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:47:47,320 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:47:47,321 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:47:47,321 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:47:47,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:47:47,322 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:47:47,322 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:47:47,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:47:47,323 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:47:47,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:47:47,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:47:47,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:47:47,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:47:47,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:47:47,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:47:47,324 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:47:47,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:47:47,325 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:47:47,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:47:47,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:47:47,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:47:47,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:47:47,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:47,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:47:47,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:47:47,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:47:47,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:47:47,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:47:47,327 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:47:47,327 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:47:47,327 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:47:47,328 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 739dc04b5c5aa67083a96cc98ccb84e17de2a97ca235c28aa84e8c99a10b0a9e [2022-11-02 20:47:47,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:47:47,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:47:47,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:47:47,629 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:47:47,630 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:47:47,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-difference-det.wvr.c [2022-11-02 20:47:47,715 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/data/8ca208996/c53ab78c771f48c1bc6a17b03f3474aa/FLAG6beaaa5ff [2022-11-02 20:47:48,118 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:47:48,118 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/sv-benchmarks/c/weaver/popl20-difference-det.wvr.c [2022-11-02 20:47:48,131 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/data/8ca208996/c53ab78c771f48c1bc6a17b03f3474aa/FLAG6beaaa5ff [2022-11-02 20:47:48,495 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/data/8ca208996/c53ab78c771f48c1bc6a17b03f3474aa [2022-11-02 20:47:48,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:47:48,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:47:48,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:48,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:47:48,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:47:48,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a0a50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48, skipping insertion in model container [2022-11-02 20:47:48,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:47:48,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:47:48,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/sv-benchmarks/c/weaver/popl20-difference-det.wvr.c[2507,2520] [2022-11-02 20:47:48,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:48,771 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:47:48,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/sv-benchmarks/c/weaver/popl20-difference-det.wvr.c[2507,2520] [2022-11-02 20:47:48,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:48,812 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:47:48,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48 WrapperNode [2022-11-02 20:47:48,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:48,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:48,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:47:48,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:47:48,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,852 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2022-11-02 20:47:48,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:48,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:47:48,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:47:48,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:47:48,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,876 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:47:48,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:47:48,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:47:48,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:47:48,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48" (1/1) ... [2022-11-02 20:47:48,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:48,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:48,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:47:48,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:47:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:47:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:47:48,970 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:47:48,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:47:48,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:47:48,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:47:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:47:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:47:48,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:47:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:47:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:47:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:47:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:47:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:47:48,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:47:48,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:47:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:47:48,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:47:48,978 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:47:49,117 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:47:49,120 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:47:49,424 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:47:49,495 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:47:49,496 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:47:49,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:49 BoogieIcfgContainer [2022-11-02 20:47:49,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:47:49,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:47:49,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:47:49,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:47:49,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:47:48" (1/3) ... [2022-11-02 20:47:49,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2b2403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:49, skipping insertion in model container [2022-11-02 20:47:49,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:48" (2/3) ... [2022-11-02 20:47:49,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2b2403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:49, skipping insertion in model container [2022-11-02 20:47:49,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:49" (3/3) ... [2022-11-02 20:47:49,510 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-difference-det.wvr.c [2022-11-02 20:47:49,521 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:47:49,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:47:49,536 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:47:49,536 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:47:49,682 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:47:49,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 128 transitions, 288 flow [2022-11-02 20:47:49,831 INFO L130 PetriNetUnfolder]: 9/124 cut-off events. [2022-11-02 20:47:49,831 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:47:49,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 124 events. 9/124 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-11-02 20:47:49,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 128 transitions, 288 flow [2022-11-02 20:47:49,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 111 transitions, 246 flow [2022-11-02 20:47:49,869 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:47:49,876 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c55cdea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:47:49,876 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-02 20:47:49,916 INFO L130 PetriNetUnfolder]: 9/110 cut-off events. [2022-11-02 20:47:49,917 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:47:49,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:49,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:49,919 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:47:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:49,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1433958770, now seen corresponding path program 1 times [2022-11-02 20:47:49,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:49,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319001991] [2022-11-02 20:47:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:49,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:50,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:50,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319001991] [2022-11-02 20:47:50,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319001991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:50,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:50,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:50,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786657950] [2022-11-02 20:47:50,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:50,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:47:50,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:50,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:47:50,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:47:50,254 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 128 [2022-11-02 20:47:50,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 246 flow. Second operand has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 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-11-02 20:47:50,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:50,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 128 [2022-11-02 20:47:50,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:50,487 INFO L130 PetriNetUnfolder]: 121/487 cut-off events. [2022-11-02 20:47:50,488 INFO L131 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2022-11-02 20:47:50,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 487 events. 121/487 cut-off events. For 105/106 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2256 event pairs, 51 based on Foata normal form. 118/537 useless extension candidates. Maximal degree in co-relation 568. Up to 163 conditions per place. [2022-11-02 20:47:50,501 INFO L137 encePairwiseOnDemand]: 123/128 looper letters, 12 selfloop transitions, 0 changer transitions 1/106 dead transitions. [2022-11-02 20:47:50,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 106 transitions, 260 flow [2022-11-02 20:47:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:47:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:47:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 237 transitions. [2022-11-02 20:47:50,522 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.92578125 [2022-11-02 20:47:50,523 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 237 transitions. [2022-11-02 20:47:50,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 237 transitions. [2022-11-02 20:47:50,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:50,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 237 transitions. [2022-11-02 20:47:50,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 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-11-02 20:47:50,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-11-02 20:47:50,546 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-11-02 20:47:50,548 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 246 flow. Second operand 2 states and 237 transitions. [2022-11-02 20:47:50,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 106 transitions, 260 flow [2022-11-02 20:47:50,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 106 transitions, 244 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:47:50,558 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 218 flow [2022-11-02 20:47:50,561 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=218, PETRI_PLACES=108, PETRI_TRANSITIONS=105} [2022-11-02 20:47:50,565 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, -7 predicate places. [2022-11-02 20:47:50,566 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 218 flow [2022-11-02 20:47:50,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 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-11-02 20:47:50,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:50,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:50,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:47:50,568 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:47:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1501372782, now seen corresponding path program 1 times [2022-11-02 20:47:50,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:50,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664138677] [2022-11-02 20:47:50,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:50,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:51,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664138677] [2022-11-02 20:47:51,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664138677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:51,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:51,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:47:51,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502613910] [2022-11-02 20:47:51,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:51,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:51,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:51,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:51,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:47:51,222 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 128 [2022-11-02 20:47:51,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 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-11-02 20:47:51,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:51,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 128 [2022-11-02 20:47:51,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:51,487 INFO L130 PetriNetUnfolder]: 107/481 cut-off events. [2022-11-02 20:47:51,489 INFO L131 PetriNetUnfolder]: For 34/35 co-relation queries the response was YES. [2022-11-02 20:47:51,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 481 events. 107/481 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2107 event pairs, 26 based on Foata normal form. 15/439 useless extension candidates. Maximal degree in co-relation 660. Up to 124 conditions per place. [2022-11-02 20:47:51,496 INFO L137 encePairwiseOnDemand]: 119/128 looper letters, 32 selfloop transitions, 5 changer transitions 5/129 dead transitions. [2022-11-02 20:47:51,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 129 transitions, 362 flow [2022-11-02 20:47:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:47:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:47:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 664 transitions. [2022-11-02 20:47:51,504 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8645833333333334 [2022-11-02 20:47:51,505 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 664 transitions. [2022-11-02 20:47:51,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 664 transitions. [2022-11-02 20:47:51,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:51,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 664 transitions. [2022-11-02 20:47:51,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 0 states have call successors, (0), 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-11-02 20:47:51,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-11-02 20:47:51,513 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-11-02 20:47:51,513 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 218 flow. Second operand 6 states and 664 transitions. [2022-11-02 20:47:51,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 129 transitions, 362 flow [2022-11-02 20:47:51,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 129 transitions, 362 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:47:51,519 INFO L231 Difference]: Finished difference. Result has 116 places, 108 transitions, 257 flow [2022-11-02 20:47:51,520 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=116, PETRI_TRANSITIONS=108} [2022-11-02 20:47:51,521 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 1 predicate places. [2022-11-02 20:47:51,521 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 108 transitions, 257 flow [2022-11-02 20:47:51,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 0 states have call successors, (0), 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-11-02 20:47:51,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:51,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:51,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:47:51,523 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:47:51,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2120554504, now seen corresponding path program 1 times [2022-11-02 20:47:51,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:51,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424664583] [2022-11-02 20:47:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:51,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:51,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:51,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424664583] [2022-11-02 20:47:51,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424664583] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:51,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659560871] [2022-11-02 20:47:51,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:51,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:51,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:51,839 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:51,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:47:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:51,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:47:52,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:52,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:52,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659560871] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:52,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:52,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-11-02 20:47:52,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415272577] [2022-11-02 20:47:52,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:52,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:47:52,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:47:52,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:47:52,329 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 128 [2022-11-02 20:47:52,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 257 flow. Second operand has 9 states, 9 states have (on average 101.22222222222223) internal successors, (911), 9 states have internal predecessors, (911), 0 states have call successors, (0), 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-11-02 20:47:52,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:52,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 128 [2022-11-02 20:47:52,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:53,272 INFO L130 PetriNetUnfolder]: 1817/3368 cut-off events. [2022-11-02 20:47:53,273 INFO L131 PetriNetUnfolder]: For 1905/2104 co-relation queries the response was YES. [2022-11-02 20:47:53,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7825 conditions, 3368 events. 1817/3368 cut-off events. For 1905/2104 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22460 event pairs, 144 based on Foata normal form. 4/2982 useless extension candidates. Maximal degree in co-relation 7817. Up to 1074 conditions per place. [2022-11-02 20:47:53,311 INFO L137 encePairwiseOnDemand]: 120/128 looper letters, 115 selfloop transitions, 26 changer transitions 0/222 dead transitions. [2022-11-02 20:47:53,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 222 transitions, 895 flow [2022-11-02 20:47:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:47:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:47:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1509 transitions. [2022-11-02 20:47:53,316 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8420758928571429 [2022-11-02 20:47:53,316 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1509 transitions. [2022-11-02 20:47:53,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1509 transitions. [2022-11-02 20:47:53,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:53,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1509 transitions. [2022-11-02 20:47:53,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 107.78571428571429) internal successors, (1509), 14 states have internal predecessors, (1509), 0 states have call successors, (0), 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-11-02 20:47:53,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 128.0) internal successors, (1920), 15 states have internal predecessors, (1920), 0 states have call successors, (0), 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-11-02 20:47:53,327 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 128.0) internal successors, (1920), 15 states have internal predecessors, (1920), 0 states have call successors, (0), 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-11-02 20:47:53,327 INFO L175 Difference]: Start difference. First operand has 116 places, 108 transitions, 257 flow. Second operand 14 states and 1509 transitions. [2022-11-02 20:47:53,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 222 transitions, 895 flow [2022-11-02 20:47:53,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 222 transitions, 891 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-02 20:47:53,337 INFO L231 Difference]: Finished difference. Result has 132 places, 136 transitions, 419 flow [2022-11-02 20:47:53,337 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=419, PETRI_PLACES=132, PETRI_TRANSITIONS=136} [2022-11-02 20:47:53,340 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 17 predicate places. [2022-11-02 20:47:53,340 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 136 transitions, 419 flow [2022-11-02 20:47:53,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 101.22222222222223) internal successors, (911), 9 states have internal predecessors, (911), 0 states have call successors, (0), 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-11-02 20:47:53,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:53,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:53,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:53,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:53,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:47:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash -653186084, now seen corresponding path program 1 times [2022-11-02 20:47:53,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:53,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415210205] [2022-11-02 20:47:53,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:53,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:53,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:53,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415210205] [2022-11-02 20:47:53,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415210205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:53,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:53,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:47:53,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638755651] [2022-11-02 20:47:53,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:53,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:47:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:53,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:47:53,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:53,682 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 128 [2022-11-02 20:47:53,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 136 transitions, 419 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 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-11-02 20:47:53,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:53,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 128 [2022-11-02 20:47:53,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:54,507 INFO L130 PetriNetUnfolder]: 1771/3873 cut-off events. [2022-11-02 20:47:54,508 INFO L131 PetriNetUnfolder]: For 3424/3582 co-relation queries the response was YES. [2022-11-02 20:47:54,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9508 conditions, 3873 events. 1771/3873 cut-off events. For 3424/3582 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 29653 event pairs, 751 based on Foata normal form. 10/3543 useless extension candidates. Maximal degree in co-relation 9494. Up to 1597 conditions per place. [2022-11-02 20:47:54,556 INFO L137 encePairwiseOnDemand]: 121/128 looper letters, 68 selfloop transitions, 9 changer transitions 9/167 dead transitions. [2022-11-02 20:47:54,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 167 transitions, 716 flow [2022-11-02 20:47:54,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:47:54,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:47:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2022-11-02 20:47:54,559 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8450520833333334 [2022-11-02 20:47:54,560 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 649 transitions. [2022-11-02 20:47:54,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions. [2022-11-02 20:47:54,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:54,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions. [2022-11-02 20:47:54,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 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-11-02 20:47:54,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-11-02 20:47:54,564 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-11-02 20:47:54,564 INFO L175 Difference]: Start difference. First operand has 132 places, 136 transitions, 419 flow. Second operand 6 states and 649 transitions. [2022-11-02 20:47:54,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 167 transitions, 716 flow [2022-11-02 20:47:54,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 167 transitions, 716 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:47:54,581 INFO L231 Difference]: Finished difference. Result has 139 places, 136 transitions, 443 flow [2022-11-02 20:47:54,582 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=443, PETRI_PLACES=139, PETRI_TRANSITIONS=136} [2022-11-02 20:47:54,582 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 24 predicate places. [2022-11-02 20:47:54,583 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 136 transitions, 443 flow [2022-11-02 20:47:54,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 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-11-02 20:47:54,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:54,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:54,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:47:54,584 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:47:54,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash -945052734, now seen corresponding path program 2 times [2022-11-02 20:47:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:54,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789343667] [2022-11-02 20:47:54,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:54,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:54,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:54,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789343667] [2022-11-02 20:47:54,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789343667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:54,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784610530] [2022-11-02 20:47:54,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:47:54,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:54,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:54,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:54,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:47:54,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:47:54,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:47:54,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:47:54,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:54,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:55,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784610530] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:55,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:55,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-11-02 20:47:55,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916668694] [2022-11-02 20:47:55,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:55,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:47:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:55,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:47:55,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:47:55,063 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 128 [2022-11-02 20:47:55,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 443 flow. Second operand has 11 states, 11 states have (on average 101.18181818181819) internal successors, (1113), 11 states have internal predecessors, (1113), 0 states have call successors, (0), 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-11-02 20:47:55,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:55,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 128 [2022-11-02 20:47:55,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:56,662 INFO L130 PetriNetUnfolder]: 3281/6538 cut-off events. [2022-11-02 20:47:56,663 INFO L131 PetriNetUnfolder]: For 6932/7311 co-relation queries the response was YES. [2022-11-02 20:47:56,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16919 conditions, 6538 events. 3281/6538 cut-off events. For 6932/7311 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 52265 event pairs, 348 based on Foata normal form. 64/6178 useless extension candidates. Maximal degree in co-relation 16902. Up to 2072 conditions per place. [2022-11-02 20:47:56,748 INFO L137 encePairwiseOnDemand]: 120/128 looper letters, 132 selfloop transitions, 45 changer transitions 2/260 dead transitions. [2022-11-02 20:47:56,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 260 transitions, 1321 flow [2022-11-02 20:47:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:47:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:47:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1425 transitions. [2022-11-02 20:47:56,752 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8563701923076923 [2022-11-02 20:47:56,752 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1425 transitions. [2022-11-02 20:47:56,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1425 transitions. [2022-11-02 20:47:56,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:56,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1425 transitions. [2022-11-02 20:47:56,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 109.61538461538461) internal successors, (1425), 13 states have internal predecessors, (1425), 0 states have call successors, (0), 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-11-02 20:47:56,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 128.0) internal successors, (1792), 14 states have internal predecessors, (1792), 0 states have call successors, (0), 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-11-02 20:47:56,761 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 128.0) internal successors, (1792), 14 states have internal predecessors, (1792), 0 states have call successors, (0), 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-11-02 20:47:56,761 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 443 flow. Second operand 13 states and 1425 transitions. [2022-11-02 20:47:56,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 260 transitions, 1321 flow [2022-11-02 20:47:56,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 260 transitions, 1305 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-02 20:47:56,787 INFO L231 Difference]: Finished difference. Result has 153 places, 159 transitions, 715 flow [2022-11-02 20:47:56,788 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=715, PETRI_PLACES=153, PETRI_TRANSITIONS=159} [2022-11-02 20:47:56,788 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 38 predicate places. [2022-11-02 20:47:56,789 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 159 transitions, 715 flow [2022-11-02 20:47:56,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.18181818181819) internal successors, (1113), 11 states have internal predecessors, (1113), 0 states have call successors, (0), 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-11-02 20:47:56,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:56,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:56,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:57,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:57,003 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:47:57,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:57,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1878127368, now seen corresponding path program 2 times [2022-11-02 20:47:57,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:57,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701136405] [2022-11-02 20:47:57,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:57,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:57,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:57,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701136405] [2022-11-02 20:47:57,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701136405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:57,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874395528] [2022-11-02 20:47:57,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:47:57,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:57,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:57,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:57,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:47:57,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:47:57,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:47:57,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:47:57,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:57,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:57,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874395528] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:57,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:57,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-11-02 20:47:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40654428] [2022-11-02 20:47:57,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:57,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:47:57,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:57,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:47:57,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:47:57,417 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 128 [2022-11-02 20:47:57,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 159 transitions, 715 flow. Second operand has 11 states, 11 states have (on average 101.27272727272727) internal successors, (1114), 11 states have internal predecessors, (1114), 0 states have call successors, (0), 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-11-02 20:47:57,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:57,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 128 [2022-11-02 20:47:57,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:59,049 INFO L130 PetriNetUnfolder]: 3419/6793 cut-off events. [2022-11-02 20:47:59,049 INFO L131 PetriNetUnfolder]: For 10969/11362 co-relation queries the response was YES. [2022-11-02 20:47:59,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19130 conditions, 6793 events. 3419/6793 cut-off events. For 10969/11362 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 55276 event pairs, 552 based on Foata normal form. 19/6309 useless extension candidates. Maximal degree in co-relation 19109. Up to 2199 conditions per place. [2022-11-02 20:47:59,162 INFO L137 encePairwiseOnDemand]: 120/128 looper letters, 134 selfloop transitions, 23 changer transitions 2/240 dead transitions. [2022-11-02 20:47:59,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 240 transitions, 1432 flow [2022-11-02 20:47:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:47:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:47:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 991 transitions. [2022-11-02 20:47:59,165 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8602430555555556 [2022-11-02 20:47:59,166 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 991 transitions. [2022-11-02 20:47:59,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 991 transitions. [2022-11-02 20:47:59,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:59,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 991 transitions. [2022-11-02 20:47:59,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 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-11-02 20:47:59,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 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-11-02 20:47:59,173 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 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-11-02 20:47:59,174 INFO L175 Difference]: Start difference. First operand has 153 places, 159 transitions, 715 flow. Second operand 9 states and 991 transitions. [2022-11-02 20:47:59,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 240 transitions, 1432 flow [2022-11-02 20:47:59,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 240 transitions, 1432 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:47:59,216 INFO L231 Difference]: Finished difference. Result has 165 places, 165 transitions, 854 flow [2022-11-02 20:47:59,217 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=854, PETRI_PLACES=165, PETRI_TRANSITIONS=165} [2022-11-02 20:47:59,217 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 50 predicate places. [2022-11-02 20:47:59,218 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 165 transitions, 854 flow [2022-11-02 20:47:59,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.27272727272727) internal successors, (1114), 11 states have internal predecessors, (1114), 0 states have call successors, (0), 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-11-02 20:47:59,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:59,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:59,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:59,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:59,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:47:59,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:59,421 INFO L85 PathProgramCache]: Analyzing trace with hash 201168604, now seen corresponding path program 3 times [2022-11-02 20:47:59,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:59,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31067618] [2022-11-02 20:47:59,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:59,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:59,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:59,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31067618] [2022-11-02 20:47:59,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31067618] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:59,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142322813] [2022-11-02 20:47:59,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:47:59,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:59,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:59,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:59,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:47:59,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-02 20:47:59,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:47:59,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:47:59,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:59,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:59,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142322813] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:59,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:59,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-11-02 20:47:59,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371676089] [2022-11-02 20:47:59,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:59,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:47:59,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:59,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:47:59,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:47:59,826 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 128 [2022-11-02 20:47:59,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 165 transitions, 854 flow. Second operand has 9 states, 9 states have (on average 100.88888888888889) internal successors, (908), 9 states have internal predecessors, (908), 0 states have call successors, (0), 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-11-02 20:47:59,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:59,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 128 [2022-11-02 20:47:59,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:01,507 INFO L130 PetriNetUnfolder]: 4565/9036 cut-off events. [2022-11-02 20:48:01,508 INFO L131 PetriNetUnfolder]: For 20788/21152 co-relation queries the response was YES. [2022-11-02 20:48:01,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27070 conditions, 9036 events. 4565/9036 cut-off events. For 20788/21152 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 77307 event pairs, 620 based on Foata normal form. 25/8494 useless extension candidates. Maximal degree in co-relation 27044. Up to 2830 conditions per place. [2022-11-02 20:48:01,649 INFO L137 encePairwiseOnDemand]: 120/128 looper letters, 143 selfloop transitions, 94 changer transitions 1/319 dead transitions. [2022-11-02 20:48:01,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 319 transitions, 2400 flow [2022-11-02 20:48:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:48:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:48:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1507 transitions. [2022-11-02 20:48:01,654 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8409598214285714 [2022-11-02 20:48:01,654 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1507 transitions. [2022-11-02 20:48:01,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1507 transitions. [2022-11-02 20:48:01,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:01,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1507 transitions. [2022-11-02 20:48:01,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 107.64285714285714) internal successors, (1507), 14 states have internal predecessors, (1507), 0 states have call successors, (0), 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-11-02 20:48:01,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 128.0) internal successors, (1920), 15 states have internal predecessors, (1920), 0 states have call successors, (0), 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-11-02 20:48:01,663 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 128.0) internal successors, (1920), 15 states have internal predecessors, (1920), 0 states have call successors, (0), 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-11-02 20:48:01,664 INFO L175 Difference]: Start difference. First operand has 165 places, 165 transitions, 854 flow. Second operand 14 states and 1507 transitions. [2022-11-02 20:48:01,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 319 transitions, 2400 flow [2022-11-02 20:48:01,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 319 transitions, 2159 flow, removed 69 selfloop flow, removed 5 redundant places. [2022-11-02 20:48:01,761 INFO L231 Difference]: Finished difference. Result has 183 places, 224 transitions, 1660 flow [2022-11-02 20:48:01,762 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1660, PETRI_PLACES=183, PETRI_TRANSITIONS=224} [2022-11-02 20:48:01,762 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 68 predicate places. [2022-11-02 20:48:01,763 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 224 transitions, 1660 flow [2022-11-02 20:48:01,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 100.88888888888889) internal successors, (908), 9 states have internal predecessors, (908), 0 states have call successors, (0), 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-11-02 20:48:01,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:01,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:01,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:01,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:01,979 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:48:01,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2127823980, now seen corresponding path program 3 times [2022-11-02 20:48:01,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:01,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796566866] [2022-11-02 20:48:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:01,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:02,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:02,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796566866] [2022-11-02 20:48:02,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796566866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:02,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:02,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:48:02,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258467002] [2022-11-02 20:48:02,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:02,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:48:02,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:02,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:48:02,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:02,094 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 128 [2022-11-02 20:48:02,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 224 transitions, 1660 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 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-11-02 20:48:02,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:02,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 128 [2022-11-02 20:48:02,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:04,102 INFO L130 PetriNetUnfolder]: 4327/9296 cut-off events. [2022-11-02 20:48:04,102 INFO L131 PetriNetUnfolder]: For 23596/23848 co-relation queries the response was YES. [2022-11-02 20:48:04,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27428 conditions, 9296 events. 4327/9296 cut-off events. For 23596/23848 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 84309 event pairs, 1375 based on Foata normal form. 8/8604 useless extension candidates. Maximal degree in co-relation 27395. Up to 4012 conditions per place. [2022-11-02 20:48:04,216 INFO L137 encePairwiseOnDemand]: 120/128 looper letters, 148 selfloop transitions, 29 changer transitions 12/270 dead transitions. [2022-11-02 20:48:04,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 270 transitions, 2356 flow [2022-11-02 20:48:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:48:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:48:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 663 transitions. [2022-11-02 20:48:04,219 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.86328125 [2022-11-02 20:48:04,219 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 663 transitions. [2022-11-02 20:48:04,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 663 transitions. [2022-11-02 20:48:04,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:04,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 663 transitions. [2022-11-02 20:48:04,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 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-11-02 20:48:04,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-11-02 20:48:04,224 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-11-02 20:48:04,224 INFO L175 Difference]: Start difference. First operand has 183 places, 224 transitions, 1660 flow. Second operand 6 states and 663 transitions. [2022-11-02 20:48:04,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 270 transitions, 2356 flow [2022-11-02 20:48:04,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 270 transitions, 2246 flow, removed 44 selfloop flow, removed 3 redundant places. [2022-11-02 20:48:04,353 INFO L231 Difference]: Finished difference. Result has 187 places, 224 transitions, 1671 flow [2022-11-02 20:48:04,354 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1671, PETRI_PLACES=187, PETRI_TRANSITIONS=224} [2022-11-02 20:48:04,355 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 72 predicate places. [2022-11-02 20:48:04,355 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 224 transitions, 1671 flow [2022-11-02 20:48:04,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 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-11-02 20:48:04,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:04,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:04,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:48:04,356 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:48:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash -188699914, now seen corresponding path program 4 times [2022-11-02 20:48:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:04,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232702341] [2022-11-02 20:48:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:04,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:04,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:04,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232702341] [2022-11-02 20:48:04,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232702341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:04,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:04,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:48:04,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045983865] [2022-11-02 20:48:04,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:04,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:48:04,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:04,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:48:04,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:48:04,484 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 128 [2022-11-02 20:48:04,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 224 transitions, 1671 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 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-11-02 20:48:04,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:04,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 128 [2022-11-02 20:48:04,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:06,569 INFO L130 PetriNetUnfolder]: 4696/10688 cut-off events. [2022-11-02 20:48:06,570 INFO L131 PetriNetUnfolder]: For 24644/25040 co-relation queries the response was YES. [2022-11-02 20:48:06,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29914 conditions, 10688 events. 4696/10688 cut-off events. For 24644/25040 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 103379 event pairs, 1567 based on Foata normal form. 41/9873 useless extension candidates. Maximal degree in co-relation 29881. Up to 2908 conditions per place. [2022-11-02 20:48:06,702 INFO L137 encePairwiseOnDemand]: 120/128 looper letters, 154 selfloop transitions, 43 changer transitions 3/281 dead transitions. [2022-11-02 20:48:06,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 281 transitions, 2410 flow [2022-11-02 20:48:06,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:48:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:48:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 675 transitions. [2022-11-02 20:48:06,705 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.87890625 [2022-11-02 20:48:06,705 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 675 transitions. [2022-11-02 20:48:06,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 675 transitions. [2022-11-02 20:48:06,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:06,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 675 transitions. [2022-11-02 20:48:06,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 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-11-02 20:48:06,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-11-02 20:48:06,710 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-11-02 20:48:06,710 INFO L175 Difference]: Start difference. First operand has 187 places, 224 transitions, 1671 flow. Second operand 6 states and 675 transitions. [2022-11-02 20:48:06,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 281 transitions, 2410 flow [2022-11-02 20:48:06,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 281 transitions, 2326 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-02 20:48:06,814 INFO L231 Difference]: Finished difference. Result has 187 places, 227 transitions, 1808 flow [2022-11-02 20:48:06,814 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1808, PETRI_PLACES=187, PETRI_TRANSITIONS=227} [2022-11-02 20:48:06,815 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 72 predicate places. [2022-11-02 20:48:06,815 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 227 transitions, 1808 flow [2022-11-02 20:48:06,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 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-11-02 20:48:06,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:06,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:06,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:48:06,816 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:48:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:06,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1717389180, now seen corresponding path program 4 times [2022-11-02 20:48:06,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:06,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930558861] [2022-11-02 20:48:06,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:06,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:06,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:06,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930558861] [2022-11-02 20:48:06,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930558861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:06,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024185101] [2022-11-02 20:48:06,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:48:06,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:06,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:06,938 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:06,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:48:07,053 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:48:07,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:48:07,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:48:07,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:07,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:07,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024185101] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:07,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:07,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-11-02 20:48:07,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543119585] [2022-11-02 20:48:07,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:07,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:48:07,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:07,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:48:07,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:48:07,256 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 128 [2022-11-02 20:48:07,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 227 transitions, 1808 flow. Second operand has 11 states, 11 states have (on average 101.54545454545455) internal successors, (1117), 11 states have internal predecessors, (1117), 0 states have call successors, (0), 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-11-02 20:48:07,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:07,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 128 [2022-11-02 20:48:07,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:08,907 INFO L130 PetriNetUnfolder]: 4801/10017 cut-off events. [2022-11-02 20:48:08,907 INFO L131 PetriNetUnfolder]: For 25428/26011 co-relation queries the response was YES. [2022-11-02 20:48:09,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29883 conditions, 10017 events. 4801/10017 cut-off events. For 25428/26011 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 90465 event pairs, 795 based on Foata normal form. 39/9346 useless extension candidates. Maximal degree in co-relation 29850. Up to 3062 conditions per place. [2022-11-02 20:48:09,192 INFO L137 encePairwiseOnDemand]: 120/128 looper letters, 144 selfloop transitions, 65 changer transitions 3/293 dead transitions. [2022-11-02 20:48:09,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 293 transitions, 2520 flow [2022-11-02 20:48:09,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:48:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:48:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 988 transitions. [2022-11-02 20:48:09,200 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8576388888888888 [2022-11-02 20:48:09,200 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 988 transitions. [2022-11-02 20:48:09,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 988 transitions. [2022-11-02 20:48:09,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:09,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 988 transitions. [2022-11-02 20:48:09,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.77777777777777) internal successors, (988), 9 states have internal predecessors, (988), 0 states have call successors, (0), 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-11-02 20:48:09,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 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-11-02 20:48:09,208 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 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-11-02 20:48:09,209 INFO L175 Difference]: Start difference. First operand has 187 places, 227 transitions, 1808 flow. Second operand 9 states and 988 transitions. [2022-11-02 20:48:09,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 293 transitions, 2520 flow [2022-11-02 20:48:09,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 293 transitions, 2458 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-02 20:48:09,326 INFO L231 Difference]: Finished difference. Result has 195 places, 228 transitions, 1935 flow [2022-11-02 20:48:09,326 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1935, PETRI_PLACES=195, PETRI_TRANSITIONS=228} [2022-11-02 20:48:09,327 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 80 predicate places. [2022-11-02 20:48:09,327 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 228 transitions, 1935 flow [2022-11-02 20:48:09,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.54545454545455) internal successors, (1117), 11 states have internal predecessors, (1117), 0 states have call successors, (0), 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-11-02 20:48:09,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:09,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:09,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-02 20:48:09,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:09,543 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:48:09,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:09,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1143659942, now seen corresponding path program 5 times [2022-11-02 20:48:09,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:09,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542975340] [2022-11-02 20:48:09,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:09,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:09,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:09,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542975340] [2022-11-02 20:48:09,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542975340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:09,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:09,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:48:09,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645338091] [2022-11-02 20:48:09,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:09,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:48:09,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:09,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:48:09,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:09,674 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 128 [2022-11-02 20:48:09,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 228 transitions, 1935 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 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-11-02 20:48:09,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:09,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 128 [2022-11-02 20:48:09,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:11,410 INFO L130 PetriNetUnfolder]: 4801/11202 cut-off events. [2022-11-02 20:48:11,410 INFO L131 PetriNetUnfolder]: For 29406/29824 co-relation queries the response was YES. [2022-11-02 20:48:11,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31866 conditions, 11202 events. 4801/11202 cut-off events. For 29406/29824 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 110907 event pairs, 1762 based on Foata normal form. 2/10298 useless extension candidates. Maximal degree in co-relation 31832. Up to 3319 conditions per place. [2022-11-02 20:48:11,522 INFO L137 encePairwiseOnDemand]: 121/128 looper letters, 141 selfloop transitions, 32 changer transitions 9/263 dead transitions. [2022-11-02 20:48:11,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 263 transitions, 2525 flow [2022-11-02 20:48:11,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:48:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:48:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 648 transitions. [2022-11-02 20:48:11,525 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.84375 [2022-11-02 20:48:11,525 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 648 transitions. [2022-11-02 20:48:11,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 648 transitions. [2022-11-02 20:48:11,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:11,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 648 transitions. [2022-11-02 20:48:11,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 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-11-02 20:48:11,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-11-02 20:48:11,529 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-11-02 20:48:11,529 INFO L175 Difference]: Start difference. First operand has 195 places, 228 transitions, 1935 flow. Second operand 6 states and 648 transitions. [2022-11-02 20:48:11,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 263 transitions, 2525 flow [2022-11-02 20:48:11,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 263 transitions, 2357 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-11-02 20:48:11,631 INFO L231 Difference]: Finished difference. Result has 195 places, 228 transitions, 1850 flow [2022-11-02 20:48:11,631 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=1781, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1850, PETRI_PLACES=195, PETRI_TRANSITIONS=228} [2022-11-02 20:48:11,632 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 80 predicate places. [2022-11-02 20:48:11,632 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 228 transitions, 1850 flow [2022-11-02 20:48:11,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 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-11-02 20:48:11,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:11,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:11,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:48:11,633 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:48:11,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash 663724876, now seen corresponding path program 6 times [2022-11-02 20:48:11,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:11,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463531437] [2022-11-02 20:48:11,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:11,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:11,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:11,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463531437] [2022-11-02 20:48:11,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463531437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:11,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:11,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:48:11,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024450696] [2022-11-02 20:48:11,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:11,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:48:11,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:11,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:48:11,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:11,730 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 128 [2022-11-02 20:48:11,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 228 transitions, 1850 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 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-11-02 20:48:11,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:11,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 128 [2022-11-02 20:48:11,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:13,793 INFO L130 PetriNetUnfolder]: 4523/10762 cut-off events. [2022-11-02 20:48:13,793 INFO L131 PetriNetUnfolder]: For 25312/25689 co-relation queries the response was YES. [2022-11-02 20:48:13,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29570 conditions, 10762 events. 4523/10762 cut-off events. For 25312/25689 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 107232 event pairs, 1773 based on Foata normal form. 8/9889 useless extension candidates. Maximal degree in co-relation 29538. Up to 3012 conditions per place. [2022-11-02 20:48:13,944 INFO L137 encePairwiseOnDemand]: 120/128 looper letters, 131 selfloop transitions, 34 changer transitions 11/257 dead transitions. [2022-11-02 20:48:13,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 257 transitions, 2375 flow [2022-11-02 20:48:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:48:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:48:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2022-11-02 20:48:13,947 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8625 [2022-11-02 20:48:13,947 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2022-11-02 20:48:13,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2022-11-02 20:48:13,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:13,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2022-11-02 20:48:13,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 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-11-02 20:48:13,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 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-11-02 20:48:13,952 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 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-11-02 20:48:13,952 INFO L175 Difference]: Start difference. First operand has 195 places, 228 transitions, 1850 flow. Second operand 5 states and 552 transitions. [2022-11-02 20:48:13,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 257 transitions, 2375 flow [2022-11-02 20:48:14,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 257 transitions, 2340 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-02 20:48:14,023 INFO L231 Difference]: Finished difference. Result has 196 places, 226 transitions, 1847 flow [2022-11-02 20:48:14,024 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1847, PETRI_PLACES=196, PETRI_TRANSITIONS=226} [2022-11-02 20:48:14,025 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 81 predicate places. [2022-11-02 20:48:14,025 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 226 transitions, 1847 flow [2022-11-02 20:48:14,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 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-11-02 20:48:14,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:14,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:14,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:48:14,027 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:48:14,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1658229622, now seen corresponding path program 1 times [2022-11-02 20:48:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:14,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502664965] [2022-11-02 20:48:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:14,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:14,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502664965] [2022-11-02 20:48:14,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502664965] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:14,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788356665] [2022-11-02 20:48:14,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:14,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:14,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:14,362 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:14,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:48:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:14,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:48:14,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:15,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:48:15,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788356665] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:15,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:15,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 10 [2022-11-02 20:48:15,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13659974] [2022-11-02 20:48:15,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:15,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:48:15,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:15,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:48:15,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:48:15,515 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 128 [2022-11-02 20:48:15,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 226 transitions, 1847 flow. Second operand has 10 states, 10 states have (on average 105.9) internal successors, (1059), 10 states have internal predecessors, (1059), 0 states have call successors, (0), 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-11-02 20:48:15,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:15,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 128 [2022-11-02 20:48:15,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:17,126 INFO L130 PetriNetUnfolder]: 2557/8872 cut-off events. [2022-11-02 20:48:17,126 INFO L131 PetriNetUnfolder]: For 17033/17542 co-relation queries the response was YES. [2022-11-02 20:48:17,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21454 conditions, 8872 events. 2557/8872 cut-off events. For 17033/17542 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 98451 event pairs, 289 based on Foata normal form. 411/8638 useless extension candidates. Maximal degree in co-relation 21422. Up to 1816 conditions per place. [2022-11-02 20:48:17,283 INFO L137 encePairwiseOnDemand]: 119/128 looper letters, 60 selfloop transitions, 23 changer transitions 13/301 dead transitions. [2022-11-02 20:48:17,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 301 transitions, 2283 flow [2022-11-02 20:48:17,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:48:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:48:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1542 transitions. [2022-11-02 20:48:17,288 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8604910714285714 [2022-11-02 20:48:17,288 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1542 transitions. [2022-11-02 20:48:17,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1542 transitions. [2022-11-02 20:48:17,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:17,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1542 transitions. [2022-11-02 20:48:17,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 110.14285714285714) internal successors, (1542), 14 states have internal predecessors, (1542), 0 states have call successors, (0), 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-11-02 20:48:17,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 128.0) internal successors, (1920), 15 states have internal predecessors, (1920), 0 states have call successors, (0), 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-11-02 20:48:17,298 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 128.0) internal successors, (1920), 15 states have internal predecessors, (1920), 0 states have call successors, (0), 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-11-02 20:48:17,299 INFO L175 Difference]: Start difference. First operand has 196 places, 226 transitions, 1847 flow. Second operand 14 states and 1542 transitions. [2022-11-02 20:48:17,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 301 transitions, 2283 flow [2022-11-02 20:48:17,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 301 transitions, 2071 flow, removed 10 selfloop flow, removed 15 redundant places. [2022-11-02 20:48:17,354 INFO L231 Difference]: Finished difference. Result has 199 places, 246 transitions, 1828 flow [2022-11-02 20:48:17,354 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1828, PETRI_PLACES=199, PETRI_TRANSITIONS=246} [2022-11-02 20:48:17,355 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 84 predicate places. [2022-11-02 20:48:17,355 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 246 transitions, 1828 flow [2022-11-02 20:48:17,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.9) internal successors, (1059), 10 states have internal predecessors, (1059), 0 states have call successors, (0), 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-11-02 20:48:17,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:17,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:17,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:17,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:17,557 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:48:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1016574726, now seen corresponding path program 2 times [2022-11-02 20:48:17,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:17,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066482848] [2022-11-02 20:48:17,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:17,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:17,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066482848] [2022-11-02 20:48:17,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066482848] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:17,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343505096] [2022-11-02 20:48:17,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:48:17,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:17,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:17,798 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:17,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:48:17,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:48:17,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:48:17,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:48:17,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:18,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:48:18,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343505096] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:18,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:48:18,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 10 [2022-11-02 20:48:18,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183528350] [2022-11-02 20:48:18,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:18,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:48:18,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:18,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:48:18,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:48:18,740 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 128 [2022-11-02 20:48:18,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 246 transitions, 1828 flow. Second operand has 7 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 0 states have call successors, (0), 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-11-02 20:48:18,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:18,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 128 [2022-11-02 20:48:18,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:19,989 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][186], [1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 4031#(and (<= ~counter2~0 (+ ~counter1~0 1)) (< ~counter1~0 ~counter2~0)), 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 140#(= ~counter1~0 0), 138#true, 1852#(<= 1 ~M~0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 73#L92-4true, 52#L41-3true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:48:19,990 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:48:19,990 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:48:19,990 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 20:48:19,990 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:48:20,141 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] thread1EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4) (= 0 v_thread1Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][251], [88#L93-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 1294#true, 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 140#(= ~counter1~0 0), 138#true, Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 699#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~M~0)), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), 10#L62-3true, Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1)))]) [2022-11-02 20:48:20,142 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-11-02 20:48:20,142 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-02 20:48:20,142 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-02 20:48:20,142 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:48:20,146 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][186], [1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 4031#(and (<= ~counter2~0 (+ ~counter1~0 1)) (< ~counter1~0 ~counter2~0)), 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 140#(= ~counter1~0 0), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 73#L92-4true, 70#L41-5true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0))]) [2022-11-02 20:48:20,146 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,146 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:20,147 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,147 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,148 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][204], [Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:48:20,148 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,149 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,149 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,149 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:20,160 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] thread1EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4) (= 0 v_thread1Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][250], [1282#(and (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread3Thread1of1ForFork1_~i~2 ~M~0)), 88#L93-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 84#L63true, Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 4031#(and (<= ~counter2~0 (+ ~counter1~0 1)) (< ~counter1~0 ~counter2~0)), 2992#(and (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread3Thread1of1ForFork1_~i~2 ~M~0)), 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0))]) [2022-11-02 20:48:20,161 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-02 20:48:20,161 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,161 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,161 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,162 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] thread1EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4) (= 0 v_thread1Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][250], [88#L93-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 1294#true, 4031#(and (<= ~counter2~0 (+ ~counter1~0 1)) (< ~counter1~0 ~counter2~0)), 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 699#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~M~0)), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 10#L62-3true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true]) [2022-11-02 20:48:20,162 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-02 20:48:20,163 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:48:20,163 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:48:20,163 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:48:20,164 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][203], [Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1)))]) [2022-11-02 20:48:20,164 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,164 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,164 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,165 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,165 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][185], [1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), 52#L41-3true, Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:48:20,166 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-11-02 20:48:20,166 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:48:20,166 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:48:20,166 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:48:20,167 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][185], [1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, 73#L92-4true, 70#L41-5true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0))]) [2022-11-02 20:48:20,167 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,167 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,167 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,167 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,492 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] thread1EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4) (= 0 v_thread1Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][251], [1282#(and (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread3Thread1of1ForFork1_~i~2 ~M~0)), 88#L93-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 84#L63true, Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 2992#(and (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread3Thread1of1ForFork1_~i~2 ~M~0)), 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 140#(= ~counter1~0 0), 138#true, Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1)))]) [2022-11-02 20:48:20,493 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,493 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,493 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,493 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,511 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] thread1EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4) (= 0 v_thread1Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][242], [88#L93-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 1294#true, 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, 699#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~M~0)), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), 10#L62-3true, Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true]) [2022-11-02 20:48:20,512 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-11-02 20:48:20,512 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:48:20,512 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:48:20,512 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:48:20,512 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][176], [1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1852#(<= 1 ~M~0), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, 73#L92-4true, 70#L41-5true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0))]) [2022-11-02 20:48:20,512 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,513 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:20,513 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,513 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,514 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][63], [Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:48:20,514 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,514 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,514 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,514 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:20,534 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([394] thread1EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4) (= 0 v_thread1Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][250], [88#L93-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 2444#true, 4031#(and (<= ~counter2~0 (+ ~counter1~0 1)) (< ~counter1~0 ~counter2~0)), 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 699#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~M~0)), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), 10#L62-3true, Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true]) [2022-11-02 20:48:20,535 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-02 20:48:20,535 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:48:20,535 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:48:20,535 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:48:20,535 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:48:20,535 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([394] thread1EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4) (= 0 v_thread1Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][251], [88#L93-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 2444#true, 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 699#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~M~0)), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), 10#L62-3true, Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1)))]) [2022-11-02 20:48:20,535 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-11-02 20:48:20,535 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-02 20:48:20,535 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-02 20:48:20,535 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-11-02 20:48:20,536 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:48:20,537 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][185], [1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 732#true, Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, 73#L92-4true, 70#L41-5true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0))]) [2022-11-02 20:48:20,537 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,537 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,537 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,537 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,537 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,538 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][186], [1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 732#true, Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 4031#(and (<= ~counter2~0 (+ ~counter1~0 1)) (< ~counter1~0 ~counter2~0)), 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 73#L92-4true, 70#L41-5true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0))]) [2022-11-02 20:48:20,538 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,538 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,538 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:20,538 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,539 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,540 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][203], [Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 140#(= ~counter1~0 0), 138#true, Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1)))]) [2022-11-02 20:48:20,541 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,541 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,541 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,541 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,541 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,542 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][204], [Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 140#(= ~counter1~0 0), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:48:20,542 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,542 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,542 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,542 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,543 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:20,607 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] thread1EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4) (= 0 v_thread1Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][242], [1282#(and (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread3Thread1of1ForFork1_~i~2 ~M~0)), 88#L93-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), 84#L63true, Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 2992#(and (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread3Thread1of1ForFork1_~i~2 ~M~0)), 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0))]) [2022-11-02 20:48:20,607 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,607 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,607 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,608 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,628 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([394] thread1EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4) (= 0 v_thread1Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][250], [1282#(and (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread3Thread1of1ForFork1_~i~2 ~M~0)), 88#L93-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), 84#L63true, Black: 732#true, Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 4031#(and (<= ~counter2~0 (+ ~counter1~0 1)) (< ~counter1~0 ~counter2~0)), 2992#(and (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread3Thread1of1ForFork1_~i~2 ~M~0)), 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0))]) [2022-11-02 20:48:20,628 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-02 20:48:20,628 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,628 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:48:20,628 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,628 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 20:48:20,628 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([394] thread1EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4) (= 0 v_thread1Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][251], [1282#(and (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread3Thread1of1ForFork1_~i~2 ~M~0)), 88#L93-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), 84#L63true, Black: 732#true, Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 2992#(and (< thread3Thread1of1ForFork1_~i~2 (+ thread1Thread1of1ForFork2_~i~0 1)) (< thread3Thread1of1ForFork1_~i~2 ~M~0)), 3018#true, Black: 3603#(and (= ~counter1~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3601#(and (< ~counter2~0 (+ ~counter1~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3593#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3597#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 138#true, Black: 140#(= ~counter1~0 0), Black: 3595#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~counter2~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3599#(and (= ~counter1~0 0) (= ~counter2~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1)))]) [2022-11-02 20:48:20,628 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,628 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:20,628 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,629 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,629 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 20:48:20,878 INFO L130 PetriNetUnfolder]: 3555/11876 cut-off events. [2022-11-02 20:48:20,879 INFO L131 PetriNetUnfolder]: For 20231/21991 co-relation queries the response was YES. [2022-11-02 20:48:20,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31694 conditions, 11876 events. 3555/11876 cut-off events. For 20231/21991 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 136891 event pairs, 444 based on Foata normal form. 108/11001 useless extension candidates. Maximal degree in co-relation 31663. Up to 3338 conditions per place. [2022-11-02 20:48:21,055 INFO L137 encePairwiseOnDemand]: 119/128 looper letters, 56 selfloop transitions, 18 changer transitions 4/283 dead transitions. [2022-11-02 20:48:21,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 283 transitions, 2169 flow [2022-11-02 20:48:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:48:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:48:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 985 transitions. [2022-11-02 20:48:21,058 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8550347222222222 [2022-11-02 20:48:21,058 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 985 transitions. [2022-11-02 20:48:21,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 985 transitions. [2022-11-02 20:48:21,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:21,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 985 transitions. [2022-11-02 20:48:21,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 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-11-02 20:48:21,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 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-11-02 20:48:21,065 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 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-11-02 20:48:21,065 INFO L175 Difference]: Start difference. First operand has 199 places, 246 transitions, 1828 flow. Second operand 9 states and 985 transitions. [2022-11-02 20:48:21,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 283 transitions, 2169 flow [2022-11-02 20:48:21,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 283 transitions, 2051 flow, removed 56 selfloop flow, removed 7 redundant places. [2022-11-02 20:48:21,198 INFO L231 Difference]: Finished difference. Result has 199 places, 259 transitions, 1892 flow [2022-11-02 20:48:21,198 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1892, PETRI_PLACES=199, PETRI_TRANSITIONS=259} [2022-11-02 20:48:21,199 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 84 predicate places. [2022-11-02 20:48:21,199 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 259 transitions, 1892 flow [2022-11-02 20:48:21,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 0 states have call successors, (0), 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-11-02 20:48:21,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:21,200 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:21,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:21,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:21,427 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:48:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2143996766, now seen corresponding path program 3 times [2022-11-02 20:48:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:21,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687015655] [2022-11-02 20:48:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:21,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:21,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687015655] [2022-11-02 20:48:21,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687015655] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:21,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598716124] [2022-11-02 20:48:21,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:48:21,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:21,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:21,640 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:21,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:48:21,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:48:21,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:48:21,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:48:21,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:21,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:21,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598716124] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:21,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:21,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-11-02 20:48:21,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271479403] [2022-11-02 20:48:21,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:21,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:48:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:21,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:48:21,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:48:21,985 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 128 [2022-11-02 20:48:21,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 259 transitions, 1892 flow. Second operand has 16 states, 16 states have (on average 98.875) internal successors, (1582), 16 states have internal predecessors, (1582), 0 states have call successors, (0), 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-11-02 20:48:21,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:21,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 128 [2022-11-02 20:48:21,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:32,571 INFO L130 PetriNetUnfolder]: 24366/49292 cut-off events. [2022-11-02 20:48:32,572 INFO L131 PetriNetUnfolder]: For 103723/106700 co-relation queries the response was YES. [2022-11-02 20:48:32,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151259 conditions, 49292 events. 24366/49292 cut-off events. For 103723/106700 co-relation queries the response was YES. Maximal size of possible extension queue 2250. Compared 538473 event pairs, 2490 based on Foata normal form. 242/46904 useless extension candidates. Maximal degree in co-relation 151229. Up to 10399 conditions per place. [2022-11-02 20:48:33,190 INFO L137 encePairwiseOnDemand]: 117/128 looper letters, 515 selfloop transitions, 178 changer transitions 0/772 dead transitions. [2022-11-02 20:48:33,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 772 transitions, 6621 flow [2022-11-02 20:48:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:48:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-02 20:48:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2430 transitions. [2022-11-02 20:48:33,195 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8254076086956522 [2022-11-02 20:48:33,195 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2430 transitions. [2022-11-02 20:48:33,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2430 transitions. [2022-11-02 20:48:33,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:33,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2430 transitions. [2022-11-02 20:48:33,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 105.65217391304348) internal successors, (2430), 23 states have internal predecessors, (2430), 0 states have call successors, (0), 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-11-02 20:48:33,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 128.0) internal successors, (3072), 24 states have internal predecessors, (3072), 0 states have call successors, (0), 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-11-02 20:48:33,208 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 128.0) internal successors, (3072), 24 states have internal predecessors, (3072), 0 states have call successors, (0), 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-11-02 20:48:33,208 INFO L175 Difference]: Start difference. First operand has 199 places, 259 transitions, 1892 flow. Second operand 23 states and 2430 transitions. [2022-11-02 20:48:33,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 772 transitions, 6621 flow [2022-11-02 20:48:33,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 772 transitions, 6477 flow, removed 72 selfloop flow, removed 2 redundant places. [2022-11-02 20:48:34,134 INFO L231 Difference]: Finished difference. Result has 227 places, 362 transitions, 3454 flow [2022-11-02 20:48:34,136 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=1868, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3454, PETRI_PLACES=227, PETRI_TRANSITIONS=362} [2022-11-02 20:48:34,136 INFO L287 CegarLoopForPetriNet]: 115 programPoint places, 112 predicate places. [2022-11-02 20:48:34,136 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 362 transitions, 3454 flow [2022-11-02 20:48:34,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 98.875) internal successors, (1582), 16 states have internal predecessors, (1582), 0 states have call successors, (0), 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-11-02 20:48:34,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:34,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:34,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:34,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:48:34,351 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:48:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:34,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2040705634, now seen corresponding path program 1 times [2022-11-02 20:48:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:34,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799201819] [2022-11-02 20:48:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:48:34,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:34,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799201819] [2022-11-02 20:48:34,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799201819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:34,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748201248] [2022-11-02 20:48:34,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:34,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:34,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:34,504 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:34,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d3f6e4c-33d9-4a9c-848e-4d2efefb084b/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:48:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:34,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:48:34,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:48:34,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:48:34,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748201248] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:34,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:34,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-11-02 20:48:34,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321817830] [2022-11-02 20:48:34,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:34,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:48:34,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:34,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:48:34,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:48:34,784 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 128 [2022-11-02 20:48:34,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 362 transitions, 3454 flow. Second operand has 9 states, 9 states have (on average 101.33333333333333) internal successors, (912), 9 states have internal predecessors, (912), 0 states have call successors, (0), 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-11-02 20:48:34,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:34,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 128 [2022-11-02 20:48:34,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:43,684 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][153], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 4879#(<= 1 ~N~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 75#L52true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 9#L91-4true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:48:43,684 INFO L383 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-11-02 20:48:43,684 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:43,684 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:43,684 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:43,684 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][153], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 4879#(<= 1 ~N~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 9#L91-4true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:48:43,685 INFO L383 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-11-02 20:48:43,685 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:48:43,685 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:48:43,685 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:48:43,685 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][153], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 107#L51-2true, Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 4879#(<= 1 ~N~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 9#L91-4true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:48:43,685 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-11-02 20:48:43,685 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:48:43,685 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:48:43,685 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 20:48:43,686 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][153], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 4879#(<= 1 ~N~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 9#L91-4true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 38#L51-3true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:48:43,686 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-11-02 20:48:43,686 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 20:48:43,686 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 20:48:43,686 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 20:48:43,686 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][217], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 9#L91-4true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), 37#L51-5true, Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 5479#(and (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= 1 ~N~0))]) [2022-11-02 20:48:43,686 INFO L383 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-11-02 20:48:43,686 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:43,687 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:43,687 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:51,281 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][514], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 5222#(< |thread4Thread1of1ForFork3_~i~3#1| ~N~0), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 124#thread2ENTRYtrue, 3018#true, 2401#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 1 ~M~0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), 10#L62-3true, Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:48:51,281 INFO L383 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-11-02 20:48:51,281 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:48:51,281 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:51,281 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:54,144 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][515], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), 30#L51-4true, Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 2401#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 1 ~M~0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 10#L62-3true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 5484#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0))]) [2022-11-02 20:48:54,145 INFO L383 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-11-02 20:48:54,145 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:48:54,145 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:48:54,145 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:48:54,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][514], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), 5222#(< |thread4Thread1of1ForFork3_~i~3#1| ~N~0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 124#thread2ENTRYtrue, 3018#true, 2401#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 1 ~M~0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 6#L72-2true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 10#L62-3true, 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:48:54,151 INFO L383 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-11-02 20:48:54,151 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:48:54,151 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:48:54,151 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:48:57,175 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][515], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 2401#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 1 ~M~0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), 37#L51-5true, Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 10#L62-3true, 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 5484#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0))]) [2022-11-02 20:48:57,175 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-11-02 20:48:57,175 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:48:57,175 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:48:57,175 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 20:48:57,179 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][545], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), 79#L41-4true, Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 732#true, Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 5486#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 6#L72-2true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:48:57,179 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-02 20:48:57,179 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:57,179 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:48:57,179 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:57,180 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][545], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), 79#L41-4true, Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 732#true, Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 5486#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:48:57,180 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-02 20:48:57,180 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:48:57,180 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:48:57,180 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:48:57,180 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][545], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), 79#L41-4true, Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 732#true, Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 5486#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), 26#L73true, Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:48:57,180 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 20:48:57,180 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:48:57,180 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:48:57,180 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:48:57,182 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][544], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 5486#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 2401#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 1 ~M~0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 75#L52true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 10#L62-3true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:48:57,182 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-11-02 20:48:57,182 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 20:48:57,182 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:48:57,182 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:48:57,186 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][515], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), 30#L51-4true, Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 2401#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 1 ~M~0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 6#L72-2true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 10#L62-3true, 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 5484#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0))]) [2022-11-02 20:48:57,186 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-11-02 20:48:57,186 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 20:48:57,186 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:48:57,186 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:48:57,192 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][514], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 5222#(< |thread4Thread1of1ForFork3_~i~3#1| ~N~0), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 124#thread2ENTRYtrue, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, 74#L76true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:48:57,192 INFO L383 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-11-02 20:48:57,192 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:48:57,192 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:48:57,192 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 20:48:59,642 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][512], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), 5222#(< |thread4Thread1of1ForFork3_~i~3#1| ~N~0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 124#thread2ENTRYtrue, 3018#true, 2401#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 1 ~M~0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 26#L73true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 10#L62-3true, 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:48:59,643 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-02 20:48:59,643 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:48:59,643 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:48:59,643 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:48:59,644 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][513], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), 30#L51-4true, Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 2401#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 1 ~M~0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 26#L73true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 10#L62-3true, 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 5484#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0))]) [2022-11-02 20:48:59,644 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-02 20:48:59,644 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:59,644 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-02 20:48:59,645 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:48:59,645 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][513], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 2401#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 1 ~M~0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), 26#L73true, 37#L51-5true, Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 10#L62-3true, 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 5484#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0))]) [2022-11-02 20:48:59,645 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:48:59,645 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:48:59,646 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:48:59,646 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 20:49:00,549 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] thread1EXIT-->L93-2: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem19#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork2_thidvar0_4) (= 0 v_thread1Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_5|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][439], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 88#L93-2true, Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 2444#true, 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), 3018#true, 5486#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), 699#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (<= 1 ~M~0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 10#L62-3true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 135#true]) [2022-11-02 20:49:00,549 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,549 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,549 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,550 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,556 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][545], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 732#true, Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 5486#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 70#L41-5true, 6#L72-2true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0))]) [2022-11-02 20:49:00,556 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,557 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,557 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,557 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:49:00,557 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][545], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 732#true, Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 5486#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 70#L41-5true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0))]) [2022-11-02 20:49:00,557 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,557 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,557 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:49:00,558 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,558 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][545], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 732#true, Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 5486#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 1852#(<= 1 ~M~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), 26#L73true, Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 70#L41-5true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 135#true, 711#(and (<= 0 thread1Thread1of1ForFork2_~i~0) (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0))]) [2022-11-02 20:49:00,558 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,558 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,558 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,558 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,565 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][515], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 2401#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 1 ~M~0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), 37#L51-5true, Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 6#L72-2true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 10#L62-3true, 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 5484#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0))]) [2022-11-02 20:49:00,565 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,565 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,565 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,565 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 20:49:00,568 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][619], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 5491#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= 1 ~N~0)), 3018#true, 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 26#L73true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 38#L51-3true, 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,568 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,568 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,568 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,568 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,569 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][619], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 5491#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= 1 ~N~0)), 3018#true, 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 38#L51-3true, 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,569 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,569 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,569 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:49:00,569 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,569 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][619], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 5491#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= 1 ~N~0)), 3018#true, 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 75#L52true, 26#L73true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,570 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,570 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,570 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,570 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,570 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][619], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 5491#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= 1 ~N~0)), 3018#true, 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 75#L52true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,570 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,570 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,570 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,571 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,571 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][619], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 5491#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= 1 ~N~0)), 3018#true, 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), 68#L55true, Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 26#L73true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,571 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,571 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,571 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,571 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,571 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][619], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 5491#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= 1 ~N~0)), 3018#true, 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 6#L72-2true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 38#L51-3true, 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,572 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,572 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:49:00,572 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,572 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,572 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][677], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 5495#(and (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= 1 ~N~0)), 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), 37#L51-5true, Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,572 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,572 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,573 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,573 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,573 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][677], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 5495#(and (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= 1 ~N~0)), 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), 26#L73true, Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), 37#L51-5true, Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,573 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,573 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,573 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,573 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][545], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 107#L51-2true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 5486#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,574 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,574 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,574 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 20:49:00,574 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][545], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 107#L51-2true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 5486#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 26#L73true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,574 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,574 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,575 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,575 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,575 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][545], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 107#L51-2true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 5486#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 6#L72-2true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,575 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,575 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,575 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,575 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:49:00,576 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][350], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 4879#(<= 1 ~N~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), 68#L55true, Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 14#L72-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,576 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,576 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:49:00,576 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,576 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,577 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][350], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 4879#(<= 1 ~N~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 75#L52true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 14#L72-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,577 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,577 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,577 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,578 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,578 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][350], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 4879#(<= 1 ~N~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 14#L72-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 38#L51-3true, 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,578 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,578 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,578 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,579 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,579 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][350], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 107#L51-2true, 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 4879#(<= 1 ~N~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 14#L72-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,579 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,579 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,580 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,580 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,580 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][427], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 732#true, Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), 37#L51-5true, Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 14#L72-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true, 5479#(and (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= 1 ~N~0))]) [2022-11-02 20:49:00,580 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,581 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,581 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,581 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,583 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][547], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 5482#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 107#L51-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, 74#L76true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,584 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,584 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,584 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 20:49:00,584 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,585 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][547], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 5482#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 107#L51-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 6#L72-2true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,585 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,585 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,585 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,585 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:49:00,586 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][153], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 4879#(<= 1 ~N~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 13#thread4ENTRYtrue]) [2022-11-02 20:49:00,586 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,586 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,586 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,586 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:49:00,586 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][153], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 107#L51-2true, Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 4879#(<= 1 ~N~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 13#thread4ENTRYtrue]) [2022-11-02 20:49:00,586 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,587 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,587 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,587 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][153], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 4879#(<= 1 ~N~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 38#L51-3true, 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 13#thread4ENTRYtrue]) [2022-11-02 20:49:00,587 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,587 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,587 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,587 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,588 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][153], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), 4879#(<= 1 ~N~0), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 75#L52true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 13#thread4ENTRYtrue]) [2022-11-02 20:49:00,588 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,588 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,588 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,588 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,588 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][590], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 4880#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 26#L73true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 38#L51-3true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,588 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,589 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,589 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,589 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,589 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][590], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 4880#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 75#L52true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 14#L72-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,589 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,589 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,589 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,589 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,590 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][590], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 4880#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 75#L52true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 74#L76true, 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,590 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-11-02 20:49:00,590 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-02 20:49:00,590 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-02 20:49:00,590 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,590 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][590], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 4880#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 14#L72-4true, 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,590 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,591 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,591 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,591 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,591 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][590], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 4880#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 38#L51-3true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, 74#L76true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,591 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,591 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 20:49:00,591 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,591 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,592 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][590], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 4880#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 75#L52true, 26#L73true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,592 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,592 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,592 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,592 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,593 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][590], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 4880#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 14#L72-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 38#L51-3true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,593 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,593 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,593 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,593 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 20:49:00,594 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][590], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 4880#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 6#L72-2true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 38#L51-3true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,594 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,594 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,594 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,595 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,595 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][654], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 5493#(and (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), 26#L73true, Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), 37#L51-5true, Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,595 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,595 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,596 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,596 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-11-02 20:49:00,596 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][654], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 5493#(and (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), 37#L51-5true, Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, 74#L76true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,596 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-11-02 20:49:00,597 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-02 20:49:00,597 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-02 20:49:00,597 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 20:49:00,597 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][654], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), 5493#(and (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), 37#L51-5true, Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 14#L72-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,598 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,598 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,598 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,598 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 20:49:00,598 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][217], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), 37#L51-5true, Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 732#true, Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 13#thread4ENTRYtrue, 5479#(and (<= 0 |thread2Thread1of1ForFork0_~i~1#1|) (<= 1 ~N~0))]) [2022-11-02 20:49:00,599 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,599 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,599 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,599 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 20:49:00,611 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([371] L63-->L65: Formula: (= v_~counter2~0_14 (+ v_~counter2~0_15 1)) InVars {~counter2~0=v_~counter2~0_15} OutVars{~counter2~0=v_~counter2~0_14, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6][258], [4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), 1113#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 79#L41-4true, Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 732#true, Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 1294#true, 3018#true, 138#true, 1852#(<= 1 ~M~0), Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 68#L55true, 4878#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 3614#true, 23#L72-5true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 17#L65true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 2771#(< thread3Thread1of1ForFork1_~i~2 ~M~0), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 707#(and (< thread3Thread1of1ForFork1_~i~2 ~M~0) (<= 1 ~M~0)), 135#true]) [2022-11-02 20:49:00,612 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,612 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,612 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,612 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,620 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][544], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 5486#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 2401#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 1 ~M~0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 75#L52true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 6#L72-2true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), 10#L62-3true, Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,621 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,621 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,621 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 20:49:00,621 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,626 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][515], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), 30#L51-4true, Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 3614#true, 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 74#L76true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 5484#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0))]) [2022-11-02 20:49:00,626 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,626 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 20:49:00,626 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,627 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][514], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), 5222#(< |thread4Thread1of1ForFork3_~i~3#1| ~N~0), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 124#thread2ENTRYtrue, 3018#true, 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 3614#true, 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 2409#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1))), 73#L92-4true, 41#L62-5true, 6#L72-2true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 27#L44true, Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true]) [2022-11-02 20:49:00,634 INFO L383 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,634 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,635 INFO L386 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-11-02 20:49:00,635 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-02 20:49:00,905 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[~counter1~0, thread1Thread1of1ForFork2_#t~post2][585], [Black: 4833#(and (<= 1 thread1Thread1of1ForFork2_~i~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0)), Black: 4831#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4820#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|)), Black: 4204#(<= 1 thread1Thread1of1ForFork2_~i~0), Black: 4840#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 4855#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4849#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 4862#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2437#(and (= thread1Thread1of1ForFork2_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2436#(= thread3Thread1of1ForFork1_~i~2 0), Black: 4858#(and (<= 2 ~M~0) (= |thread3Thread1of1ForFork1_#t~post5| 0) (<= 1 thread1Thread1of1ForFork2_~i~0) (<= 0 |thread1Thread1of1ForFork2_#t~post1|) (<= thread3Thread1of1ForFork1_~i~2 1)), Black: 2439#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 737#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), 2444#true, 5491#(and (< |thread4Thread1of1ForFork3_~i~3#1| ~N~0) (<= 1 ~N~0)), 3018#true, 2401#(and (< thread1Thread1of1ForFork2_~i~0 ~M~0) (<= 1 ~M~0)), 138#true, Black: 145#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 3023#(and (< ~counter2~0 (+ ~counter1~0 1)) (<= ~counter1~0 ~counter2~0)), Black: 3021#(and (= ~counter1~0 0) (= ~counter2~0 0)), Black: 3206#(and (<= ~counter1~0 1) (<= 1 ~counter1~0) (= ~counter2~0 1)), 4817#(and (<= 2 ~M~0) (<= 1 thread1Thread1of1ForFork2_~i~0)), 26#L73true, Black: 3618#(and (= ~counter1~0 0) (<= ~counter2~0 1) (<= 1 ~counter2~0)), Black: 3617#(and (= ~counter1~0 0) (= ~counter2~0 0)), 73#L92-4true, 159#(<= 1 ~M~0), Black: 1851#(and (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~M~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 2403#(and (<= 0 thread3Thread1of1ForFork1_~i~2) (<= 1 ~M~0)), 10#L62-3true, 38#L51-3true, 27#L44true, Black: 2449#(and (= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~M~0)), Black: 1852#(<= 1 ~M~0), Black: 1299#(and (= thread1Thread1of1ForFork2_~i~0 0) (<= 1 ~M~0)), Black: 1296#(= thread1Thread1of1ForFork2_~i~0 0), 732#true, 1651#(< thread1Thread1of1ForFork2_~i~0 ~M~0), 135#true, 3619#(and (<= ~counter2~0 ~counter1~0) (< ~counter1~0 (+ ~counter2~0 1)))]) [2022-11-02 20:49:00,905 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-11-02 20:49:00,905 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-11-02 20:49:00,905 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 20:49:00,905 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event