./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --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 e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:49:44,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:49:44,538 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:49:44,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:49:44,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:49:44,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:49:44,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:49:44,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:49:44,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:49:44,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:49:44,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:49:44,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:49:44,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:49:44,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:49:44,582 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:49:44,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:49:44,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:49:44,583 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:49:44,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:49:44,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:49:44,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:49:44,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:49:44,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:49:44,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:49:44,584 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:49:44,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:49:44,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:49:44,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:49:44,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:49:44,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:49:44,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:49:44,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:49:44,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:49:44,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:49:44,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:49:44,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:49:44,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:49:44,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:49:44,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:49:44,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:49:44,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:49:44,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:49:44,585 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe [2024-11-13 15:49:44,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:49:44,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:49:44,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:49:44,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:49:44,982 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:49:44,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c Unable to find full path for "g++" [2024-11-13 15:49:47,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:49:47,643 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:49:47,644 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2024-11-13 15:49:47,657 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/data/d3b14d911/e413528968004a5c828abc9b56172cc3/FLAG00d0be04c [2024-11-13 15:49:47,931 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/data/d3b14d911/e413528968004a5c828abc9b56172cc3 [2024-11-13 15:49:47,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:49:47,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:49:47,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:49:47,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:49:47,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:49:47,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:49:47" (1/1) ... [2024-11-13 15:49:47,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237e2c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:47, skipping insertion in model container [2024-11-13 15:49:47,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:49:47" (1/1) ... [2024-11-13 15:49:47,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:49:48,239 WARN L250 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_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c[4270,4283] [2024-11-13 15:49:48,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:49:48,282 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:49:48,334 WARN L250 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_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c[4270,4283] [2024-11-13 15:49:48,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:49:48,379 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:49:48,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48 WrapperNode [2024-11-13 15:49:48,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:49:48,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:49:48,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:49:48,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:49:48,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (1/1) ... [2024-11-13 15:49:48,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (1/1) ... [2024-11-13 15:49:48,460 INFO L138 Inliner]: procedures = 26, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 290 [2024-11-13 15:49:48,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:49:48,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:49:48,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:49:48,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:49:48,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (1/1) ... [2024-11-13 15:49:48,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (1/1) ... [2024-11-13 15:49:48,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (1/1) ... [2024-11-13 15:49:48,526 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-13 15:49:48,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (1/1) ... [2024-11-13 15:49:48,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (1/1) ... [2024-11-13 15:49:48,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (1/1) ... [2024-11-13 15:49:48,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (1/1) ... [2024-11-13 15:49:48,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (1/1) ... [2024-11-13 15:49:48,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (1/1) ... [2024-11-13 15:49:48,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:49:48,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:49:48,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:49:48,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:49:48,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (1/1) ... [2024-11-13 15:49:48,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:49:48,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:48,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:49:48,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:49:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:49:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 15:49:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 15:49:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 15:49:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 15:49:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-13 15:49:48,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-13 15:49:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-13 15:49:48,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-13 15:49:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-13 15:49:48,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-13 15:49:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-13 15:49:48,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-13 15:49:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:49:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:49:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 15:49:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 15:49:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:49:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:49:48,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:49:48,685 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 15:49:48,852 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:49:48,854 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:49:49,521 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 15:49:49,522 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:49:50,149 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:49:50,149 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-13 15:49:50,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:49:50 BoogieIcfgContainer [2024-11-13 15:49:50,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:49:50,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:49:50,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:49:50,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:49:50,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:49:47" (1/3) ... [2024-11-13 15:49:50,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34785872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:49:50, skipping insertion in model container [2024-11-13 15:49:50,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:48" (2/3) ... [2024-11-13 15:49:50,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34785872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:49:50, skipping insertion in model container [2024-11-13 15:49:50,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:49:50" (3/3) ... [2024-11-13 15:49:50,162 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2024-11-13 15:49:50,178 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:49:50,180 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult.wvr.c that has 5 procedures, 45 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2024-11-13 15:49:50,180 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 15:49:50,268 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-13 15:49:50,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 128 flow [2024-11-13 15:49:50,434 INFO L124 PetriNetUnfolderBase]: 6/46 cut-off events. [2024-11-13 15:49:50,436 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-13 15:49:50,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 6/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-11-13 15:49:50,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 128 flow [2024-11-13 15:49:50,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 45 transitions, 114 flow [2024-11-13 15:49:50,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:49:50,470 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@78bbf4ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:49:50,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-13 15:49:50,497 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 15:49:50,499 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2024-11-13 15:49:50,499 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-13 15:49:50,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:49:50,500 INFO L204 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] [2024-11-13 15:49:50,501 INFO L396 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)] === [2024-11-13 15:49:50,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash -745512136, now seen corresponding path program 1 times [2024-11-13 15:49:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:50,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101949558] [2024-11-13 15:49:50,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:50,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:49:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101949558] [2024-11-13 15:49:51,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101949558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:51,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:51,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:49:51,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206658777] [2024-11-13 15:49:51,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:51,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:49:51,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:51,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:49:51,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:49:51,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-11-13 15:49:51,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:49:51,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:49:51,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-11-13 15:49:51,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:49:52,131 INFO L124 PetriNetUnfolderBase]: 2407/3678 cut-off events. [2024-11-13 15:49:52,132 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-11-13 15:49:52,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6947 conditions, 3678 events. 2407/3678 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20732 event pairs, 472 based on Foata normal form. 1/3448 useless extension candidates. Maximal degree in co-relation 6259. Up to 2067 conditions per place. [2024-11-13 15:49:52,189 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 41 selfloop transitions, 3 changer transitions 1/62 dead transitions. [2024-11-13 15:49:52,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 253 flow [2024-11-13 15:49:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:49:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:49:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-13 15:49:52,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7266666666666667 [2024-11-13 15:49:52,220 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 114 flow. Second operand 3 states and 109 transitions. [2024-11-13 15:49:52,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 253 flow [2024-11-13 15:49:52,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 227 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-13 15:49:52,247 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 117 flow [2024-11-13 15:49:52,251 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2024-11-13 15:49:52,255 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2024-11-13 15:49:52,257 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 117 flow [2024-11-13 15:49:52,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:49:52,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:49:52,259 INFO L204 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] [2024-11-13 15:49:52,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:49:52,260 INFO L396 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)] === [2024-11-13 15:49:52,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash -852512553, now seen corresponding path program 1 times [2024-11-13 15:49:52,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:52,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400874104] [2024-11-13 15:49:52,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:52,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:49:52,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:52,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400874104] [2024-11-13 15:49:52,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400874104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:52,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:52,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:49:52,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687515627] [2024-11-13 15:49:52,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:52,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:49:52,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:52,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:49:52,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:49:52,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-11-13 15:49:52,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:49:52,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:49:52,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-11-13 15:49:52,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:49:53,560 INFO L124 PetriNetUnfolderBase]: 2397/3614 cut-off events. [2024-11-13 15:49:53,560 INFO L125 PetriNetUnfolderBase]: For 606/606 co-relation queries the response was YES. [2024-11-13 15:49:53,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7545 conditions, 3614 events. 2397/3614 cut-off events. For 606/606 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 20451 event pairs, 549 based on Foata normal form. 76/3518 useless extension candidates. Maximal degree in co-relation 2629. Up to 2321 conditions per place. [2024-11-13 15:49:53,599 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 49 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-11-13 15:49:53,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 275 flow [2024-11-13 15:49:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:49:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:49:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-13 15:49:53,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7466666666666667 [2024-11-13 15:49:53,604 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 117 flow. Second operand 3 states and 112 transitions. [2024-11-13 15:49:53,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 275 flow [2024-11-13 15:49:53,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:49:53,610 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 128 flow [2024-11-13 15:49:53,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2024-11-13 15:49:53,611 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-13 15:49:53,612 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 128 flow [2024-11-13 15:49:53,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:49:53,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:49:53,613 INFO L204 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] [2024-11-13 15:49:53,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:49:53,614 INFO L396 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)] === [2024-11-13 15:49:53,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1067128559, now seen corresponding path program 1 times [2024-11-13 15:49:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:53,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369374217] [2024-11-13 15:49:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:53,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:49:53,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:53,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369374217] [2024-11-13 15:49:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369374217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:53,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:53,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:49:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740948918] [2024-11-13 15:49:53,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:53,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:49:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:53,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:49:53,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:49:53,930 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-11-13 15:49:53,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:49:53,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:49:53,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-11-13 15:49:53,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:49:54,595 INFO L124 PetriNetUnfolderBase]: 2362/3737 cut-off events. [2024-11-13 15:49:54,595 INFO L125 PetriNetUnfolderBase]: For 1405/1405 co-relation queries the response was YES. [2024-11-13 15:49:54,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8143 conditions, 3737 events. 2362/3737 cut-off events. For 1405/1405 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22729 event pairs, 571 based on Foata normal form. 41/3625 useless extension candidates. Maximal degree in co-relation 5952. Up to 2334 conditions per place. [2024-11-13 15:49:54,626 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 49 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-11-13 15:49:54,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 291 flow [2024-11-13 15:49:54,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:49:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 15:49:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-11-13 15:49:54,628 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-11-13 15:49:54,628 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 128 flow. Second operand 3 states and 110 transitions. [2024-11-13 15:49:54,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 291 flow [2024-11-13 15:49:54,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:49:54,634 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 140 flow [2024-11-13 15:49:54,634 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2024-11-13 15:49:54,636 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-13 15:49:54,636 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 140 flow [2024-11-13 15:49:54,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:49:54,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:49:54,636 INFO L204 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] [2024-11-13 15:49:54,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:49:54,640 INFO L396 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)] === [2024-11-13 15:49:54,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash 586654602, now seen corresponding path program 1 times [2024-11-13 15:49:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:54,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144289688] [2024-11-13 15:49:54,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:54,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:49:55,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:55,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144289688] [2024-11-13 15:49:55,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144289688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:55,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:55,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:49:55,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732279222] [2024-11-13 15:49:55,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:55,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:49:55,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:55,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:49:55,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:49:55,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-11-13 15:49:55,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:49:55,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:49:55,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-11-13 15:49:55,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:49:55,976 INFO L124 PetriNetUnfolderBase]: 2793/4408 cut-off events. [2024-11-13 15:49:55,976 INFO L125 PetriNetUnfolderBase]: For 2258/2258 co-relation queries the response was YES. [2024-11-13 15:49:55,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10211 conditions, 4408 events. 2793/4408 cut-off events. For 2258/2258 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 29116 event pairs, 2080 based on Foata normal form. 94/4005 useless extension candidates. Maximal degree in co-relation 4744. Up to 3077 conditions per place. [2024-11-13 15:49:56,015 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 55 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2024-11-13 15:49:56,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 331 flow [2024-11-13 15:49:56,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:49:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 15:49:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-11-13 15:49:56,020 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.685 [2024-11-13 15:49:56,020 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 140 flow. Second operand 4 states and 137 transitions. [2024-11-13 15:49:56,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 331 flow [2024-11-13 15:49:56,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 15:49:56,028 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 158 flow [2024-11-13 15:49:56,029 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-11-13 15:49:56,029 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-11-13 15:49:56,030 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 158 flow [2024-11-13 15:49:56,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:49:56,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:49:56,032 INFO L204 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] [2024-11-13 15:49:56,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:49:56,033 INFO L396 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)] === [2024-11-13 15:49:56,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1846061854, now seen corresponding path program 1 times [2024-11-13 15:49:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929306185] [2024-11-13 15:49:56,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:56,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:49:56,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:56,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929306185] [2024-11-13 15:49:56,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929306185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:56,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:56,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:49:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330359597] [2024-11-13 15:49:56,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:56,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:49:56,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:56,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:49:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:49:56,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-11-13 15:49:56,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:49:56,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:49:56,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-11-13 15:49:56,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:49:57,436 INFO L124 PetriNetUnfolderBase]: 3453/5659 cut-off events. [2024-11-13 15:49:57,436 INFO L125 PetriNetUnfolderBase]: For 2900/2900 co-relation queries the response was YES. [2024-11-13 15:49:57,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12770 conditions, 5659 events. 3453/5659 cut-off events. For 2900/2900 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 40667 event pairs, 2644 based on Foata normal form. 137/5204 useless extension candidates. Maximal degree in co-relation 10432. Up to 3841 conditions per place. [2024-11-13 15:49:57,491 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 54 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2024-11-13 15:49:57,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 346 flow [2024-11-13 15:49:57,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:49:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 15:49:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-11-13 15:49:57,494 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-11-13 15:49:57,494 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 158 flow. Second operand 4 states and 135 transitions. [2024-11-13 15:49:57,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 346 flow [2024-11-13 15:49:57,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 342 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-13 15:49:57,503 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 177 flow [2024-11-13 15:49:57,504 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2024-11-13 15:49:57,505 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-13 15:49:57,505 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 177 flow [2024-11-13 15:49:57,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:49:57,505 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:49:57,505 INFO L204 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] [2024-11-13 15:49:57,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:49:57,506 INFO L396 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)] === [2024-11-13 15:49:57,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1766747359, now seen corresponding path program 1 times [2024-11-13 15:49:57,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:57,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839379990] [2024-11-13 15:49:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:49:58,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:58,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839379990] [2024-11-13 15:49:58,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839379990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:49:58,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420835984] [2024-11-13 15:49:58,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:58,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:49:58,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:58,184 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:49:58,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:49:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:58,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 15:49:58,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:49:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:49:58,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:49:58,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420835984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:58,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:49:58,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-13 15:49:58,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738560183] [2024-11-13 15:49:58,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:58,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:49:58,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:58,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:49:58,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:49:58,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-11-13 15:49:58,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:49:58,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:49:58,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-11-13 15:49:58,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:50:01,813 INFO L124 PetriNetUnfolderBase]: 10650/15631 cut-off events. [2024-11-13 15:50:01,813 INFO L125 PetriNetUnfolderBase]: For 7412/7412 co-relation queries the response was YES. [2024-11-13 15:50:01,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36588 conditions, 15631 events. 10650/15631 cut-off events. For 7412/7412 co-relation queries the response was YES. Maximal size of possible extension queue 852. Compared 104149 event pairs, 1202 based on Foata normal form. 160/14734 useless extension candidates. Maximal degree in co-relation 29423. Up to 6675 conditions per place. [2024-11-13 15:50:01,944 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 118 selfloop transitions, 13 changer transitions 0/143 dead transitions. [2024-11-13 15:50:01,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 143 transitions, 747 flow [2024-11-13 15:50:01,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:50:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 15:50:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2024-11-13 15:50:01,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-11-13 15:50:01,949 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 177 flow. Second operand 7 states and 224 transitions. [2024-11-13 15:50:01,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 143 transitions, 747 flow [2024-11-13 15:50:01,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 143 transitions, 742 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-13 15:50:01,958 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 258 flow [2024-11-13 15:50:01,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2024-11-13 15:50:01,960 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2024-11-13 15:50:01,961 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 258 flow [2024-11-13 15:50:01,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:01,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:50:01,961 INFO L204 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] [2024-11-13 15:50:01,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 15:50:02,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:50:02,163 INFO L396 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)] === [2024-11-13 15:50:02,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash -558809159, now seen corresponding path program 2 times [2024-11-13 15:50:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:02,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134152338] [2024-11-13 15:50:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:02,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:50:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:03,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134152338] [2024-11-13 15:50:03,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134152338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:03,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:03,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:50:03,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189868045] [2024-11-13 15:50:03,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:03,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:50:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:03,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:50:03,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:50:03,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-11-13 15:50:03,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:03,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:50:03,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-11-13 15:50:03,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:50:07,058 INFO L124 PetriNetUnfolderBase]: 19309/28024 cut-off events. [2024-11-13 15:50:07,058 INFO L125 PetriNetUnfolderBase]: For 20147/20199 co-relation queries the response was YES. [2024-11-13 15:50:07,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76984 conditions, 28024 events. 19309/28024 cut-off events. For 20147/20199 co-relation queries the response was YES. Maximal size of possible extension queue 1586. Compared 197074 event pairs, 2650 based on Foata normal form. 486/28245 useless extension candidates. Maximal degree in co-relation 63919. Up to 15249 conditions per place. [2024-11-13 15:50:07,258 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 158 selfloop transitions, 25 changer transitions 6/200 dead transitions. [2024-11-13 15:50:07,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 200 transitions, 1154 flow [2024-11-13 15:50:07,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:50:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 15:50:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 291 transitions. [2024-11-13 15:50:07,261 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2024-11-13 15:50:07,261 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 258 flow. Second operand 9 states and 291 transitions. [2024-11-13 15:50:07,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 200 transitions, 1154 flow [2024-11-13 15:50:07,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 200 transitions, 1154 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 15:50:07,325 INFO L231 Difference]: Finished difference. Result has 84 places, 89 transitions, 505 flow [2024-11-13 15:50:07,325 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=505, PETRI_PLACES=84, PETRI_TRANSITIONS=89} [2024-11-13 15:50:07,326 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2024-11-13 15:50:07,326 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 89 transitions, 505 flow [2024-11-13 15:50:07,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:07,326 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:50:07,326 INFO L204 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] [2024-11-13 15:50:07,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:50:07,327 INFO L396 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)] === [2024-11-13 15:50:07,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1775999330, now seen corresponding path program 1 times [2024-11-13 15:50:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:07,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814801797] [2024-11-13 15:50:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:07,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:50:07,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:07,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814801797] [2024-11-13 15:50:07,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814801797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:07,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:07,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:50:07,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444583564] [2024-11-13 15:50:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:07,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:50:07,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:07,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:50:07,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:50:07,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-11-13 15:50:07,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 89 transitions, 505 flow. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:07,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:50:07,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-11-13 15:50:07,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:50:11,984 INFO L124 PetriNetUnfolderBase]: 17597/25692 cut-off events. [2024-11-13 15:50:11,984 INFO L125 PetriNetUnfolderBase]: For 39735/39751 co-relation queries the response was YES. [2024-11-13 15:50:12,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84526 conditions, 25692 events. 17597/25692 cut-off events. For 39735/39751 co-relation queries the response was YES. Maximal size of possible extension queue 1477. Compared 182861 event pairs, 1633 based on Foata normal form. 72/25589 useless extension candidates. Maximal degree in co-relation 70074. Up to 17529 conditions per place. [2024-11-13 15:50:12,182 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 104 selfloop transitions, 19 changer transitions 19/156 dead transitions. [2024-11-13 15:50:12,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 156 transitions, 1064 flow [2024-11-13 15:50:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:50:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 15:50:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2024-11-13 15:50:12,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2024-11-13 15:50:12,185 INFO L175 Difference]: Start difference. First operand has 84 places, 89 transitions, 505 flow. Second operand 6 states and 196 transitions. [2024-11-13 15:50:12,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 156 transitions, 1064 flow [2024-11-13 15:50:12,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 156 transitions, 1064 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 15:50:12,638 INFO L231 Difference]: Finished difference. Result has 92 places, 92 transitions, 587 flow [2024-11-13 15:50:12,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=587, PETRI_PLACES=92, PETRI_TRANSITIONS=92} [2024-11-13 15:50:12,640 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 40 predicate places. [2024-11-13 15:50:12,640 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 92 transitions, 587 flow [2024-11-13 15:50:12,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:12,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:50:12,641 INFO L204 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] [2024-11-13 15:50:12,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:50:12,641 INFO L396 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)] === [2024-11-13 15:50:12,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:12,642 INFO L85 PathProgramCache]: Analyzing trace with hash -447363258, now seen corresponding path program 2 times [2024-11-13 15:50:12,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:12,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540426178] [2024-11-13 15:50:12,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:12,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:50:13,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:13,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540426178] [2024-11-13 15:50:13,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540426178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:13,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:13,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:50:13,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758160671] [2024-11-13 15:50:13,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:13,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:50:13,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:13,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:50:13,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:50:13,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-11-13 15:50:13,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 92 transitions, 587 flow. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:13,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:50:13,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-11-13 15:50:13,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:50:19,936 INFO L124 PetriNetUnfolderBase]: 24898/37959 cut-off events. [2024-11-13 15:50:19,936 INFO L125 PetriNetUnfolderBase]: For 76835/77447 co-relation queries the response was YES. [2024-11-13 15:50:20,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126502 conditions, 37959 events. 24898/37959 cut-off events. For 76835/77447 co-relation queries the response was YES. Maximal size of possible extension queue 1897. Compared 295181 event pairs, 3980 based on Foata normal form. 611/37856 useless extension candidates. Maximal degree in co-relation 105394. Up to 23978 conditions per place. [2024-11-13 15:50:20,221 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 136 selfloop transitions, 62 changer transitions 43/260 dead transitions. [2024-11-13 15:50:20,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 260 transitions, 2260 flow [2024-11-13 15:50:20,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:50:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 15:50:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 286 transitions. [2024-11-13 15:50:20,224 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6355555555555555 [2024-11-13 15:50:20,224 INFO L175 Difference]: Start difference. First operand has 92 places, 92 transitions, 587 flow. Second operand 9 states and 286 transitions. [2024-11-13 15:50:20,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 260 transitions, 2260 flow [2024-11-13 15:50:20,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 260 transitions, 2186 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-13 15:50:20,585 INFO L231 Difference]: Finished difference. Result has 104 places, 148 transitions, 1371 flow [2024-11-13 15:50:20,586 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1371, PETRI_PLACES=104, PETRI_TRANSITIONS=148} [2024-11-13 15:50:20,587 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 52 predicate places. [2024-11-13 15:50:20,587 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 148 transitions, 1371 flow [2024-11-13 15:50:20,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:20,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:50:20,588 INFO L204 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] [2024-11-13 15:50:20,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:50:20,588 INFO L396 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)] === [2024-11-13 15:50:20,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:20,589 INFO L85 PathProgramCache]: Analyzing trace with hash 677883164, now seen corresponding path program 3 times [2024-11-13 15:50:20,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:20,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842030549] [2024-11-13 15:50:20,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:20,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:50:21,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:21,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842030549] [2024-11-13 15:50:21,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842030549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:21,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:21,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:50:21,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370126973] [2024-11-13 15:50:21,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:21,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:50:21,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:21,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:50:21,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:50:21,471 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-11-13 15:50:21,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 148 transitions, 1371 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:21,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:50:21,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-11-13 15:50:21,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:50:26,473 INFO L124 PetriNetUnfolderBase]: 25672/37093 cut-off events. [2024-11-13 15:50:26,474 INFO L125 PetriNetUnfolderBase]: For 109817/111011 co-relation queries the response was YES. [2024-11-13 15:50:26,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143348 conditions, 37093 events. 25672/37093 cut-off events. For 109817/111011 co-relation queries the response was YES. Maximal size of possible extension queue 1937. Compared 262757 event pairs, 4443 based on Foata normal form. 1318/38232 useless extension candidates. Maximal degree in co-relation 120345. Up to 27069 conditions per place. [2024-11-13 15:50:26,964 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 146 selfloop transitions, 73 changer transitions 7/239 dead transitions. [2024-11-13 15:50:26,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 239 transitions, 2275 flow [2024-11-13 15:50:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:50:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 15:50:26,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions. [2024-11-13 15:50:26,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.66 [2024-11-13 15:50:26,966 INFO L175 Difference]: Start difference. First operand has 104 places, 148 transitions, 1371 flow. Second operand 7 states and 231 transitions. [2024-11-13 15:50:26,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 239 transitions, 2275 flow [2024-11-13 15:50:27,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 239 transitions, 2257 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-11-13 15:50:27,982 INFO L231 Difference]: Finished difference. Result has 110 places, 157 transitions, 1695 flow [2024-11-13 15:50:27,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1695, PETRI_PLACES=110, PETRI_TRANSITIONS=157} [2024-11-13 15:50:27,983 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2024-11-13 15:50:27,984 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 157 transitions, 1695 flow [2024-11-13 15:50:27,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:27,984 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:50:27,984 INFO L204 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] [2024-11-13 15:50:27,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:50:27,985 INFO L396 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)] === [2024-11-13 15:50:27,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash -868461048, now seen corresponding path program 4 times [2024-11-13 15:50:27,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:27,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151465066] [2024-11-13 15:50:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:50:28,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:28,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151465066] [2024-11-13 15:50:28,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151465066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:28,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:28,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:50:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950356811] [2024-11-13 15:50:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:28,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:50:28,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:28,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:50:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:50:28,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-11-13 15:50:28,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 157 transitions, 1695 flow. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:28,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:50:28,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-11-13 15:50:28,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:50:34,737 INFO L124 PetriNetUnfolderBase]: 26247/37870 cut-off events. [2024-11-13 15:50:34,738 INFO L125 PetriNetUnfolderBase]: For 126326/127448 co-relation queries the response was YES. [2024-11-13 15:50:34,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150782 conditions, 37870 events. 26247/37870 cut-off events. For 126326/127448 co-relation queries the response was YES. Maximal size of possible extension queue 1967. Compared 266505 event pairs, 4546 based on Foata normal form. 1316/38932 useless extension candidates. Maximal degree in co-relation 129108. Up to 26502 conditions per place. [2024-11-13 15:50:35,048 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 154 selfloop transitions, 77 changer transitions 8/252 dead transitions. [2024-11-13 15:50:35,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 252 transitions, 2599 flow [2024-11-13 15:50:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:50:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 15:50:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 257 transitions. [2024-11-13 15:50:35,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6425 [2024-11-13 15:50:35,050 INFO L175 Difference]: Start difference. First operand has 110 places, 157 transitions, 1695 flow. Second operand 8 states and 257 transitions. [2024-11-13 15:50:35,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 252 transitions, 2599 flow [2024-11-13 15:50:36,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 252 transitions, 2525 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-13 15:50:36,406 INFO L231 Difference]: Finished difference. Result has 116 places, 161 transitions, 1889 flow [2024-11-13 15:50:36,407 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1889, PETRI_PLACES=116, PETRI_TRANSITIONS=161} [2024-11-13 15:50:36,407 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 64 predicate places. [2024-11-13 15:50:36,407 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 161 transitions, 1889 flow [2024-11-13 15:50:36,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:36,408 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:50:36,408 INFO L204 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] [2024-11-13 15:50:36,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:50:36,408 INFO L396 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)] === [2024-11-13 15:50:36,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:36,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1394690224, now seen corresponding path program 5 times [2024-11-13 15:50:36,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:36,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620214962] [2024-11-13 15:50:36,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:36,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:50:36,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:36,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620214962] [2024-11-13 15:50:36,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620214962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:50:36,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867777311] [2024-11-13 15:50:36,832 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 15:50:36,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:50:36,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:50:36,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:50:36,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:50:37,010 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-13 15:50:37,011 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:50:37,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 15:50:37,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:50:37,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:50:37,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:50:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:50:37,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867777311] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:50:37,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:50:37,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-13 15:50:37,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561780857] [2024-11-13 15:50:37,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:50:37,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:50:37,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:37,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:50:37,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:50:37,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2024-11-13 15:50:37,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 161 transitions, 1889 flow. Second operand has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:37,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:50:37,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2024-11-13 15:50:37,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:50:49,836 INFO L124 PetriNetUnfolderBase]: 48009/69228 cut-off events. [2024-11-13 15:50:49,836 INFO L125 PetriNetUnfolderBase]: For 265234/268492 co-relation queries the response was YES. [2024-11-13 15:50:50,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268993 conditions, 69228 events. 48009/69228 cut-off events. For 265234/268492 co-relation queries the response was YES. Maximal size of possible extension queue 2873. Compared 509205 event pairs, 2796 based on Foata normal form. 2510/68535 useless extension candidates. Maximal degree in co-relation 228791. Up to 11043 conditions per place. [2024-11-13 15:50:50,447 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 433 selfloop transitions, 194 changer transitions 5/656 dead transitions. [2024-11-13 15:50:50,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 656 transitions, 8199 flow [2024-11-13 15:50:50,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 15:50:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-13 15:50:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 529 transitions. [2024-11-13 15:50:50,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5568421052631579 [2024-11-13 15:50:50,451 INFO L175 Difference]: Start difference. First operand has 116 places, 161 transitions, 1889 flow. Second operand 19 states and 529 transitions. [2024-11-13 15:50:50,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 656 transitions, 8199 flow [2024-11-13 15:50:53,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 656 transitions, 8070 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-11-13 15:50:53,519 INFO L231 Difference]: Finished difference. Result has 139 places, 301 transitions, 4001 flow [2024-11-13 15:50:53,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4001, PETRI_PLACES=139, PETRI_TRANSITIONS=301} [2024-11-13 15:50:53,520 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 87 predicate places. [2024-11-13 15:50:53,520 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 301 transitions, 4001 flow [2024-11-13 15:50:53,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.307692307692307) internal successors, (238), 13 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:53,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 15:50:53,524 INFO L204 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] [2024-11-13 15:50:53,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:50:53,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b93f4c08-72ec-4b69-9b09-9d248b5d8f5b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:50:53,728 INFO L396 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)] === [2024-11-13 15:50:53,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:53,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1098492262, now seen corresponding path program 6 times [2024-11-13 15:50:53,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:53,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079225764] [2024-11-13 15:50:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:53,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:50:54,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:54,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079225764] [2024-11-13 15:50:54,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079225764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:54,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:54,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:50:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519338442] [2024-11-13 15:50:54,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:54,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:50:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:54,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:50:54,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:50:54,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-11-13 15:50:54,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 301 transitions, 4001 flow. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:50:54,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 15:50:54,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-11-13 15:50:54,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 15:50:57,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][273], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 66#(<= ~q1_back~0 ~q1_front~0), 84#true, Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 15#L119true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 22#$Ultimate##0true, 19#L146true, 75#(<= ~n1~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:50:57,219 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-11-13 15:50:57,219 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-13 15:50:57,219 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-13 15:50:57,219 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-13 15:50:57,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][274], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 84#true, 66#(<= ~q1_back~0 ~q1_front~0), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 15#L119true, 21#L145-4true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 14#L101true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 75#(<= ~n1~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:50:57,787 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-13 15:50:57,787 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:50:57,787 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:50:57,787 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:50:57,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][273], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 66#(<= ~q1_back~0 ~q1_front~0), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#true, Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 22#$Ultimate##0true, 19#L146true, 75#(<= ~n1~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:50:57,792 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-13 15:50:57,792 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:50:57,792 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:50:57,792 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:50:58,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][273], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 66#(<= ~q1_back~0 ~q1_front~0), 84#true, Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 15#L119true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 75#(<= ~n1~0 0), Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 22#$Ultimate##0true, 19#L146true, Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:50:58,180 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-13 15:50:58,180 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:50:58,180 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:50:58,180 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 15:50:59,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][274], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 84#true, 66#(<= ~q1_back~0 ~q1_front~0), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 15#L119true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 14#L101true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 19#L146true, 75#(<= ~n1~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:50:59,077 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,078 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,078 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,078 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][331], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 66#(<= ~q1_back~0 ~q1_front~0), 84#true, Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 15#L119true, 21#L145-4true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, 50#thread3EXITtrue, Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 75#(<= ~n1~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:50:59,080 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,080 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,080 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,080 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][274], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 84#true, 66#(<= ~q1_back~0 ~q1_front~0), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 21#L145-4true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 14#L101true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 75#(<= ~n1~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:50:59,082 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,082 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,082 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,082 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][274], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 84#true, 66#(<= ~q1_back~0 ~q1_front~0), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 15#L119true, 21#L145-4true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 14#L101true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 75#(<= ~n1~0 0), Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:50:59,755 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,756 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,756 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,756 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][273], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#true, 66#(<= ~q1_back~0 ~q1_front~0), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 33#L80true, 247#true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 75#(<= ~n1~0 0), Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 22#$Ultimate##0true, 19#L146true, Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:50:59,775 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,775 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,776 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:50:59,776 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 15:51:00,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][331], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 84#true, 66#(<= ~q1_back~0 ~q1_front~0), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 15#L119true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, 50#thread3EXITtrue, Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 19#L146true, 75#(<= ~n1~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:00,461 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,462 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,462 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,462 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][274], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 66#(<= ~q1_back~0 ~q1_front~0), 84#true, Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 14#L101true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 19#L146true, 75#(<= ~n1~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:00,464 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,464 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,464 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,464 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][389], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 66#(<= ~q1_back~0 ~q1_front~0), 84#true, Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 14#L101true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), 453#(< 0 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 33#L80true, 247#true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 19#L146true, 75#(<= ~n1~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:00,466 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,467 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,467 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,467 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][331], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 66#(<= ~q1_back~0 ~q1_front~0), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#true, Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 21#L145-4true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 33#L80true, 247#true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, 50#thread3EXITtrue, Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 75#(<= ~n1~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:00,468 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,468 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,468 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:00,469 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:01,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][274], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 84#true, 66#(<= ~q1_back~0 ~q1_front~0), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 15#L119true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 14#L101true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 75#(<= ~n1~0 0), Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 19#L146true, Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:01,495 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-13 15:51:01,495 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:01,495 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:01,495 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:01,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][331], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 66#(<= ~q1_back~0 ~q1_front~0), 84#true, Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 15#L119true, 21#L145-4true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 33#L80true, 247#true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, 50#thread3EXITtrue, Black: 75#(<= ~n1~0 0), Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:01,497 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-13 15:51:01,497 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:01,497 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:01,497 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:01,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][274], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 84#true, 66#(<= ~q1_back~0 ~q1_front~0), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 21#L145-4true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 14#L101true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 75#(<= ~n1~0 0), Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:01,499 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-13 15:51:01,499 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:01,499 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:01,499 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 15:51:02,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][331], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 66#(<= ~q1_back~0 ~q1_front~0), 84#true, Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, 50#thread3EXITtrue, Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 19#L146true, 75#(<= ~n1~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:02,009 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-13 15:51:02,009 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:02,009 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:02,010 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:02,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][450], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 66#(<= ~q1_back~0 ~q1_front~0), 84#true, Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), 453#(< 0 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, 50#thread3EXITtrue, Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 19#L146true, 75#(<= ~n1~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:02,010 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-13 15:51:02,010 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:02,010 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:02,010 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][331], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 66#(<= ~q1_back~0 ~q1_front~0), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#true, Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 15#L119true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, 50#thread3EXITtrue, Black: 75#(<= ~n1~0 0), Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 19#L146true, Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:03,183 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,183 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,183 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,183 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][274], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 84#true, 66#(<= ~q1_back~0 ~q1_front~0), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 14#L101true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 75#(<= ~n1~0 0), Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 19#L146true, Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:03,185 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,185 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,185 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,185 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][389], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 66#(<= ~q1_back~0 ~q1_front~0), 84#true, Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 14#L101true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), 453#(< 0 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 33#L80true, 247#true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, Black: 75#(<= ~n1~0 0), Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 19#L146true, Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:03,187 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,187 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,187 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,187 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][331], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 66#(<= ~q1_back~0 ~q1_front~0), 84#true, Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), 21#L145-4true, Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 33#L80true, 247#true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, 50#thread3EXITtrue, Black: 75#(<= ~n1~0 0), Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:03,188 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,188 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,188 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:03,188 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 15:51:05,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][331], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), 66#(<= ~q1_back~0 ~q1_front~0), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#true, Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 247#true, 33#L80true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, 50#thread3EXITtrue, Black: 75#(<= ~n1~0 0), Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 19#L146true, Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:05,321 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-13 15:51:05,321 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 15:51:05,321 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 15:51:05,321 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 15:51:05,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork2_#t~post6#1=|v_thread2Thread1of1ForFork2_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork2_#t~post6#1][450], [Black: 255#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 250#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (or (< 0 |thread3Thread1of1ForFork3_~cond~2#1|) (and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)))), Black: 257#(and (<= (div |thread3Thread1of1ForFork3_~cond~2#1| 256) 0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 249#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 66#(<= ~q1_back~0 ~q1_front~0), 84#true, Black: 252#(and (= ~j~0 0) (<= ~N~0 0)), Black: 276#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (< 0 ~N~0))), Black: 272#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), 577#true, 62#(= ~total~0 0), Black: 297#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 299#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 291#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (= ~j~0 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 560#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)))), Black: 551#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 303#true, Black: 535#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 544#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 389#(= 1 |thread4Thread1of1ForFork1_~cond~3#1|), Black: 539#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), Black: 549#(and (= 1 |thread4Thread1of1ForFork1_~cond~3#1|) (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~q2_back~0)), 453#(< 0 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256)), Black: 305#(or (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 ~j~0)) (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1))), 33#L80true, 247#true, Black: 70#(<= ~q2_back~0 ~q2_front~0), 210#true, 50#thread3EXITtrue, Black: 75#(<= ~n1~0 0), Black: 111#(and (<= 0 ~i~0) (<= ~j~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0)))), Black: 74#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 131#(and (<= 0 ~i~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 92#(and (<= 0 ~i~0) (<= ~j~0 0)), Black: 202#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 204#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~i~0) (<= ~j~0 0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 80#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 81#(<= ~n2~0 0), 19#L146true, Black: 225#(and (= ~j~0 0) (<= 1 ~N~0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 221#(and (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 215#(and (= ~j~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), 37#L112true, Black: 219#(and (or (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))) (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (or (< |thread1Thread1of1ForFork0_~cond~0#1| 1) (< 0 ~N~0)) (= ~i~0 0)), Black: 223#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~j~0 0) (= ~i~0 0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 217#(and (or (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork2_~cond~1#1| 0) (<= ~N~0 0))) (= ~j~0 0) (= ~i~0 0)), Black: 212#(and (= ~j~0 0) (= ~i~0 0)), 17#L52true, Black: 236#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 ~N~0)) (and (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0)))), Black: 241#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork0_~cond~0#1| 0) (<= ~N~0 0))]) [2024-11-13 15:51:05,322 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-13 15:51:05,322 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 15:51:05,322 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 15:51:05,322 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event