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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 23K Apr 12 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 958K Apr 12 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M 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 PolyORBNT-PT-S10J20-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716889538003

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:45:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 09:45:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:45:44] [INFO ] Load time of PNML (sax parser for PT used): 2247 ms
[2024-05-28 09:45:44] [INFO ] Transformed 474 places.
[2024-05-28 09:45:44] [INFO ] Transformed 11760 transitions.
[2024-05-28 09:45:44] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 2914 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 235 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-05-28 09:45:44] [INFO ] Reduced 780 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 284 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Applied a total of 0 rules in 231 ms. Remains 474 /474 variables (removed 0) and now considering 1650/1650 (removed 0) transitions.
Running 1639 sub problems to find dead transitions.
[2024-05-28 09:45:46] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-05-28 09:45:46] [INFO ] Computed 72 invariants in 284 ms
[2024-05-28 09:45:47] [INFO ] State equation strengthened by 1 read => feed constraints.
SMT process timed out in 42112ms, After SMT, problems are : Problem set: 0 solved, 1639 unsolved
Search for dead transitions found 0 dead transitions in 42311ms
[2024-05-28 09:46:28] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-05-28 09:46:28] [INFO ] Invariant cache hit.
[2024-05-28 09:46:31] [INFO ] Implicit Places using invariants in 2813 ms returned []
[2024-05-28 09:46:31] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-05-28 09:46:31] [INFO ] Invariant cache hit.
[2024-05-28 09:46:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:46:38] [INFO ] Implicit Places using invariants and state equation in 7386 ms returned []
Implicit Place search using SMT with State Equation took 10231 ms to find 0 implicit places.
Running 1639 sub problems to find dead transitions.
[2024-05-28 09:46:39] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-05-28 09:46:39] [INFO ] Invariant cache hit.
[2024-05-28 09:46:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
SMT process timed out in 47245ms, After SMT, problems are : Problem set: 0 solved, 1639 unsolved
Search for dead transitions found 0 dead transitions in 47292ms
Finished structural reductions in LTL mode , in 1 iterations and 100384 ms. Remains : 474/474 places, 1650/1650 transitions.
Support contains 284 out of 474 places after structural reductions.
[2024-05-28 09:47:28] [INFO ] Flatten gal took : 898 ms
[2024-05-28 09:47:29] [INFO ] Flatten gal took : 568 ms
[2024-05-28 09:47:30] [INFO ] Input system was already deterministic with 1650 transitions.
Support contains 281 out of 474 places (down from 284) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (2237 resets) in 10223 ms. (3 steps per ms) remains 14/22 properties
BEST_FIRST walk for 40004 steps (420 resets) in 1479 ms. (27 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (480 resets) in 1529 ms. (26 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (419 resets) in 1183 ms. (33 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (402 resets) in 1756 ms. (22 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (416 resets) in 1288 ms. (31 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (417 resets) in 1205 ms. (33 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (136 resets) in 590 ms. (67 steps per ms) remains 8/14 properties
BEST_FIRST walk for 40003 steps (68 resets) in 280 ms. (142 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (416 resets) in 587 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (92 resets) in 277 ms. (143 steps per ms) remains 4/6 properties
[2024-05-28 09:47:36] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-05-28 09:47:36] [INFO ] Invariant cache hit.
[2024-05-28 09:47:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 210/271 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 152/423 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/430 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 472/2115 variables, and 70 constraints, problems are : Problem set: 4 solved, 0 unsolved in 1956 ms.
Refiners :[Positive P Invariants (semi-flows): 43/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2279ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBNT-PT-S10J20-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(X((G(p0)||(p0&&F(G(p1)))))))'
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1649
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1649
Applied a total of 12 rules in 296 ms. Remains 463 /474 variables (removed 11) and now considering 1649/1650 (removed 1) transitions.
Running 1638 sub problems to find dead transitions.
[2024-05-28 09:47:40] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
// Phase 1: matrix 1640 rows 463 cols
[2024-05-28 09:47:40] [INFO ] Computed 62 invariants in 136 ms
[2024-05-28 09:47:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
SMT process timed out in 38999ms, After SMT, problems are : Problem set: 0 solved, 1638 unsolved
Search for dead transitions found 0 dead transitions in 39070ms
[2024-05-28 09:48:19] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
[2024-05-28 09:48:19] [INFO ] Invariant cache hit.
[2024-05-28 09:48:21] [INFO ] Implicit Places using invariants in 1934 ms returned []
[2024-05-28 09:48:21] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
[2024-05-28 09:48:21] [INFO ] Invariant cache hit.
[2024-05-28 09:48:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:48:29] [INFO ] Implicit Places using invariants and state equation in 8248 ms returned []
Implicit Place search using SMT with State Equation took 10208 ms to find 0 implicit places.
Running 1638 sub problems to find dead transitions.
[2024-05-28 09:48:29] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
[2024-05-28 09:48:29] [INFO ] Invariant cache hit.
[2024-05-28 09:48:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
SMT process timed out in 48363ms, After SMT, problems are : Problem set: 0 solved, 1638 unsolved
Search for dead transitions found 0 dead transitions in 48400ms
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1649/1650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97988 ms. Remains : 463/474 places, 1649/1650 transitions.
Stuttering acceptance computed with spot in 711 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-02
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 10 ms.
FORMULA PolyORBNT-PT-S10J20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J20-LTLFireability-02 finished in 99274 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(X(F(p0))))'
Support contains 1 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1649
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1649
Applied a total of 12 rules in 199 ms. Remains 463 /474 variables (removed 11) and now considering 1649/1650 (removed 1) transitions.
Running 1638 sub problems to find dead transitions.
[2024-05-28 09:49:18] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
[2024-05-28 09:49:19] [INFO ] Invariant cache hit.
[2024-05-28 09:49:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
SMT process timed out in 37381ms, After SMT, problems are : Problem set: 0 solved, 1638 unsolved
Search for dead transitions found 0 dead transitions in 37443ms
[2024-05-28 09:49:56] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
[2024-05-28 09:49:56] [INFO ] Invariant cache hit.
[2024-05-28 09:49:57] [INFO ] Implicit Places using invariants in 1124 ms returned []
[2024-05-28 09:49:57] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
[2024-05-28 09:49:57] [INFO ] Invariant cache hit.
[2024-05-28 09:49:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:50:05] [INFO ] Implicit Places using invariants and state equation in 8419 ms returned []
Implicit Place search using SMT with State Equation took 9570 ms to find 0 implicit places.
Running 1638 sub problems to find dead transitions.
[2024-05-28 09:50:05] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
[2024-05-28 09:50:06] [INFO ] Invariant cache hit.
[2024-05-28 09:50:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/2103 variables, and 51 constraints, problems are : Problem set: 0 solved, 1638 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1638/638 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1638 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/2103 variables, and 51 constraints, problems are : Problem set: 0 solved, 1638 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/638 constraints, Known Traps: 0/0 constraints]
After SMT, in 77328ms problems are : Problem set: 0 solved, 1638 unsolved
Search for dead transitions found 0 dead transitions in 77365ms
Starting structural reductions in LTL mode, iteration 1 : 463/474 places, 1649/1650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124602 ms. Remains : 463/474 places, 1649/1650 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J20-LTLFireability-03
Product exploration explored 100000 steps with 32834 reset in 1519 ms.
Product exploration explored 100000 steps with 32819 reset in 1021 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 26 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 1649/1649 transitions.
Applied a total of 0 rules in 23 ms. Remains 463 /463 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
Running 1638 sub problems to find dead transitions.
[2024-05-28 09:51:26] [INFO ] Flow matrix only has 1640 transitions (discarded 9 similar events)
[2024-05-28 09:51:26] [INFO ] Invariant cache hit.
[2024-05-28 09:51:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/2103 variables, and 51 constraints, problems are : Problem set: 0 solved, 1638 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1638/638 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1638 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1638 unsolved
Problem TDEAD230 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1644 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/453 variables, 1/52 constraints. Problems are: Problem set: 66 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/2103 variables, and 52 constraints, problems are : Problem set: 66 solved, 1572 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/638 constraints, Known Traps: 0/0 constraints]
After SMT, in 58280ms problems are : Problem set: 66 solved, 1572 unsolved
Search for dead transitions found 66 dead transitions in 58299ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-05-28 09:52:25] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
// Phase 1: matrix 1574 rows 463 cols
[2024-05-28 09:52:25] [INFO ] Computed 62 invariants in 21 ms
[2024-05-28 09:52:25] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-05-28 09:52:25] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
[2024-05-28 09:52:25] [INFO ] Invariant cache hit.
[2024-05-28 09:52:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:52:31] [INFO ] Implicit Places using invariants and state equation in 5840 ms returned []
Implicit Place search using SMT with State Equation took 6435 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 463/463 places, 1583/1649 transitions.
Applied a total of 0 rules in 18 ms. Remains 463 /463 variables (removed 0) and now considering 1583/1583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64787 ms. Remains : 463/463 places, 1583/1649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 46 steps (0 resets) in 8 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32778 reset in 942 ms.
Product exploration explored 100000 steps with 32806 reset in 974 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 1583/1583 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 463 transition count 1583
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 24 place count 463 transition count 1584
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 463 transition count 1584
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 52 place count 463 transition count 1584
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 76 place count 439 transition count 1560
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 100 place count 439 transition count 1560
Deduced a syphon composed of 28 places in 1 ms
Applied a total of 100 rules in 259 ms. Remains 439 /463 variables (removed 24) and now considering 1560/1583 (removed 23) transitions.
Running 1549 sub problems to find dead transitions.
[2024-05-28 09:52:35] [INFO ] Flow matrix only has 1551 transitions (discarded 9 similar events)
// Phase 1: matrix 1551 rows 439 cols
[2024-05-28 09:52:35] [INFO ] Computed 62 invariants in 37 ms
[2024-05-28 09:52:35] [INFO ] State equation strengthened by 1 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-PT-S10J20

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: 474
TRANSITIONS: 11760
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.877s, Sys 0.029s]


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


----------------------------------------------------------------------
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: 873
MODEL NAME: /home/mcc/execution/model
474 places, 11760 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="PolyORBNT-PT-S10J20"
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 PolyORBNT-PT-S10J20, 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-171654446000484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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