Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813400164.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 CANConstruction-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813400164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 167K 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 CANConstruction-PT-005-LTLFireability-00
FORMULA_NAME CANConstruction-PT-005-LTLFireability-01
FORMULA_NAME CANConstruction-PT-005-LTLFireability-02
FORMULA_NAME CANConstruction-PT-005-LTLFireability-03
FORMULA_NAME CANConstruction-PT-005-LTLFireability-04
FORMULA_NAME CANConstruction-PT-005-LTLFireability-05
FORMULA_NAME CANConstruction-PT-005-LTLFireability-06
FORMULA_NAME CANConstruction-PT-005-LTLFireability-07
FORMULA_NAME CANConstruction-PT-005-LTLFireability-08
FORMULA_NAME CANConstruction-PT-005-LTLFireability-09
FORMULA_NAME CANConstruction-PT-005-LTLFireability-10
FORMULA_NAME CANConstruction-PT-005-LTLFireability-11
FORMULA_NAME CANConstruction-PT-005-LTLFireability-12
FORMULA_NAME CANConstruction-PT-005-LTLFireability-13
FORMULA_NAME CANConstruction-PT-005-LTLFireability-14
FORMULA_NAME CANConstruction-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748625226149

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 17:13:47] [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-05-30 17:13:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 17:13:48] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2025-05-30 17:13:48] [INFO ] Transformed 112 places.
[2025-05-30 17:13:48] [INFO ] Transformed 140 transitions.
[2025-05-30 17:13:48] [INFO ] Parsed PT model containing 112 places and 140 transitions and 400 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-005-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 140/140 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 134
Applied a total of 6 rules in 46 ms. Remains 109 /112 variables (removed 3) and now considering 134/140 (removed 6) transitions.
// Phase 1: matrix 134 rows 109 cols
[2025-05-30 17:13:48] [INFO ] Computed 11 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:49] [INFO ] Implicit Places using invariants in 427 ms returned [12, 40, 54, 68]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 497 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/112 places, 134/140 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 130
Applied a total of 8 rules in 16 ms. Remains 101 /105 variables (removed 4) and now considering 130/134 (removed 4) transitions.
// Phase 1: matrix 130 rows 101 cols
[2025-05-30 17:13:49] [INFO ] Computed 7 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:49] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-05-30 17:13:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:13:49] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/112 places, 130/140 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 937 ms. Remains : 101/112 places, 130/140 transitions.
Support contains 35 out of 101 places after structural reductions.
[2025-05-30 17:13:49] [INFO ] Flatten gal took : 59 ms
[2025-05-30 17:13:49] [INFO ] Flatten gal took : 20 ms
[2025-05-30 17:13:49] [INFO ] Input system was already deterministic with 130 transitions.
Support contains 34 out of 101 places (down from 35) after GAL structural reductions.
RANDOM walk for 3236 steps (37 resets) in 292 ms. (11 steps per ms) remains 0/27 properties
Computed a total of 17 stabilizing places and 21 stable transitions
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((X(p0) U (G(!p1)||(!p1&&F(p2)&&X(F(p3))))))))'
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 90 transition count 108
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 90 transition count 108
Applied a total of 22 rules in 10 ms. Remains 90 /101 variables (removed 11) and now considering 108/130 (removed 22) transitions.
// Phase 1: matrix 108 rows 90 cols
[2025-05-30 17:13:50] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:50] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-05-30 17:13:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:50] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:13:50] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-05-30 17:13:50] [INFO ] Invariant cache hit.
[2025-05-30 17:13:50] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:52] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:53] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:53] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:53] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:54] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 108/197 variables, 89/114 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 45/159 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 1/198 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 160 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6934 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 108/197 variables, 89/114 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 45/159 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 103/262 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/198 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 263 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6601 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13594ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 13606ms
Starting structural reductions in LTL mode, iteration 1 : 90/101 places, 108/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13916 ms. Remains : 90/101 places, 108/130 transitions.
Stuttering acceptance computed with spot in 734 ms :[p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p3)), (AND p1 (NOT p3)), p1, (AND p1 (NOT p2) p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 p0 (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-00
Product exploration explored 100000 steps with 30714 reset in 555 ms.
Product exploration explored 100000 steps with 30796 reset in 286 ms.
Computed a total of 17 stabilizing places and 21 stable transitions
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT p2)), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 211 ms. Reduced automaton from 12 states, 40 edges and 4 AP (stutter sensitive) to 12 states, 40 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 532 ms :[p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p3)), (AND p1 (NOT p3)), p1, (AND p1 (NOT p2) p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 p0 (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (AND p1 (NOT p3))]
RANDOM walk for 40000 steps (523 resets) in 539 ms. (74 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40004 steps (11 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (124 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
[2025-05-30 17:14:07] [INFO ] Invariant cache hit.
[2025-05-30 17:14:07] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 87/198 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 4/6 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/90 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT p2)), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (G (OR (NOT p0) p1 p3)), (G (OR (NOT p0) (NOT p1) p3))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p3))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p1 p3))), (F p2), (F (NOT (OR p1 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F p1), (F (NOT p3)), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 33 factoid took 935 ms. Reduced automaton from 12 states, 40 edges and 4 AP (stutter sensitive) to 11 states, 37 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 472 ms :[p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), p1, (AND p1 (NOT p2) p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 498 ms :[p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), p1, (AND p1 (NOT p2) p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Support contains 7 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-05-30 17:14:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:09] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-30 17:14:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:09] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:14:09] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-05-30 17:14:09] [INFO ] Invariant cache hit.
[2025-05-30 17:14:09] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:10] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:10] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:10] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:10] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:10] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:10] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:10] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:10] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:10] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:10] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:10] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:10] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:11] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:11] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:11] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:11] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:11] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:12] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 108/197 variables, 89/114 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 45/159 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 1/198 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 160 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6372 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 108/197 variables, 89/114 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 45/159 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 103/262 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/198 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 263 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6447 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12848ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 12850ms
Finished structural reductions in LTL mode , in 1 iterations and 13130 ms. Remains : 90/90 places, 108/108 transitions.
Computed a total of 17 stabilizing places and 21 stable transitions
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 225 ms. Reduced automaton from 11 states, 37 edges and 4 AP (stutter sensitive) to 11 states, 37 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 526 ms :[p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), p1, (AND p1 (NOT p2) p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
RANDOM walk for 9278 steps (118 resets) in 28 ms. (319 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR p1 p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p3)), (F p1), (F p0)]
Knowledge based reduction with 24 factoid took 685 ms. Reduced automaton from 11 states, 37 edges and 4 AP (stutter sensitive) to 11 states, 37 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 457 ms :[p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), p1, (AND p1 (NOT p2) p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 466 ms :[p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), p1, (AND p1 (NOT p2) p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 502 ms :[p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), p1, (AND p1 (NOT p2) p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Product exploration explored 100000 steps with 30757 reset in 157 ms.
Product exploration explored 100000 steps with 30802 reset in 221 ms.
Applying partial POR strategy [false, true, true, true, true, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 534 ms :[p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), p1, (AND p1 (NOT p2) p0), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Support contains 7 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 108/108 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 90 transition count 108
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 17 place count 90 transition count 108
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 26 place count 90 transition count 108
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 80 transition count 98
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 80 transition count 98
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 80 transition count 98
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 74 place count 65 transition count 83
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 89 place count 65 transition count 83
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 18 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 65 transition count 98
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 93 rules in 56 ms. Remains 65 /90 variables (removed 25) and now considering 98/108 (removed 10) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:14:26] [INFO ] Redundant transitions in 5 ms returned []
Running 93 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 65 cols
[2025-05-30 17:14:26] [INFO ] Computed 7 invariants in 3 ms
[2025-05-30 17:14:26] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 3 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:27] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:28] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:28] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 4 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 20/27 constraints. Problems are: Problem set: 4 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:28] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:28] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:28] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:28] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:28] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:28] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:28] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 7/34 constraints. Problems are: Problem set: 4 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 89 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 5 (OVERLAPS) 98/162 variables, 64/98 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 60/158 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/158 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/159 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/159 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/159 constraints. Problems are: Problem set: 22 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 159 constraints, problems are : Problem set: 22 solved, 71 unsolved in 4524 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 27/28 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/28 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 18/64 variables, 6/34 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/34 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 98/162 variables, 64/98 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 60/158 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 71/229 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/229 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 1/163 variables, 1/230 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/230 constraints. Problems are: Problem set: 22 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/230 constraints. Problems are: Problem set: 22 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 230 constraints, problems are : Problem set: 22 solved, 71 unsolved in 4311 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 71/93 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8868ms problems are : Problem set: 22 solved, 71 unsolved
Search for dead transitions found 22 dead transitions in 8870ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 65/90 places, 76/108 transitions.
Graph (complete) has 217 edges and 65 vertex of which 47 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 47 /65 variables (removed 18) and now considering 76/76 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/90 places, 76/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8954 ms. Remains : 47/90 places, 76/108 transitions.
Built C files in :
/tmp/ltsmin9632434785479857468
[2025-05-30 17:14:35] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9632434785479857468
Running compilation step : cd /tmp/ltsmin9632434785479857468;'/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 452 ms.
Running link step : cd /tmp/ltsmin9632434785479857468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9632434785479857468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17369932330359085259.hoa' '--buchi-type=spotba'
LTSmin run took 263 ms.
FORMULA CANConstruction-PT-005-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CANConstruction-PT-005-LTLFireability-00 finished in 45998 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((X(X(p0))&&(G(p1) U p2)))||X(F(!p2)))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 101 transition count 99
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 70 transition count 99
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 62 place count 70 transition count 95
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 66 transition count 95
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 80 place count 56 transition count 75
Iterating global reduction 2 with 10 rules applied. Total rules applied 90 place count 56 transition count 75
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 56 transition count 72
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 96 place count 53 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 106 place count 48 transition count 67
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 116 place count 43 transition count 75
Applied a total of 116 rules in 22 ms. Remains 43 /101 variables (removed 58) and now considering 75/130 (removed 55) transitions.
// Phase 1: matrix 75 rows 43 cols
[2025-05-30 17:14:36] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:36] [INFO ] Implicit Places using invariants in 74 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/101 places, 75/130 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 73
Applied a total of 4 rules in 6 ms. Remains 40 /42 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 40 cols
[2025-05-30 17:14:36] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:36] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-30 17:14:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:36] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-05-30 17:14:36] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/101 places, 73/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 317 ms. Remains : 40/101 places, 73/130 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) p2), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-01
Product exploration explored 100000 steps with 4927 reset in 201 ms.
Stack based approach found an accepted trace after 806 steps with 35 reset with depth 25 and stack size 22 in 3 ms.
FORMULA CANConstruction-PT-005-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-01 finished in 688 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(G(p0))&&F(p1))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 101 transition count 101
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 72 transition count 101
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 58 place count 72 transition count 97
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 68 transition count 97
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 77 place count 57 transition count 75
Iterating global reduction 2 with 11 rules applied. Total rules applied 88 place count 57 transition count 75
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 57 transition count 72
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 94 place count 54 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 106 place count 48 transition count 66
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 116 place count 43 transition count 75
Applied a total of 116 rules in 14 ms. Remains 43 /101 variables (removed 58) and now considering 75/130 (removed 55) transitions.
// Phase 1: matrix 75 rows 43 cols
[2025-05-30 17:14:37] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:37] [INFO ] Implicit Places using invariants in 52 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/101 places, 75/130 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 41 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 41 transition count 74
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 4 place count 40 transition count 73
Applied a total of 4 rules in 6 ms. Remains 40 /42 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 40 cols
[2025-05-30 17:14:37] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:37] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-30 17:14:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:37] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-30 17:14:37] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/101 places, 73/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 40/101 places, 73/130 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-02
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-02 finished in 383 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((F(p0)&&(X(X(G(p1)))||G(p2)))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 90 transition count 108
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 90 transition count 108
Applied a total of 22 rules in 3 ms. Remains 90 /101 variables (removed 11) and now considering 108/130 (removed 22) transitions.
// Phase 1: matrix 108 rows 90 cols
[2025-05-30 17:14:37] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:37] [INFO ] Implicit Places using invariants in 61 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/101 places, 108/130 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 107
Applied a total of 2 rules in 2 ms. Remains 88 /89 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 88 cols
[2025-05-30 17:14:37] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:37] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-30 17:14:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:14:37] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/101 places, 107/130 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 268 ms. Remains : 88/101 places, 107/130 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-03
Entered a terminal (fully accepting) state of product in 34 steps with 1 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-03 finished in 628 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)&&(X(G(p1))||F(p2)))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 91 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 91 transition count 110
Applied a total of 20 rules in 4 ms. Remains 91 /101 variables (removed 10) and now considering 110/130 (removed 20) transitions.
// Phase 1: matrix 110 rows 91 cols
[2025-05-30 17:14:38] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:38] [INFO ] Implicit Places using invariants in 81 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/101 places, 110/130 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 109
Applied a total of 2 rules in 6 ms. Remains 89 /90 variables (removed 1) and now considering 109/110 (removed 1) transitions.
// Phase 1: matrix 109 rows 89 cols
[2025-05-30 17:14:38] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:38] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-05-30 17:14:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:14:38] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 89/101 places, 109/130 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 335 ms. Remains : 89/101 places, 109/130 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-04
Product exploration explored 100000 steps with 1622 reset in 167 ms.
Product exploration explored 100000 steps with 1612 reset in 577 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 729 steps (8 resets) in 6 ms. (104 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 7 factoid took 216 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2025-05-30 17:14:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:40] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-05-30 17:14:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:14:40] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:14:40] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2025-05-30 17:14:40] [INFO ] Invariant cache hit.
[2025-05-30 17:14:40] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:40] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:41] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:42] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:42] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/112 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 45/157 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 1/198 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 158 constraints, problems are : Problem set: 0 solved, 104 unsolved in 5770 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 89/89 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:46] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:46] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:46] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:47] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 109/197 variables, 88/116 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 45/161 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 104/265 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1/198 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 266 constraints, problems are : Problem set: 0 solved, 104 unsolved in 8020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 89/89 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13804ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 13805ms
Finished structural reductions in LTL mode , in 1 iterations and 14031 ms. Remains : 89/89 places, 109/109 transitions.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1437 steps (16 resets) in 9 ms. (143 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 1608 reset in 100 ms.
Product exploration explored 100000 steps with 1586 reset in 110 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 109/109 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 89 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 20 place count 89 transition count 109
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 89 transition count 109
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 79 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 79 transition count 99
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 65 place count 79 transition count 99
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 90 place count 54 transition count 74
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 115 place count 54 transition count 74
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 54 transition count 92
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 120 rules in 21 ms. Remains 54 /89 variables (removed 35) and now considering 92/109 (removed 17) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:14:55] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
// Phase 1: matrix 92 rows 54 cols
[2025-05-30 17:14:55] [INFO ] Computed 6 invariants in 1 ms
[2025-05-30 17:14:55] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:56] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 14/20 constraints. Problems are: Problem set: 4 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 83 unsolved
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 3 (OVERLAPS) 92/145 variables, 53/73 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 63/136 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/136 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 1/146 variables, 1/137 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/137 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/137 constraints. Problems are: Problem set: 20 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 137 constraints, problems are : Problem set: 20 solved, 67 unsolved in 3494 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 15/53 variables, 6/20 constraints. Problems are: Problem set: 20 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:59] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:59] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:14:59] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/23 constraints. Problems are: Problem set: 20 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:15:00] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/24 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/24 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 92/145 variables, 53/77 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 63/140 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 67/207 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/207 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 1/146 variables, 1/208 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/208 constraints. Problems are: Problem set: 20 solved, 67 unsolved
At refinement iteration 12 (OVERLAPS) 0/146 variables, 0/208 constraints. Problems are: Problem set: 20 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 208 constraints, problems are : Problem set: 20 solved, 67 unsolved in 4392 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 67/87 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7910ms problems are : Problem set: 20 solved, 67 unsolved
Search for dead transitions found 20 dead transitions in 7912ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 54/89 places, 72/109 transitions.
Graph (complete) has 217 edges and 54 vertex of which 39 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 39 /54 variables (removed 15) and now considering 72/72 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/89 places, 72/109 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7951 ms. Remains : 39/89 places, 72/109 transitions.
Built C files in :
/tmp/ltsmin16456155422987455576
[2025-05-30 17:15:03] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16456155422987455576
Running compilation step : cd /tmp/ltsmin16456155422987455576;'/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 285 ms.
Running link step : cd /tmp/ltsmin16456155422987455576;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin16456155422987455576;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5417725584034869994.hoa' '--buchi-type=spotba'
LTSmin run took 160 ms.
FORMULA CANConstruction-PT-005-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CANConstruction-PT-005-LTLFireability-04 finished in 26072 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(F((F(p0)&&X((F(p1)||X(X(G(p2))))))))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 89 transition count 106
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 89 transition count 106
Applied a total of 24 rules in 4 ms. Remains 89 /101 variables (removed 12) and now considering 106/130 (removed 24) transitions.
// Phase 1: matrix 106 rows 89 cols
[2025-05-30 17:15:04] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:04] [INFO ] Implicit Places using invariants in 76 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/101 places, 106/130 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 87 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 105
Applied a total of 2 rules in 4 ms. Remains 87 /88 variables (removed 1) and now considering 105/106 (removed 1) transitions.
// Phase 1: matrix 105 rows 87 cols
[2025-05-30 17:15:04] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:04] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-30 17:15:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:04] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:15:04] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/101 places, 105/130 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 316 ms. Remains : 87/101 places, 105/130 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-05
Stuttering criterion allowed to conclude after 144 steps with 2 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-05 finished in 668 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 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 101 transition count 99
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 70 transition count 99
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 62 place count 70 transition count 95
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 66 transition count 95
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 81 place count 55 transition count 73
Iterating global reduction 2 with 11 rules applied. Total rules applied 92 place count 55 transition count 73
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 55 transition count 70
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 98 place count 52 transition count 70
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 110 place count 46 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 120 place count 41 transition count 73
Applied a total of 120 rules in 13 ms. Remains 41 /101 variables (removed 60) and now considering 73/130 (removed 57) transitions.
// Phase 1: matrix 73 rows 41 cols
[2025-05-30 17:15:04] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:04] [INFO ] Implicit Places using invariants in 50 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/101 places, 73/130 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 71
Applied a total of 4 rules in 5 ms. Remains 38 /40 variables (removed 2) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 38 cols
[2025-05-30 17:15:04] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-30 17:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:05] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-30 17:15:05] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/101 places, 71/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 229 ms. Remains : 38/101 places, 71/130 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-08
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-08 finished in 275 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(G(p0)))))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 90 transition count 108
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 90 transition count 108
Applied a total of 22 rules in 2 ms. Remains 90 /101 variables (removed 11) and now considering 108/130 (removed 22) transitions.
// Phase 1: matrix 108 rows 90 cols
[2025-05-30 17:15:05] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:05] [INFO ] Implicit Places using invariants in 71 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/101 places, 108/130 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 107
Applied a total of 2 rules in 3 ms. Remains 88 /89 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 88 cols
[2025-05-30 17:15:05] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-05-30 17:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:15:05] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/101 places, 107/130 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 291 ms. Remains : 88/101 places, 107/130 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-09 finished in 442 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(X(p0)))) U (p1&&X(X(X(X(p0))))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 90 transition count 108
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 90 transition count 108
Applied a total of 22 rules in 2 ms. Remains 90 /101 variables (removed 11) and now considering 108/130 (removed 22) transitions.
// Phase 1: matrix 108 rows 90 cols
[2025-05-30 17:15:05] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:05] [INFO ] Implicit Places using invariants in 68 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/101 places, 108/130 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 107
Applied a total of 2 rules in 2 ms. Remains 88 /89 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 88 cols
[2025-05-30 17:15:05] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:05] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-05-30 17:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:15:05] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/101 places, 107/130 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 288 ms. Remains : 88/101 places, 107/130 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-10
Entered a terminal (fully accepting) state of product in 343 steps with 44 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-10 finished in 550 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 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 101 transition count 101
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 72 transition count 101
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 58 place count 72 transition count 96
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 67 transition count 96
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 55 transition count 72
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 place count 55 transition count 72
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 96 place count 55 transition count 68
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 100 place count 51 transition count 68
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 108 place count 47 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 118 place count 42 transition count 74
Applied a total of 118 rules in 13 ms. Remains 42 /101 variables (removed 59) and now considering 74/130 (removed 56) transitions.
// Phase 1: matrix 74 rows 42 cols
[2025-05-30 17:15:06] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:06] [INFO ] Implicit Places using invariants in 58 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/101 places, 74/130 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Applied a total of 4 rules in 3 ms. Remains 39 /41 variables (removed 2) and now considering 72/74 (removed 2) transitions.
// Phase 1: matrix 72 rows 39 cols
[2025-05-30 17:15:06] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 17:15:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:06] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-30 17:15:06] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/101 places, 72/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 290 ms. Remains : 39/101 places, 72/130 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-11
Product exploration explored 100000 steps with 3975 reset in 123 ms.
Stack based approach found an accepted trace after 59 steps with 2 reset with depth 16 and stack size 16 in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-11 finished in 467 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(G(!p0))))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 90 transition count 108
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 90 transition count 108
Applied a total of 22 rules in 2 ms. Remains 90 /101 variables (removed 11) and now considering 108/130 (removed 22) transitions.
// Phase 1: matrix 108 rows 90 cols
[2025-05-30 17:15:06] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:06] [INFO ] Implicit Places using invariants in 66 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/101 places, 108/130 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 107
Applied a total of 2 rules in 2 ms. Remains 88 /89 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 88 cols
[2025-05-30 17:15:06] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:06] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-05-30 17:15:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:06] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:15:06] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/101 places, 107/130 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 318 ms. Remains : 88/101 places, 107/130 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, p0, p0, p0]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-12 finished in 445 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((G(F(p0)) U p1))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 91 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 91 transition count 110
Applied a total of 20 rules in 1 ms. Remains 91 /101 variables (removed 10) and now considering 110/130 (removed 20) transitions.
// Phase 1: matrix 110 rows 91 cols
[2025-05-30 17:15:07] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:07] [INFO ] Implicit Places using invariants in 99 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/101 places, 110/130 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 109
Applied a total of 2 rules in 1 ms. Remains 89 /90 variables (removed 1) and now considering 109/110 (removed 1) transitions.
// Phase 1: matrix 109 rows 89 cols
[2025-05-30 17:15:07] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:07] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-30 17:15:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:07] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:15:07] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 89/101 places, 109/130 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 339 ms. Remains : 89/101 places, 109/130 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-13
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-13 finished in 550 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((X(G((p0||F(p1))))&&(p2||X(!p2)))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 130/130 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 101 transition count 101
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 72 transition count 101
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 58 place count 72 transition count 97
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 68 transition count 97
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 77 place count 57 transition count 75
Iterating global reduction 2 with 11 rules applied. Total rules applied 88 place count 57 transition count 75
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 92 place count 57 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 96 place count 53 transition count 71
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 104 place count 49 transition count 67
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 114 place count 44 transition count 76
Applied a total of 114 rules in 10 ms. Remains 44 /101 variables (removed 57) and now considering 76/130 (removed 54) transitions.
// Phase 1: matrix 76 rows 44 cols
[2025-05-30 17:15:07] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:07] [INFO ] Implicit Places using invariants in 78 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/101 places, 76/130 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 41 transition count 74
Applied a total of 4 rules in 4 ms. Remains 41 /43 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 41 cols
[2025-05-30 17:15:07] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-30 17:15:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:15:07] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-30 17:15:07] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/101 places, 74/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 303 ms. Remains : 41/101 places, 74/130 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-15
Stuttering criterion allowed to conclude after 41 steps with 1 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-15 finished in 497 ms.
All properties solved by simple procedures.
Total runtime 80152 ms.

BK_STOP 1748625308174

--------------------
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="CANConstruction-PT-005"
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 CANConstruction-PT-005, 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 r030-smll-174853813400164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-005.tgz
mv CANConstruction-PT-005 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;