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.r289-tajo-171654445700315.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 greatspnxred
Input is PolyORBLF-PT-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445700315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.8M 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 PolyORBLF-PT-S06J04T04-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716869903152

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:18:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 04:18:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:18:25] [INFO ] Load time of PNML (sax parser for PT used): 500 ms
[2024-05-28 04:18:25] [INFO ] Transformed 454 places.
[2024-05-28 04:18:25] [INFO ] Transformed 6994 transitions.
[2024-05-28 04:18:25] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 683 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 99 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 445 transition count 1611
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 445 transition count 1611
Applied a total of 12 rules in 110 ms. Remains 445 /454 variables (removed 9) and now considering 1611/1614 (removed 3) transitions.
Running 1605 sub problems to find dead transitions.
[2024-05-28 04:18:25] [INFO ] Flow matrix only has 1587 transitions (discarded 24 similar events)
// Phase 1: matrix 1587 rows 445 cols
[2024-05-28 04:18:26] [INFO ] Computed 44 invariants in 86 ms
[2024-05-28 04:18:26] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
[2024-05-28 04:18:55] [INFO ] Deduced a trap composed of 104 places in 751 ms of which 25 ms to minimize.
[2024-05-28 04:18:56] [INFO ] Deduced a trap composed of 207 places in 366 ms of which 3 ms to minimize.
[2024-05-28 04:18:56] [INFO ] Deduced a trap composed of 11 places in 418 ms of which 3 ms to minimize.
[2024-05-28 04:18:57] [INFO ] Deduced a trap composed of 199 places in 331 ms of which 3 ms to minimize.
[2024-05-28 04:18:57] [INFO ] Deduced a trap composed of 31 places in 427 ms of which 25 ms to minimize.
[2024-05-28 04:18:58] [INFO ] Deduced a trap composed of 203 places in 457 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/2032 variables, and 43 constraints, problems are : Problem set: 0 solved, 1605 unsolved in 20093 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 24/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1605/1605 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1605 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
[2024-05-28 04:19:11] [INFO ] Deduced a trap composed of 186 places in 281 ms of which 3 ms to minimize.
[2024-05-28 04:19:13] [INFO ] Deduced a trap composed of 84 places in 162 ms of which 3 ms to minimize.
[2024-05-28 04:19:13] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 1 ms to minimize.
[2024-05-28 04:19:13] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 1 ms to minimize.
[2024-05-28 04:19:17] [INFO ] Deduced a trap composed of 204 places in 212 ms of which 2 ms to minimize.
[2024-05-28 04:19:19] [INFO ] Deduced a trap composed of 168 places in 303 ms of which 3 ms to minimize.
[2024-05-28 04:19:19] [INFO ] Deduced a trap composed of 80 places in 240 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/2032 variables, and 50 constraints, problems are : Problem set: 0 solved, 1605 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 24/30 constraints, State Equation: 0/445 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1605 constraints, Known Traps: 13/13 constraints]
After SMT, in 57204ms problems are : Problem set: 0 solved, 1605 unsolved
Search for dead transitions found 0 dead transitions in 57257ms
[2024-05-28 04:19:23] [INFO ] Flow matrix only has 1587 transitions (discarded 24 similar events)
[2024-05-28 04:19:23] [INFO ] Invariant cache hit.
[2024-05-28 04:19:23] [INFO ] Implicit Places using invariants in 410 ms returned [42, 285, 345, 405]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 421 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 441/454 places, 1611/1614 transitions.
Applied a total of 0 rules in 16 ms. Remains 441 /441 variables (removed 0) and now considering 1611/1611 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57865 ms. Remains : 441/454 places, 1611/1614 transitions.
Support contains 99 out of 441 places after structural reductions.
[2024-05-28 04:19:24] [INFO ] Flatten gal took : 276 ms
[2024-05-28 04:19:24] [INFO ] Flatten gal took : 122 ms
[2024-05-28 04:19:24] [INFO ] Input system was already deterministic with 1611 transitions.
RANDOM walk for 40000 steps (246 resets) in 2026 ms. (19 steps per ms) remains 13/28 properties
BEST_FIRST walk for 40003 steps (103 resets) in 329 ms. (121 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (155 resets) in 339 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 543 ms. (73 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 362 ms. (110 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (87 resets) in 285 ms. (139 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (112 resets) in 203 ms. (196 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (104 resets) in 233 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (118 resets) in 233 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (74 resets) in 198 ms. (201 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (94 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (90 resets) in 201 ms. (198 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (103 resets) in 225 ms. (177 steps per ms) remains 12/12 properties
[2024-05-28 04:19:26] [INFO ] Flow matrix only has 1587 transitions (discarded 24 similar events)
// Phase 1: matrix 1587 rows 441 cols
[2024-05-28 04:19:26] [INFO ] Computed 40 invariants in 54 ms
[2024-05-28 04:19:26] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (OVERLAPS) 63/112 variables, 9/10 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 58/170 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 10/180 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 8 (OVERLAPS) 254/434 variables, 20/35 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/35 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/435 variables, 1/36 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/36 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 6/441 variables, 4/40 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 0/40 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1587/2028 variables, 441/481 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2028 variables, 112/593 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2028 variables, 0/593 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/2028 variables, 0/593 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2028/2028 variables, and 593 constraints, problems are : Problem set: 8 solved, 4 unsolved in 2019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 441/441 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 58/101 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 58/159 variables, 3/11 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/169 variables, 2/13 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 7 (OVERLAPS) 262/431 variables, 19/32 constraints. Problems are: Problem set: 9 solved, 3 unsolved
[2024-05-28 04:19:29] [INFO ] Deduced a trap composed of 85 places in 249 ms of which 1 ms to minimize.
[2024-05-28 04:19:29] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-28 04:19:29] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 3/35 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/35 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/434 variables, 3/38 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/38 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 7/441 variables, 5/43 constraints. Problems are: Problem set: 9 solved, 3 unsolved
[2024-05-28 04:19:29] [INFO ] Deduced a trap composed of 79 places in 325 ms of which 3 ms to minimize.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Int declared 441/2028 variables, and 44 constraints, problems are : Problem set: 12 solved, 0 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/441 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 4/4 constraints]
After SMT, in 3344ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(G(F(p0)))'
Support contains 8 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 1611/1611 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 441 transition count 1581
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 411 transition count 1581
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 60 place count 411 transition count 1533
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 156 place count 363 transition count 1533
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 362 transition count 1532
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 362 transition count 1532
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 260 place count 311 transition count 1481
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 263 place count 308 transition count 1478
Iterating global reduction 2 with 3 rules applied. Total rules applied 266 place count 308 transition count 1478
Applied a total of 266 rules in 207 ms. Remains 308 /441 variables (removed 133) and now considering 1478/1611 (removed 133) transitions.
Running 1472 sub problems to find dead transitions.
[2024-05-28 04:19:30] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
// Phase 1: matrix 1454 rows 308 cols
[2024-05-28 04:19:30] [INFO ] Computed 40 invariants in 42 ms
[2024-05-28 04:19:30] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 04:19:56] [INFO ] Deduced a trap composed of 18 places in 372 ms of which 2 ms to minimize.
[2024-05-28 04:19:56] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 1 ms to minimize.
[2024-05-28 04:19:58] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2024-05-28 04:20:06] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 1 ms to minimize.
[2024-05-28 04:20:06] [INFO ] Deduced a trap composed of 90 places in 430 ms of which 2 ms to minimize.
[2024-05-28 04:20:07] [INFO ] Deduced a trap composed of 77 places in 284 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1762 variables, and 39 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 17/21 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 04:20:10] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 2 ms to minimize.
[2024-05-28 04:20:11] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 04:20:27] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1762 variables, and 42 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 17/21 constraints, State Equation: 0/308 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 9/9 constraints]
After SMT, in 57792ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 57807ms
[2024-05-28 04:20:28] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 04:20:28] [INFO ] Invariant cache hit.
[2024-05-28 04:20:28] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-28 04:20:28] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 04:20:28] [INFO ] Invariant cache hit.
[2024-05-28 04:20:29] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:20:37] [INFO ] Implicit Places using invariants and state equation in 8613 ms returned []
Implicit Place search using SMT with State Equation took 9110 ms to find 0 implicit places.
[2024-05-28 04:20:37] [INFO ] Redundant transitions in 125 ms returned []
Running 1472 sub problems to find dead transitions.
[2024-05-28 04:20:37] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 04:20:37] [INFO ] Invariant cache hit.
[2024-05-28 04:20:37] [INFO ] State equation strengthened by 112 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J04T04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 454
TRANSITIONS: 6994
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.377s, Sys 0.020s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.048s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 700
MODEL NAME: /home/mcc/execution/model
454 places, 6994 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="PolyORBLF-PT-S06J04T04"
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 PolyORBLF-PT-S06J04T04, 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 r289-tajo-171654445700315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 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 ;