About the Execution of GreatSPN+red for PolyORBLF-PT-S04J06T10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16124.220 | 3600000.00 | 12562509.00 | 345.90 | FTTFTFFFF???T?T? | 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-171654445600307.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-S04J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 21K Apr 11 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 69K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 339K Apr 11 16:56 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 14K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 11 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 256K Apr 11 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 11 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 540K Apr 11 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K 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 4.3M 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-S04J06T10-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J06T10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716867730431
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-S04J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 03:42:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 03:42:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:42:13] [INFO ] Load time of PNML (sax parser for PT used): 611 ms
[2024-05-28 03:42:13] [INFO ] Transformed 966 places.
[2024-05-28 03:42:13] [INFO ] Transformed 5354 transitions.
[2024-05-28 03:42:13] [INFO ] Parsed PT model containing 966 places and 5354 transitions and 36134 arcs in 888 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
FORMULA PolyORBLF-PT-S04J06T10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 238 out of 966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 966/966 places, 2644/2644 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 963 transition count 2644
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 954 transition count 2635
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 954 transition count 2635
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 945 transition count 2626
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 945 transition count 2626
Applied a total of 39 rules in 480 ms. Remains 945 /966 variables (removed 21) and now considering 2626/2644 (removed 18) transitions.
Running 2622 sub problems to find dead transitions.
[2024-05-28 03:42:14] [INFO ] Flow matrix only has 2586 transitions (discarded 40 similar events)
// Phase 1: matrix 2586 rows 945 cols
[2024-05-28 03:42:14] [INFO ] Computed 59 invariants in 231 ms
[2024-05-28 03:42:14] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2622 unsolved
SMT process timed out in 33523ms, After SMT, problems are : Problem set: 0 solved, 2622 unsolved
Search for dead transitions found 0 dead transitions in 33650ms
[2024-05-28 03:42:48] [INFO ] Flow matrix only has 2586 transitions (discarded 40 similar events)
[2024-05-28 03:42:48] [INFO ] Invariant cache hit.
[2024-05-28 03:42:51] [INFO ] Implicit Places using invariants in 3124 ms returned [103, 226, 278, 341, 467, 521, 555, 661, 714, 827]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 3160 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 935/966 places, 2626/2644 transitions.
Applied a total of 0 rules in 35 ms. Remains 935 /935 variables (removed 0) and now considering 2626/2626 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37444 ms. Remains : 935/966 places, 2626/2644 transitions.
Support contains 238 out of 935 places after structural reductions.
[2024-05-28 03:42:52] [INFO ] Flatten gal took : 370 ms
[2024-05-28 03:42:52] [INFO ] Flatten gal took : 214 ms
[2024-05-28 03:42:52] [INFO ] Input system was already deterministic with 2626 transitions.
RANDOM walk for 40001 steps (8 resets) in 3045 ms. (13 steps per ms) remains 7/25 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 437 ms. (91 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 481 ms. (82 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 352 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 391 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 303 ms. (131 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 348 ms. (114 steps per ms) remains 7/7 properties
[2024-05-28 03:42:54] [INFO ] Flow matrix only has 2586 transitions (discarded 40 similar events)
// Phase 1: matrix 2586 rows 935 cols
[2024-05-28 03:42:54] [INFO ] Computed 49 invariants in 165 ms
[2024-05-28 03:42:54] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 286/328 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 16/344 variables, 5/14 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 5 (OVERLAPS) 572/916 variables, 21/35 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-05-28 03:42:56] [INFO ] Deduced a trap composed of 82 places in 575 ms of which 82 ms to minimize.
[2024-05-28 03:42:56] [INFO ] Deduced a trap composed of 82 places in 597 ms of which 6 ms to minimize.
[2024-05-28 03:42:57] [INFO ] Deduced a trap composed of 82 places in 501 ms of which 13 ms to minimize.
[2024-05-28 03:42:57] [INFO ] Deduced a trap composed of 84 places in 606 ms of which 4 ms to minimize.
[2024-05-28 03:42:58] [INFO ] Deduced a trap composed of 82 places in 238 ms of which 3 ms to minimize.
[2024-05-28 03:42:58] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 2 ms to minimize.
[2024-05-28 03:42:58] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 2 ms to minimize.
[2024-05-28 03:42:58] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 8/43 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 0/43 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/919 variables, 3/46 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/919 variables, 0/46 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 935/3521 variables, and 57 constraints, problems are : Problem set: 7 solved, 0 unsolved in 3715 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/935 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 8/8 constraints]
After SMT, in 3940ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-PT-S04J06T10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S04J06T10-LTLCardinality-03 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' '!((F(p0)&&X((p0||G(p1)||(p1&&F(p0))))))'
Support contains 19 out of 935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 935/935 places, 2626/2626 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 934 transition count 2626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 933 transition count 2625
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 933 transition count 2625
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 932 transition count 2624
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 932 transition count 2624
Applied a total of 5 rules in 134 ms. Remains 932 /935 variables (removed 3) and now considering 2624/2626 (removed 2) transitions.
Running 2620 sub problems to find dead transitions.
[2024-05-28 03:42:59] [INFO ] Flow matrix only has 2584 transitions (discarded 40 similar events)
// Phase 1: matrix 2584 rows 932 cols
[2024-05-28 03:42:59] [INFO ] Computed 48 invariants in 101 ms
[2024-05-28 03:42:59] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/928 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2620 unsolved
SMT process timed out in 35088ms, After SMT, problems are : Problem set: 0 solved, 2620 unsolved
Search for dead transitions found 0 dead transitions in 35163ms
[2024-05-28 03:43:34] [INFO ] Flow matrix only has 2584 transitions (discarded 40 similar events)
[2024-05-28 03:43:34] [INFO ] Invariant cache hit.
[2024-05-28 03:43:35] [INFO ] Implicit Places using invariants in 1063 ms returned []
[2024-05-28 03:43:35] [INFO ] Flow matrix only has 2584 transitions (discarded 40 similar events)
[2024-05-28 03:43:35] [INFO ] Invariant cache hit.
[2024-05-28 03:43:37] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 03:44:08] [INFO ] Performed 449/932 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 03:44:24] [INFO ] Implicit Places using invariants and state equation in 49108 ms returned []
Implicit Place search using SMT with State Equation took 50182 ms to find 0 implicit places.
Running 2620 sub problems to find dead transitions.
[2024-05-28 03:44:24] [INFO ] Flow matrix only has 2584 transitions (discarded 40 similar events)
[2024-05-28 03:44:24] [INFO ] Invariant cache hit.
[2024-05-28 03:44:24] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/928 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2620 unsolved
SMT process timed out in 45841ms, After SMT, problems are : Problem set: 0 solved, 2620 unsolved
Search for dead transitions found 0 dead transitions in 45879ms
Starting structural reductions in LTL mode, iteration 1 : 932/935 places, 2624/2626 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131381 ms. Remains : 932/935 places, 2624/2626 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J06T10-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 314 steps with 9 reset in 9 ms.
FORMULA PolyORBLF-PT-S04J06T10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T10-LTLCardinality-00 finished in 131857 ms.
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' '!(X(G(p0)))'
Support contains 80 out of 935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 935/935 places, 2626/2626 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 934 transition count 2626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 933 transition count 2625
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 933 transition count 2625
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 932 transition count 2624
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 932 transition count 2624
Applied a total of 5 rules in 69 ms. Remains 932 /935 variables (removed 3) and now considering 2624/2626 (removed 2) transitions.
Running 2620 sub problems to find dead transitions.
[2024-05-28 03:45:10] [INFO ] Flow matrix only has 2584 transitions (discarded 40 similar events)
[2024-05-28 03:45:10] [INFO ] Invariant cache hit.
[2024-05-28 03:45:10] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/928 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2620 unsolved
SMT process timed out in 33398ms, After SMT, problems are : Problem set: 0 solved, 2620 unsolved
Search for dead transitions found 0 dead transitions in 33426ms
[2024-05-28 03:45:44] [INFO ] Flow matrix only has 2584 transitions (discarded 40 similar events)
[2024-05-28 03:45:44] [INFO ] Invariant cache hit.
[2024-05-28 03:45:45] [INFO ] Implicit Places using invariants in 1195 ms returned []
[2024-05-28 03:45:45] [INFO ] Flow matrix only has 2584 transitions (discarded 40 similar events)
[2024-05-28 03:45:45] [INFO ] Invariant cache hit.
[2024-05-28 03:45:47] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 03:46:17] [INFO ] Performed 239/932 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 03:46:48] [INFO ] Performed 644/932 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-28 03:47:07] [INFO ] Implicit Places using invariants and state equation in 81950 ms returned []
Implicit Place search using SMT with State Equation took 83153 ms to find 0 implicit places.
Running 2620 sub problems to find dead transitions.
[2024-05-28 03:47:07] [INFO ] Flow matrix only has 2584 transitions (discarded 40 similar events)
[2024-05-28 03:47:07] [INFO ] Invariant cache hit.
[2024-05-28 03:47:07] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/928 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2620 unsolved
SMT process timed out in 44225ms, After SMT, problems are : Problem set: 0 solved, 2620 unsolved
Search for dead transitions found 0 dead transitions in 44247ms
Starting structural reductions in LTL mode, iteration 1 : 932/935 places, 2624/2626 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160908 ms. Remains : 932/935 places, 2624/2626 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T10-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J06T10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T10-LTLCardinality-06 finished in 161057 ms.
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 2 out of 935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 935/935 places, 2626/2626 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 934 transition count 2554
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 862 transition count 2554
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 144 place count 862 transition count 2434
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 384 place count 742 transition count 2434
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 564 place count 652 transition count 2344
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 570 place count 646 transition count 2338
Iterating global reduction 2 with 6 rules applied. Total rules applied 576 place count 646 transition count 2338
Applied a total of 576 rules in 345 ms. Remains 646 /935 variables (removed 289) and now considering 2338/2626 (removed 288) transitions.
Running 2334 sub problems to find dead transitions.
[2024-05-28 03:47:52] [INFO ] Flow matrix only has 2298 transitions (discarded 40 similar events)
// Phase 1: matrix 2298 rows 646 cols
[2024-05-28 03:47:52] [INFO ] Computed 48 invariants in 37 ms
[2024-05-28 03:47:52] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
[2024-05-28 03:48:26] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2944 variables, and 40 constraints, problems are : Problem set: 0 solved, 2334 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/31 constraints, State Equation: 0/646 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2334/2334 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
[2024-05-28 03:48:33] [INFO ] Deduced a trap composed of 53 places in 418 ms of which 3 ms to minimize.
[2024-05-28 03:48:33] [INFO ] Deduced a trap composed of 53 places in 194 ms of which 2 ms to minimize.
[2024-05-28 03:48:33] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 3 ms to minimize.
[2024-05-28 03:48:33] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 1 ms to minimize.
[2024-05-28 03:48:33] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2024-05-28 03:48:33] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 2 ms to minimize.
[2024-05-28 03:48:33] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2944 variables, and 47 constraints, problems are : Problem set: 0 solved, 2334 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/31 constraints, State Equation: 0/646 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2334 constraints, Known Traps: 8/8 constraints]
After SMT, in 54061ms problems are : Problem set: 0 solved, 2334 unsolved
Search for dead transitions found 0 dead transitions in 54081ms
[2024-05-28 03:48:46] [INFO ] Flow matrix only has 2298 transitions (discarded 40 similar events)
[2024-05-28 03:48:46] [INFO ] Invariant cache hit.
[2024-05-28 03:48:47] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-05-28 03:48:47] [INFO ] Flow matrix only has 2298 transitions (discarded 40 similar events)
[2024-05-28 03:48:47] [INFO ] Invariant cache hit.
[2024-05-28 03:48:49] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 03:49:20] [INFO ] Performed 267/646 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 03:49:50] [INFO ] Performed 596/646 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-28 03:49:53] [INFO ] Implicit Places using invariants and state equation in 66075 ms returned []
Implicit Place search using SMT with State Equation took 66981 ms to find 0 implicit places.
[2024-05-28 03:49:53] [INFO ] Redundant transitions in 138 ms returned []
Running 2334 sub problems to find dead transitions.
[2024-05-28 03:49:53] [INFO ] Flow matrix only has 2298 transitions (discarded 40 similar events)
[2024-05-28 03:49:53] [INFO ] Invariant cache hit.
[2024-05-28 03:49:53] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
[2024-05-28 03:50:27] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-05-28 03:50:36] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2944 variables, and 41 constraints, problems are : Problem set: 0 solved, 2334 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/31 constraints, State Equation: 0/646 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2334/2334 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/642 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/2944 variables, and 50 constraints, problems are : Problem set: 0 solved, 2334 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/646 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2334 constraints, Known Traps: 2/2 constraints]
After SMT, in 74319ms problems are : Problem set: 0 solved, 2334 unsolved
Search for dead transitions found 0 dead transitions in 74363ms
Starting structural reductions in SI_LTL mode, iteration 1 : 646/935 places, 2338/2626 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195952 ms. Remains : 646/935 places, 2338/2626 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T10-LTLCardinality-08
Product exploration explored 100000 steps with 3650 reset in 927 ms.
Stuttering criterion allowed to conclude after 41047 steps with 1527 reset in 388 ms.
FORMULA PolyORBLF-PT-S04J06T10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T10-LTLCardinality-08 finished in 197355 ms.
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&&G(p1)&&X(G(p2))) U X(p3)))'
Support contains 8 out of 935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 935/935 places, 2626/2626 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 934 transition count 2626
Applied a total of 1 rules in 26 ms. Remains 934 /935 variables (removed 1) and now considering 2626/2626 (removed 0) transitions.
Running 2622 sub problems to find dead transitions.
[2024-05-28 03:51:09] [INFO ] Flow matrix only has 2586 transitions (discarded 40 similar events)
// Phase 1: matrix 2586 rows 934 cols
[2024-05-28 03:51:09] [INFO ] Computed 48 invariants in 50 ms
[2024-05-28 03:51:09] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2622 unsolved
SMT process timed out in 34215ms, After SMT, problems are : Problem set: 0 solved, 2622 unsolved
Search for dead transitions found 0 dead transitions in 34247ms
[2024-05-28 03:51:43] [INFO ] Flow matrix only has 2586 transitions (discarded 40 similar events)
[2024-05-28 03:51:43] [INFO ] Invariant cache hit.
[2024-05-28 03:51:44] [INFO ] Implicit Places using invariants in 973 ms returned []
[2024-05-28 03:51:44] [INFO ] Flow matrix only has 2586 transitions (discarded 40 similar events)
[2024-05-28 03:51:44] [INFO ] Invariant cache hit.
[2024-05-28 03:51:47] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 03:52:17] [INFO ] Performed 276/934 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 03:52:47] [INFO ] Performed 647/934 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-28 03:53:02] [INFO ] Implicit Places using invariants and state equation in 78014 ms returned []
Implicit Place search using SMT with State Equation took 79006 ms to find 0 implicit places.
Running 2622 sub problems to find dead transitions.
[2024-05-28 03:53:02] [INFO ] Flow matrix only has 2586 transitions (discarded 40 similar events)
[2024-05-28 03:53:02] [INFO ] Invariant cache hit.
[2024-05-28 03:53:02] [INFO ] State equation strengthened by 200 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBLF-PT-S04J06T10
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: 966
TRANSITIONS: 5354
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.210s, Sys 0.024s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.030s, Sys 0.003s]
----------------------------------------------------------------------
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: 765
MODEL NAME: /home/mcc/execution/model
966 places, 5354 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
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 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-S04J06T10"
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-S04J06T10, 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-171654445600307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T10.tgz
mv PolyORBLF-PT-S04J06T10 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 '
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 ;