fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445400196
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-COL-S06J06T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16196.243 3600000.00 13911389.00 287.90 T???F?????F????? normal

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-171654445400196.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-COL-S06J06T04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445400196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 12K Apr 11 17:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 11 17:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 17:22 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 4.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 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)

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-COL-S06J06T04-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716856409647

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:33:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 00:33:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:33:31] [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 00:33:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 00:33:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 668 ms
[2024-05-28 00:33:32] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 00:33:32] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 00:33:32] [INFO ] Skeletonized 15 HLPN properties in 2 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S06J06T04-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 28 to 25
RANDOM walk for 40004 steps (3909 resets) in 1248 ms. (32 steps per ms) remains 15/25 properties
BEST_FIRST walk for 4002 steps (12 resets) in 31 ms. (125 steps per ms) remains 2/15 properties
BEST_FIRST walk for 4000 steps (13 resets) in 108 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000 steps (16 resets) in 56 ms. (70 steps per ms) remains 2/2 properties
[2024-05-28 00:33:32] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 00:33:32] [INFO ] Computed 26 invariants in 8 ms
[2024-05-28 00:33:32] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/51 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 75/145 variables, and 22 constraints, problems are : Problem set: 2 solved, 0 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 13/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2024-05-28 00:33:33] [INFO ] Flatten gal took : 33 ms
[2024-05-28 00:33:33] [INFO ] Flatten gal took : 21 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-28 00:33:33] [INFO ] Unfolded HLPN to a Petri net with 506 places and 7154 transitions 59824 arcs in 286 ms.
[2024-05-28 00:33:33] [INFO ] Unfolded 14 HLPN properties in 13 ms.
[2024-05-28 00:33:33] [INFO ] Reduced 4680 identical enabling conditions.
[2024-05-28 00:33:33] [INFO ] Reduced 4680 identical enabling conditions.
[2024-05-28 00:33:33] [INFO ] Reduced 640 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 265 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 502 transition count 1770
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 502 transition count 1770
Applied a total of 8 rules in 88 ms. Remains 502 /506 variables (removed 4) and now considering 1770/1774 (removed 4) transitions.
Running 1764 sub problems to find dead transitions.
[2024-05-28 00:33:33] [INFO ] Flow matrix only has 1746 transitions (discarded 24 similar events)
// Phase 1: matrix 1746 rows 502 cols
[2024-05-28 00:33:33] [INFO ] Computed 54 invariants in 166 ms
[2024-05-28 00:33:34] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
[2024-05-28 00:34:05] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 17 ms to minimize.
[2024-05-28 00:34:05] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 1 ms to minimize.
[2024-05-28 00:34:05] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 1 ms to minimize.
[2024-05-28 00:34:06] [INFO ] Deduced a trap composed of 281 places in 379 ms of which 4 ms to minimize.
[2024-05-28 00:34:07] [INFO ] Deduced a trap composed of 135 places in 892 ms of which 19 ms to minimize.
[2024-05-28 00:34:07] [INFO ] Deduced a trap composed of 126 places in 292 ms of which 4 ms to minimize.
[2024-05-28 00:34:07] [INFO ] Deduced a trap composed of 103 places in 280 ms of which 3 ms to minimize.
[2024-05-28 00:34:08] [INFO ] Deduced a trap composed of 237 places in 428 ms of which 4 ms to minimize.
[2024-05-28 00:34:10] [INFO ] Deduced a trap composed of 260 places in 466 ms of which 3 ms to minimize.
[2024-05-28 00:34:10] [INFO ] Deduced a trap composed of 258 places in 397 ms of which 3 ms to minimize.
[2024-05-28 00:34:11] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/2248 variables, and 53 constraints, problems are : Problem set: 0 solved, 1764 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/35 constraints, State Equation: 0/502 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1764/1764 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1764 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
[2024-05-28 00:34:21] [INFO ] Deduced a trap composed of 262 places in 342 ms of which 3 ms to minimize.
[2024-05-28 00:34:21] [INFO ] Deduced a trap composed of 254 places in 320 ms of which 3 ms to minimize.
[2024-05-28 00:34:22] [INFO ] Deduced a trap composed of 270 places in 341 ms of which 3 ms to minimize.
[2024-05-28 00:34:24] [INFO ] Deduced a trap composed of 194 places in 226 ms of which 2 ms to minimize.
[2024-05-28 00:34:24] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 2 ms to minimize.
[2024-05-28 00:34:24] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/2248 variables, and 59 constraints, problems are : Problem set: 0 solved, 1764 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/35 constraints, State Equation: 0/502 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1764 constraints, Known Traps: 17/17 constraints]
After SMT, in 58971ms problems are : Problem set: 0 solved, 1764 unsolved
Search for dead transitions found 0 dead transitions in 59033ms
[2024-05-28 00:34:32] [INFO ] Flow matrix only has 1746 transitions (discarded 24 similar events)
[2024-05-28 00:34:32] [INFO ] Invariant cache hit.
[2024-05-28 00:34:33] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-28 00:34:33] [INFO ] Flow matrix only has 1746 transitions (discarded 24 similar events)
[2024-05-28 00:34:33] [INFO ] Invariant cache hit.
[2024-05-28 00:34:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 00:34:39] [INFO ] Implicit Places using invariants and state equation in 6320 ms returned []
Implicit Place search using SMT with State Equation took 6761 ms to find 0 implicit places.
Running 1764 sub problems to find dead transitions.
[2024-05-28 00:34:39] [INFO ] Flow matrix only has 1746 transitions (discarded 24 similar events)
[2024-05-28 00:34:39] [INFO ] Invariant cache hit.
[2024-05-28 00:34:39] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
[2024-05-28 00:35:09] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 2 ms to minimize.
[2024-05-28 00:35:09] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 1 ms to minimize.
[2024-05-28 00:35:09] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:35:09] [INFO ] Deduced a trap composed of 248 places in 395 ms of which 5 ms to minimize.
[2024-05-28 00:35:10] [INFO ] Deduced a trap composed of 78 places in 327 ms of which 4 ms to minimize.
[2024-05-28 00:35:10] [INFO ] Deduced a trap composed of 125 places in 340 ms of which 3 ms to minimize.
[2024-05-28 00:35:11] [INFO ] Deduced a trap composed of 134 places in 387 ms of which 4 ms to minimize.
[2024-05-28 00:35:11] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:35:12] [INFO ] Deduced a trap composed of 261 places in 386 ms of which 4 ms to minimize.
[2024-05-28 00:35:12] [INFO ] Deduced a trap composed of 263 places in 374 ms of which 3 ms to minimize.
[2024-05-28 00:35:13] [INFO ] Deduced a trap composed of 311 places in 405 ms of which 3 ms to minimize.
[2024-05-28 00:35:14] [INFO ] Deduced a trap composed of 282 places in 448 ms of which 4 ms to minimize.
[2024-05-28 00:35:14] [INFO ] Deduced a trap composed of 254 places in 429 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/2248 variables, and 55 constraints, problems are : Problem set: 0 solved, 1764 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/35 constraints, State Equation: 0/502 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1764/1764 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1764 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1764 unsolved
[2024-05-28 00:35:30] [INFO ] Deduced a trap composed of 244 places in 484 ms of which 4 ms to minimize.
[2024-05-28 00:35:36] [INFO ] Deduced a trap composed of 257 places in 326 ms of which 2 ms to minimize.
[2024-05-28 00:35:36] [INFO ] Deduced a trap composed of 262 places in 309 ms of which 3 ms to minimize.
[2024-05-28 00:35:36] [INFO ] Deduced a trap composed of 257 places in 302 ms of which 3 ms to minimize.
[2024-05-28 00:35:36] [INFO ] Deduced a trap composed of 262 places in 292 ms of which 17 ms to minimize.
[2024-05-28 00:35:37] [INFO ] Deduced a trap composed of 232 places in 291 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/2248 variables, and 61 constraints, problems are : Problem set: 0 solved, 1764 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 13/19 constraints, Generalized P Invariants (flows): 29/35 constraints, State Equation: 0/502 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1764 constraints, Known Traps: 19/19 constraints]
After SMT, in 77166ms problems are : Problem set: 0 solved, 1764 unsolved
Search for dead transitions found 0 dead transitions in 77208ms
Starting structural reductions in LTL mode, iteration 1 : 502/506 places, 1770/1774 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143131 ms. Remains : 502/506 places, 1770/1774 transitions.
Support contains 265 out of 502 places after structural reductions.
[2024-05-28 00:35:57] [INFO ] Flatten gal took : 311 ms
[2024-05-28 00:35:57] [INFO ] Flatten gal took : 219 ms
[2024-05-28 00:35:58] [INFO ] Input system was already deterministic with 1770 transitions.
Support contains 257 out of 502 places (down from 265) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40002 steps (154 resets) in 870 ms. (45 steps per ms) remains 2/25 properties
BEST_FIRST walk for 40002 steps (79 resets) in 338 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (63 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
[2024-05-28 00:35:58] [INFO ] Flow matrix only has 1746 transitions (discarded 24 similar events)
[2024-05-28 00:35:58] [INFO ] Invariant cache hit.
[2024-05-28 00:35:58] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/190 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/210 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 5 (OVERLAPS) 271/481 variables, 26/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/488 variables, 4/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 500/2248 variables, and 53 constraints, problems are : Problem set: 2 solved, 0 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/502 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 507ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S06J06T04-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
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' '!((p0 U G(p1)))'
Support contains 33 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 1770/1770 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 496 transition count 1750
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 476 transition count 1750
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 40 place count 476 transition count 1694
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 152 place count 420 transition count 1694
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 10 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 256 place count 368 transition count 1642
Applied a total of 256 rules in 265 ms. Remains 368 /502 variables (removed 134) and now considering 1642/1770 (removed 128) transitions.
Running 1636 sub problems to find dead transitions.
[2024-05-28 00:36:00] [INFO ] Flow matrix only has 1618 transitions (discarded 24 similar events)
// Phase 1: matrix 1618 rows 368 cols
[2024-05-28 00:36:00] [INFO ] Computed 48 invariants in 31 ms
[2024-05-28 00:36:00] [INFO ] State equation strengthened by 112 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S06J06T04

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 81
TRANSITIONS: 65
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 6
COLOR VARS: 25
ARCS: 254
LOADING TIME: 0.322

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 506
TRANSITIONS: 7154
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 59824
UNFOLDING TIME: 0.927

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.294
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.838
OK.
----------------------------------------------------------------------
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: 761
MODEL NAME: /home/mcc/execution/model
506 places, 7154 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
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 LTLFireability -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-COL-S06J06T04"
export BK_EXAMINATION="LTLFireability"
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-COL-S06J06T04, examination is LTLFireability"
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-171654445400196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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