Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r377-smll-171683809600051.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SieveSingleMsgMbox-PT-d1m04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809600051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 19:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716887406432

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:10:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 09:10:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:10:09] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2024-05-28 09:10:09] [INFO ] Transformed 1295 places.
[2024-05-28 09:10:09] [INFO ] Transformed 749 transitions.
[2024-05-28 09:10:09] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 567 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1036 places in 25 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 317 place count 182 transition count 234
Iterating global reduction 1 with 60 rules applied. Total rules applied 377 place count 182 transition count 234
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 382 place count 182 transition count 229
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 426 place count 138 transition count 185
Iterating global reduction 2 with 44 rules applied. Total rules applied 470 place count 138 transition count 185
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 486 place count 138 transition count 169
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 512 place count 112 transition count 142
Iterating global reduction 3 with 26 rules applied. Total rules applied 538 place count 112 transition count 142
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 554 place count 112 transition count 126
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 562 place count 104 transition count 115
Iterating global reduction 4 with 8 rules applied. Total rules applied 570 place count 104 transition count 115
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 578 place count 96 transition count 107
Iterating global reduction 4 with 8 rules applied. Total rules applied 586 place count 96 transition count 107
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 591 place count 91 transition count 101
Iterating global reduction 4 with 5 rules applied. Total rules applied 596 place count 91 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 598 place count 91 transition count 99
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 603 place count 86 transition count 94
Iterating global reduction 5 with 5 rules applied. Total rules applied 608 place count 86 transition count 94
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 611 place count 83 transition count 91
Iterating global reduction 5 with 3 rules applied. Total rules applied 614 place count 83 transition count 91
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 615 place count 82 transition count 89
Iterating global reduction 5 with 1 rules applied. Total rules applied 616 place count 82 transition count 89
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 617 place count 81 transition count 88
Iterating global reduction 5 with 1 rules applied. Total rules applied 618 place count 81 transition count 88
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 619 place count 80 transition count 87
Iterating global reduction 5 with 1 rules applied. Total rules applied 620 place count 80 transition count 87
Applied a total of 620 rules in 272 ms. Remains 80 /259 variables (removed 179) and now considering 87/749 (removed 662) transitions.
// Phase 1: matrix 87 rows 80 cols
[2024-05-28 09:10:10] [INFO ] Computed 5 invariants in 26 ms
[2024-05-28 09:10:10] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-28 09:10:10] [INFO ] Invariant cache hit.
[2024-05-28 09:10:10] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-28 09:10:10] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-28 09:10:10] [INFO ] Invariant cache hit.
[2024-05-28 09:10:10] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-28 09:10:12] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 14 ms to minimize.
[2024-05-28 09:10:12] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-28 09:10:12] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-28 09:10:13] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 3 ms to minimize.
[2024-05-28 09:10:13] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-28 09:10:14] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:10:14] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 8 (OVERLAPS) 87/167 variables, 80/92 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 35/127 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/127 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/167 variables, 0/127 constraints. Problems are: Problem set: 9 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 127 constraints, problems are : Problem set: 9 solved, 77 unsolved in 6006 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 9 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 4/5 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 1/6 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 2/8 constraints. Problems are: Problem set: 9 solved, 77 unsolved
[2024-05-28 09:10:18] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 1/9 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 7/76 variables, 1/10 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 3/13 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 86/162 variables, 76/89 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 34/123 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 9/132 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/132 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 14 (OVERLAPS) 5/167 variables, 4/136 constraints. Problems are: Problem set: 9 solved, 77 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 1/137 constraints. Problems are: Problem set: 9 solved, 77 unsolved
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 68/205 constraints. Problems are: Problem set: 12 solved, 74 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 0/205 constraints. Problems are: Problem set: 12 solved, 74 unsolved
At refinement iteration 18 (OVERLAPS) 0/167 variables, 0/205 constraints. Problems are: Problem set: 12 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 205 constraints, problems are : Problem set: 12 solved, 74 unsolved in 8976 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 77/86 constraints, Known Traps: 8/8 constraints]
After SMT, in 15370ms problems are : Problem set: 12 solved, 74 unsolved
Search for dead transitions found 12 dead transitions in 15428ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 80/259 places, 75/749 transitions.
Reduce places removed 19 places and 11 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 61 transition count 62
Reduce places removed 8 places and 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 29 place count 53 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 52 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 52 transition count 53
Applied a total of 31 rules in 5 ms. Remains 52 /80 variables (removed 28) and now considering 53/75 (removed 22) transitions.
// Phase 1: matrix 53 rows 52 cols
[2024-05-28 09:10:26] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 09:10:26] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 09:10:26] [INFO ] Invariant cache hit.
[2024-05-28 09:10:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-28 09:10:26] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/259 places, 53/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16682 ms. Remains : 52/259 places, 53/749 transitions.
Support contains 3 out of 52 places after structural reductions.
[2024-05-28 09:10:26] [INFO ] Flatten gal took : 39 ms
[2024-05-28 09:10:26] [INFO ] Flatten gal took : 17 ms
[2024-05-28 09:10:26] [INFO ] Input system was already deterministic with 53 transitions.
RANDOM walk for 40000 steps (9000 resets) in 1822 ms. (21 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4145 resets) in 508 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (4076 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4182 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1619 steps, run visited all 3 properties in 24 ms. (steps per millisecond=67 )
Probabilistic random walk after 1619 steps, saw 670 distinct states, run finished after 29 ms. (steps per millisecond=55 ) properties seen :3
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 52 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 53
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 53/53 transitions.
Graph (complete) has 153 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 50 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 50 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 50 transition count 50
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 49 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 49 transition count 49
Applied a total of 7 rules in 28 ms. Remains 49 /52 variables (removed 3) and now considering 49/53 (removed 4) transitions.
// Phase 1: matrix 49 rows 49 cols
[2024-05-28 09:10:27] [INFO ] Computed 3 invariants in 4 ms
[2024-05-28 09:10:28] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-28 09:10:28] [INFO ] Invariant cache hit.
[2024-05-28 09:10:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-28 09:10:28] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-28 09:10:28] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-28 09:10:28] [INFO ] Invariant cache hit.
[2024-05-28 09:10:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-28 09:10:28] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
[2024-05-28 09:10:28] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 49/98 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 74 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1619 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 49/98 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 48/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2334 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 49/49 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints]
After SMT, in 4008ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 4014ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/52 places, 49/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4499 ms. Remains : 49/52 places, 49/53 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m04-LTLCardinality-08
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m04-LTLCardinality-08 finished in 4885 ms.
All properties solved by simple procedures.
Total runtime 23870 ms.
ITS solved all properties within timeout

BK_STOP 1716887432799

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="SieveSingleMsgMbox-PT-d1m04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is SieveSingleMsgMbox-PT-d1m04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r377-smll-171683809600051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m04.tgz
mv SieveSingleMsgMbox-PT-d1m04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;