About the Execution of ITS-Tools for GPPP-PT-C0100N0000001000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 313462.00 | 0.00 | 0.00 | FTFFFTFFFFFFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007700332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is GPPP-PT-C0100N0000001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007700332
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 17 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1 May 29 14:32 large_marking
-rw-r--r-- 1 mcc users 21K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-00
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-01
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-02
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-03
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-04
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-05
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-06
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-07
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-08
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-09
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-10
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-11
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-12
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-13
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-14
FORMULA_NAME GPPP-PT-C0100N0000001000-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748939278915
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000001000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 08:28:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 08:28:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 08:28:01] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2025-06-03 08:28:01] [INFO ] Transformed 33 places.
[2025-06-03 08:28:01] [INFO ] Transformed 22 transitions.
[2025-06-03 08:28:01] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 318 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 12 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2025-06-03 08:28:01] [INFO ] Computed 12 invariants in 11 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 1 solved, 20 unsolved in 970 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 33/55 variables, and 12 constraints, problems are : Problem set: 1 solved, 20 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21068ms problems are : Problem set: 1 solved, 20 unsolved
Search for dead transitions found 1 dead transitions in 21111ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
// Phase 1: matrix 21 rows 33 cols
[2025-06-03 08:28:22] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:28:22] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-03 08:28:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:28:23] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/33 places, 21/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21371 ms. Remains : 33/33 places, 21/22 transitions.
Support contains 30 out of 33 places after structural reductions.
[2025-06-03 08:28:23] [INFO ] Flatten gal took : 38 ms
[2025-06-03 08:28:23] [INFO ] Flatten gal took : 13 ms
[2025-06-03 08:28:23] [INFO ] Input system was already deterministic with 21 transitions.
Support contains 29 out of 33 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 11640 steps (0 resets) in 182 ms. (63 steps per ms) remains 0/19 properties
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 31 stabilizing places and 19 stable transitions
Graph (complete) has 81 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&((p1 U X(X(!p1))) U (X(p3)&&p2))))'
Support contains 9 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 20 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 32 cols
[2025-06-03 08:28:24] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 32/53 variables, and 12 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/32 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20508ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20509ms
[2025-06-03 08:28:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:28:44] [INFO ] Implicit Places using invariants in 72 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20608 ms. Remains : 31/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 795 ms :[(OR (NOT p2) (NOT p0) (NOT p3)), (NOT p0), p1, (OR (NOT p2) (NOT p3)), p1, (AND (NOT p3) p1), (NOT p3), (AND p1 (NOT p3)), p1, true, p1, p1]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-00
Stuttering criterion allowed to conclude after 2909 steps with 2 reset in 29 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-00 finished in 21558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(!p0&&F((G(F(p1))||(!p1&&F(p1))))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 26 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 24 transition count 15
Applied a total of 12 rules in 24 ms. Remains 24 /33 variables (removed 9) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 24 cols
[2025-06-03 08:28:45] [INFO ] Computed 10 invariants in 1 ms
[2025-06-03 08:28:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 35 constraints, problems are : Problem set: 0 solved, 14 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 24/39 variables, and 10 constraints, problems are : Problem set: 0 solved, 14 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/24 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20354ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 20356ms
[2025-06-03 08:29:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:29:06] [INFO ] Implicit Places using invariants in 59 ms returned [0, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/33 places, 15/21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 19 transition count 13
Applied a total of 4 rules in 5 ms. Remains 19 /21 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 19 cols
[2025-06-03 08:29:06] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:29:06] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-03 08:29:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:29:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:29:06] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 94 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/33 places, 13/21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 12
Applied a total of 2 rules in 2 ms. Remains 16 /17 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 16 cols
[2025-06-03 08:29:06] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:29:06] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-03 08:29:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:29:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-03 08:29:06] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 16/33 places, 12/21 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 20640 ms. Remains : 16/33 places, 12/21 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 551 ms.
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Computed a total of 16 stabilizing places and 11 stable transitions
Graph (complete) has 36 edges and 16 vertex of which 14 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 11 stable transitions
Detected a total of 16/16 stabilizing places and 11/12 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-01 finished in 21687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (complete) has 81 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 27 transition count 18
Applied a total of 9 rules in 9 ms. Remains 27 /33 variables (removed 6) and now considering 18/21 (removed 3) transitions.
Running 17 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 27 cols
[2025-06-03 08:29:07] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/45 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 37 constraints, problems are : Problem set: 0 solved, 17 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 27/45 variables, and 10 constraints, problems are : Problem set: 0 solved, 17 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/27 constraints, PredecessorRefiner: 0/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20333ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 20334ms
[2025-06-03 08:29:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:29:27] [INFO ] Implicit Places using invariants in 80 ms returned [3, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 18/21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 24 transition count 17
Applied a total of 2 rules in 3 ms. Remains 24 /25 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 24 cols
[2025-06-03 08:29:27] [INFO ] Computed 8 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:29:27] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-03 08:29:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:29:27] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 154 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/33 places, 17/21 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 23 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 15
Applied a total of 4 rules in 5 ms. Remains 21 /23 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 21 cols
[2025-06-03 08:29:27] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:29:27] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-03 08:29:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:29:28] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 21/33 places, 15/21 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 20675 ms. Remains : 21/33 places, 15/21 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-02
Product exploration explored 100000 steps with 2235 reset in 183 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-02 finished in 20959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F((G(p0)||(p0&&F(p1))))&&F(!p2)))||(G(p0)&&F((X(!p2)&&F((G(p0)||(p0&&F(p1))))))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 32 cols
[2025-06-03 08:29:28] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 32/53 variables, and 12 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/32 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20387ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20389ms
[2025-06-03 08:29:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:29:48] [INFO ] Implicit Places using invariants in 111 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20505 ms. Remains : 31/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 411 ms :[(OR (NOT p0) p2), (NOT p0), p2, (AND (NOT p0) (NOT p1)), (NOT p0), p2]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-03
Product exploration explored 100000 steps with 756 reset in 355 ms.
Stack based approach found an accepted trace after 185 steps with 2 reset with depth 66 and stack size 66 in 2 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-03 finished in 21318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 30 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 30 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 29 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 26 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 24 transition count 15
Applied a total of 14 rules in 11 ms. Remains 24 /33 variables (removed 9) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 24 cols
[2025-06-03 08:29:49] [INFO ] Computed 10 invariants in 1 ms
[2025-06-03 08:29:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 35 constraints, problems are : Problem set: 0 solved, 14 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 24/39 variables, and 10 constraints, problems are : Problem set: 0 solved, 14 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/24 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20565ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 20566ms
[2025-06-03 08:30:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:30:10] [INFO ] Implicit Places using invariants in 44 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/33 places, 15/21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 14
Applied a total of 2 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 21 cols
[2025-06-03 08:30:10] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:30:10] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-03 08:30:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:30:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:30:10] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 103 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/33 places, 14/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 20731 ms. Remains : 20/33 places, 14/21 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-04
Stuttering criterion allowed to conclude after 1250 steps with 0 reset in 5 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-04 finished in 20802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1 U (p2||F(G(p3))))))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 32 cols
[2025-06-03 08:30:10] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 32/53 variables, and 12 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/32 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20538ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20538ms
[2025-06-03 08:30:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:30:31] [INFO ] Implicit Places using invariants in 84 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 94 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20635 ms. Remains : 30/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-05
Product exploration explored 100000 steps with 20023 reset in 243 ms.
Product exploration explored 100000 steps with 20005 reset in 460 ms.
Computed a total of 28 stabilizing places and 19 stable transitions
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND p3 (NOT p2) p0))), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X p0), (X (AND (NOT p3) (NOT p2) p0)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p3) (NOT p2) p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 1542 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), false, false, false, false]
RANDOM walk for 41293 steps (12 resets) in 123 ms. (333 steps per ms) remains 3/11 properties
BEST_FIRST walk for 38793 steps (8 resets) in 553 ms. (70 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND p3 (NOT p2) p0))), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X p0), (X (AND (NOT p3) (NOT p2) p0)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p3) (NOT p2) p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (OR p2 (NOT p3) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (OR p2 (NOT p3) p0))), (F p2), (F p3), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3) p0))), (F (NOT (OR p2 p3 (NOT p0)))), (F (NOT (OR (NOT p2) p3 p0))), (F p0)]
Knowledge based reduction with 18 factoid took 5223 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), false, false, false, false]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), false, false, false, false]
// Phase 1: matrix 21 rows 30 cols
[2025-06-03 08:30:39] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 08:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-03 08:30:39] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-03 08:30:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:30:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 08:30:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-03 08:30:39] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 10 ms returned sat
[2025-06-03 08:30:40] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-03 08:30:40] [INFO ] Computed and/alt/rep : 20/39/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:30:40] [INFO ] Added : 20 causal constraints over 4 iterations in 47 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3) (NOT p0))
Support contains 5 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 21/21 transitions.
Graph (trivial) has 5 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 19
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 28 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 27 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 27 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 26 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 12 place count 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 15 place count 21 transition count 14
Applied a total of 15 rules in 11 ms. Remains 21 /30 variables (removed 9) and now considering 14/21 (removed 7) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 21 cols
[2025-06-03 08:30:40] [INFO ] Computed 8 invariants in 0 ms
[2025-06-03 08:30:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/34 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/35 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 30 constraints, problems are : Problem set: 0 solved, 13 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/34 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 43 constraints, problems are : Problem set: 0 solved, 13 unsolved in 19084 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19369ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 19370ms
[2025-06-03 08:30:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:30:59] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-03 08:30:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:30:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:30:59] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/30 places, 14/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19545 ms. Remains : 20/30 places, 14/21 transitions.
Computed a total of 20 stabilizing places and 13 stable transitions
Computed a total of 20 stabilizing places and 13 stable transitions
Detected a total of 20/20 stabilizing places and 13/14 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p3) p0))), (X (NOT (AND (NOT p2) p3 p0))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND p2 p3 p0))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p2 p3 (NOT p0)))), (X p0), (X (AND (NOT p2) (NOT p3) p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X p0)), (X (X (AND (NOT p2) (NOT p3) p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1336 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), false, false, false, false]
RANDOM walk for 41186 steps (31 resets) in 71 ms. (572 steps per ms) remains 3/11 properties
BEST_FIRST walk for 15151 steps (2 resets) in 115 ms. (130 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p3) p0))), (X (NOT (AND (NOT p2) p3 p0))), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND p2 p3 p0))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (NOT (AND p2 p3 (NOT p0)))), (X p0), (X (AND (NOT p2) (NOT p3) p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X p0)), (X (X (AND (NOT p2) (NOT p3) p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (OR p2 (NOT p3) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (OR p2 (NOT p3) p0))), (F p2), (F p3), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3) p0))), (F (NOT (OR p2 p3 (NOT p0)))), (F (NOT (OR (NOT p2) p3 p0))), (F p0)]
Knowledge based reduction with 26 factoid took 3550 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), false, false, false, false]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), false, false, false, false]
// Phase 1: matrix 14 rows 20 cols
[2025-06-03 08:31:05] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 08:31:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:31:05] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 6 ms returned sat
[2025-06-03 08:31:05] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-03 08:31:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 08:31:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:31:07] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1426 ms returned sat
[2025-06-03 08:31:07] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2025-06-03 08:31:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:31:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:31:07] [INFO ] Computed and/alt/rep : 13/28/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:31:07] [INFO ] Added : 12 causal constraints over 3 iterations in 33 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3) (NOT p0))
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), false, false, false, false]
Product exploration explored 100000 steps with 20010 reset in 198 ms.
Product exploration explored 100000 steps with 19938 reset in 272 ms.
Built C files in :
/tmp/ltsmin18065179111033602427
[2025-06-03 08:31:08] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2025-06-03 08:31:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 08:31:08] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2025-06-03 08:31:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 08:31:08] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2025-06-03 08:31:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 08:31:08] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18065179111033602427
Running compilation step : cd /tmp/ltsmin18065179111033602427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 345 ms.
Running link step : cd /tmp/ltsmin18065179111033602427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin18065179111033602427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13795120777428162121.hoa' '--buchi-type=spotba'
LTSmin run took 238 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-05 finished in 58283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((p0||X(X(p1)))))||F(p1))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 32 cols
[2025-06-03 08:31:08] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 32/53 variables, and 12 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/32 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20475ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20475ms
[2025-06-03 08:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:31:29] [INFO ] Implicit Places using invariants in 57 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20536 ms. Remains : 30/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-06
Product exploration explored 100000 steps with 4391 reset in 286 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-06 finished in 21036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 30 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 30 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 29 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 26 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 24 transition count 15
Applied a total of 14 rules in 9 ms. Remains 24 /33 variables (removed 9) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 24 cols
[2025-06-03 08:31:29] [INFO ] Computed 10 invariants in 1 ms
[2025-06-03 08:31:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 35 constraints, problems are : Problem set: 0 solved, 14 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 24/39 variables, and 10 constraints, problems are : Problem set: 0 solved, 14 unsolved in 20008 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/24 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20431ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 20431ms
[2025-06-03 08:31:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:31:50] [INFO ] Implicit Places using invariants in 49 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 15/21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 14
Applied a total of 2 rules in 5 ms. Remains 22 /23 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 22 cols
[2025-06-03 08:31:50] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:31:50] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-03 08:31:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:31:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:31:50] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 116 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/33 places, 14/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 20612 ms. Remains : 20/33 places, 14/21 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-09 finished in 20662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(((X(p0)||F(p0)) U p1)) U p2) U X(p0)))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 32 cols
[2025-06-03 08:31:50] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 32/53 variables, and 12 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20007 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/32 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20375ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20376ms
[2025-06-03 08:32:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:32:10] [INFO ] Implicit Places using invariants in 58 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20445 ms. Remains : 30/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-10
Product exploration explored 100000 steps with 8681 reset in 127 ms.
Stack based approach found an accepted trace after 251 steps with 24 reset with depth 8 and stack size 8 in 1 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-10 finished in 20853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2025-06-03 08:32:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 64 constraints, problems are : Problem set: 0 solved, 20 unsolved in 19054 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19502ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 19502ms
[2025-06-03 08:32:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:32:30] [INFO ] Implicit Places using invariants in 72 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 73 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19578 ms. Remains : 30/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-13
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-13 finished in 19718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 28 transition count 18
Applied a total of 6 rules in 5 ms. Remains 28 /33 variables (removed 5) and now considering 18/21 (removed 3) transitions.
Running 17 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 28 cols
[2025-06-03 08:32:30] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 18/46 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/46 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 39 constraints, problems are : Problem set: 0 solved, 17 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 28/46 variables, and 11 constraints, problems are : Problem set: 0 solved, 17 unsolved in 20008 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/28 constraints, PredecessorRefiner: 0/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20407ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 20408ms
[2025-06-03 08:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:32:51] [INFO ] Implicit Places using invariants in 47 ms returned [0, 2, 3, 15]
[2025-06-03 08:32:51] [INFO ] Actually due to overlaps returned [15, 0, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 18/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20478 ms. Remains : 25/33 places, 18/21 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-14
Stuttering criterion allowed to conclude after 1304 steps with 0 reset in 5 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-14 finished in 20572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(!p0))))))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 32 cols
[2025-06-03 08:32:51] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 32/53 variables, and 12 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/32 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20465ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20466ms
[2025-06-03 08:33:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:12] [INFO ] Implicit Places using invariants in 78 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20559 ms. Remains : 30/33 places, 21/21 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, p0, p0, p0, p0, p0]
Running random walk in product with property : GPPP-PT-C0100N0000001000-LTLFireability-15
Entered a terminal (fully accepting) state of product in 71 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000001000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000001000-LTLFireability-15 finished in 20778 ms.
All properties solved by simple procedures.
Total runtime 311289 ms.
BK_STOP 1748939592377
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="GPPP-PT-C0100N0000001000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0100N0000001000, 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 r100-smll-174867007700332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000001000.tgz
mv GPPP-PT-C0100N0000001000 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.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 [ "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 ;