Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446300080.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S02J04T06, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446300080
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1716903266642

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
StateSpace COL
Running Version 202405141337
[2024-05-28 13:34:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 13:34:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 13:34:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 13:34:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 13:34:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 630 ms
[2024-05-28 13:34:28] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 23 ms.
[2024-05-28 13:34:28] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 35 ms.
[2024-05-28 13:34:28] [INFO ] Unfolded 0 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 476/476 places, 824/824 transitions.
Running 822 sub problems to find dead transitions.
[2024-05-28 13:34:28] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-05-28 13:34:28] [INFO ] Computed 46 invariants in 56 ms
[2024-05-28 13:34:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:34:36] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 16 ms to minimize.
[2024-05-28 13:34:36] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-05-28 13:34:36] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-28 13:34:36] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-28 13:34:36] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-05-28 13:34:36] [INFO ] Deduced a trap composed of 249 places in 201 ms of which 3 ms to minimize.
[2024-05-28 13:34:37] [INFO ] Deduced a trap composed of 125 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:34:37] [INFO ] Deduced a trap composed of 153 places in 180 ms of which 3 ms to minimize.
[2024-05-28 13:34:37] [INFO ] Deduced a trap composed of 66 places in 40 ms of which 1 ms to minimize.
[2024-05-28 13:34:40] [INFO ] Deduced a trap composed of 273 places in 2492 ms of which 3 ms to minimize.
[2024-05-28 13:34:40] [INFO ] Deduced a trap composed of 271 places in 195 ms of which 3 ms to minimize.
[2024-05-28 13:34:40] [INFO ] Deduced a trap composed of 283 places in 224 ms of which 3 ms to minimize.
[2024-05-28 13:34:40] [INFO ] Deduced a trap composed of 283 places in 196 ms of which 2 ms to minimize.
[2024-05-28 13:34:41] [INFO ] Deduced a trap composed of 248 places in 227 ms of which 3 ms to minimize.
[2024-05-28 13:34:46] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 4 ms to minimize.
[2024-05-28 13:34:46] [INFO ] Deduced a trap composed of 223 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:34:46] [INFO ] Deduced a trap composed of 252 places in 292 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 59 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:34:54] [INFO ] Deduced a trap composed of 309 places in 172 ms of which 3 ms to minimize.
[2024-05-28 13:34:55] [INFO ] Deduced a trap composed of 314 places in 168 ms of which 3 ms to minimize.
[2024-05-28 13:34:55] [INFO ] Deduced a trap composed of 328 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:34:55] [INFO ] Deduced a trap composed of 317 places in 210 ms of which 3 ms to minimize.
[2024-05-28 13:34:56] [INFO ] Deduced a trap composed of 311 places in 211 ms of which 16 ms to minimize.
[2024-05-28 13:34:57] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 3 ms to minimize.
[2024-05-28 13:34:57] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-05-28 13:34:59] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 3 ms to minimize.
[2024-05-28 13:34:59] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 2 ms to minimize.
[2024-05-28 13:35:00] [INFO ] Deduced a trap composed of 254 places in 159 ms of which 2 ms to minimize.
[2024-05-28 13:35:00] [INFO ] Deduced a trap composed of 249 places in 161 ms of which 2 ms to minimize.
[2024-05-28 13:35:00] [INFO ] Deduced a trap composed of 242 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:35:01] [INFO ] Deduced a trap composed of 243 places in 188 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:35:07] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 73 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 31/31 constraints]
After SMT, in 41084ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41123ms
[2024-05-28 13:35:10] [INFO ] Redundant transitions in 58 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-28 13:35:10] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 13:35:10] [INFO ] Invariant cache hit.
[2024-05-28 13:35:10] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-28 13:35:15] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-28 13:35:16] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 3 ms to minimize.
[2024-05-28 13:35:16] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2024-05-28 13:35:16] [INFO ] Deduced a trap composed of 217 places in 173 ms of which 3 ms to minimize.
[2024-05-28 13:35:16] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 3 ms to minimize.
[2024-05-28 13:35:17] [INFO ] Deduced a trap composed of 255 places in 185 ms of which 2 ms to minimize.
[2024-05-28 13:35:17] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 4 ms to minimize.
[2024-05-28 13:35:17] [INFO ] Deduced a trap composed of 279 places in 169 ms of which 2 ms to minimize.
[2024-05-28 13:35:17] [INFO ] Deduced a trap composed of 232 places in 164 ms of which 2 ms to minimize.
[2024-05-28 13:35:17] [INFO ] Deduced a trap composed of 280 places in 163 ms of which 2 ms to minimize.
[2024-05-28 13:35:18] [INFO ] Deduced a trap composed of 265 places in 166 ms of which 3 ms to minimize.
[2024-05-28 13:35:18] [INFO ] Deduced a trap composed of 254 places in 163 ms of which 3 ms to minimize.
[2024-05-28 13:35:18] [INFO ] Deduced a trap composed of 244 places in 165 ms of which 2 ms to minimize.
[2024-05-28 13:35:18] [INFO ] Deduced a trap composed of 65 places in 30 ms of which 1 ms to minimize.
[2024-05-28 13:35:23] [INFO ] Deduced a trap composed of 58 places in 223 ms of which 3 ms to minimize.
[2024-05-28 13:35:23] [INFO ] Deduced a trap composed of 264 places in 181 ms of which 2 ms to minimize.
[2024-05-28 13:35:23] [INFO ] Deduced a trap composed of 321 places in 189 ms of which 3 ms to minimize.
[2024-05-28 13:35:23] [INFO ] Deduced a trap composed of 266 places in 226 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:35:24] [INFO ] Deduced a trap composed of 250 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:35:26] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-28 13:35:29] [INFO ] Deduced a trap composed of 240 places in 204 ms of which 3 ms to minimize.
[2024-05-28 13:35:29] [INFO ] Deduced a trap composed of 226 places in 155 ms of which 2 ms to minimize.
[2024-05-28 13:35:29] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:35:36] [INFO ] Deduced a trap composed of 271 places in 171 ms of which 3 ms to minimize.
[2024-05-28 13:35:40] [INFO ] Deduced a trap composed of 231 places in 212 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 69 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 27/69 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:35:44] [INFO ] Deduced a trap composed of 254 places in 226 ms of which 3 ms to minimize.
[2024-05-28 13:35:47] [INFO ] Deduced a trap composed of 243 places in 225 ms of which 3 ms to minimize.
[2024-05-28 13:35:49] [INFO ] Deduced a trap composed of 299 places in 221 ms of which 3 ms to minimize.
[2024-05-28 13:35:49] [INFO ] Deduced a trap composed of 278 places in 185 ms of which 3 ms to minimize.
[2024-05-28 13:35:49] [INFO ] Deduced a trap composed of 320 places in 183 ms of which 3 ms to minimize.
[2024-05-28 13:35:50] [INFO ] Deduced a trap composed of 280 places in 218 ms of which 3 ms to minimize.
[2024-05-28 13:35:50] [INFO ] Deduced a trap composed of 275 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-28 13:35:55] [INFO ] Deduced a trap composed of 300 places in 205 ms of which 4 ms to minimize.
[2024-05-28 13:36:00] [INFO ] Deduced a trap composed of 283 places in 237 ms of which 3 ms to minimize.
[2024-05-28 13:36:00] [INFO ] Deduced a trap composed of 283 places in 217 ms of which 4 ms to minimize.
[2024-05-28 13:36:01] [INFO ] Deduced a trap composed of 254 places in 199 ms of which 3 ms to minimize.
[2024-05-28 13:36:01] [INFO ] Deduced a trap composed of 282 places in 223 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 81 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 39/39 constraints]
After SMT, in 60925ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60940ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 102194 ms. Remains : 476/476 places, 824/824 transitions.
Final net has 476 places and 824 transitions.
[2024-05-28 13:36:11] [INFO ] Flatten gal took : 115 ms
[2024-05-28 13:36:11] [INFO ] Applying decomposition
[2024-05-28 13:36:11] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8859307380291990256.txt' '-o' '/tmp/graph8859307380291990256.bin' '-w' '/tmp/graph8859307380291990256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8859307380291990256.bin' '-l' '-1' '-v' '-w' '/tmp/graph8859307380291990256.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:36:11] [INFO ] Decomposing Gal with order
[2024-05-28 13:36:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:36:11] [INFO ] Removed a total of 525 redundant transitions.
[2024-05-28 13:36:11] [INFO ] Flatten gal took : 147 ms
[2024-05-28 13:36:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 212 labels/synchronizations in 29 ms.
[2024-05-28 13:36:11] [INFO ] Time to serialize gal into /tmp/StateSpace3675647242355493381.gal : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace3675647242355493381.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
Detected timeout of ITS tools.
[2024-05-28 13:56:46] [INFO ] Applying decomposition
[2024-05-28 13:56:46] [INFO ] Flatten gal took : 94 ms
[2024-05-28 13:56:46] [INFO ] Decomposing Gal with order
[2024-05-28 13:56:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:56:46] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, Idle_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, Try_Check_Sources_E_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, Idle_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, Try_Check_Sources_E_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, Idle_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, Try_Check_Sources_E_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, Idle_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, Try_Check_Sources_E_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, Idle_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, Try_Check_Sources_E_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, Idle_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, Try_Check_Sources_E_5, P_1617_5, ScheduleTaskE_Idle_5],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:519)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 13:56:46] [INFO ] Flatten gal took : 47 ms
[2024-05-28 13:56:46] [INFO ] Time to serialize gal into /tmp/StateSpace16281354804894448805.gal : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace16281354804894448805.gal' '-t' 'CGAL' '--stats' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...241
ITS-tools command line returned an error code 137
[2024-05-28 14:11:57] [INFO ] Flatten gal took : 70 ms
[2024-05-28 14:11:57] [INFO ] Input system was already deterministic with 824 transitions.
[2024-05-28 14:11:57] [INFO ] Transformed 476 places.
[2024-05-28 14:11:57] [INFO ] Transformed 824 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 14:12:27] [INFO ] Time to serialize gal into /tmp/StateSpace3407605279153452414.gal : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace3407605279153452414.gal' '-t' 'CGAL' '--stats' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Successfully loaded order from file /home/mcc/execution/model.ord
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri,1.40755e+08,661.476,10193316,2,559897,5,1.27254e+07,6,0,2800,1.23386e+07,0
Total reachable state count : 140754672

Max variable value : 10
STATE_SPACE MAX_TOKEN_IN_PLACE 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Maximum sum along a path : 63
STATE_SPACE MAX_TOKEN_PER_MARKING 63 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exact state count : 140754672
STATE_SPACE STATES 140754672 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2945998 ms.

BK_STOP 1716906214020

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T06"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J04T06, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446300080"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T06.tgz
mv PolyORBLF-COL-S02J04T06 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;