Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898900235.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is FireWire-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898900235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 100K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-09-LTLCardinality-00
FORMULA_NAME FireWire-PT-09-LTLCardinality-01
FORMULA_NAME FireWire-PT-09-LTLCardinality-02
FORMULA_NAME FireWire-PT-09-LTLCardinality-03
FORMULA_NAME FireWire-PT-09-LTLCardinality-04
FORMULA_NAME FireWire-PT-09-LTLCardinality-05
FORMULA_NAME FireWire-PT-09-LTLCardinality-06
FORMULA_NAME FireWire-PT-09-LTLCardinality-07
FORMULA_NAME FireWire-PT-09-LTLCardinality-08
FORMULA_NAME FireWire-PT-09-LTLCardinality-09
FORMULA_NAME FireWire-PT-09-LTLCardinality-10
FORMULA_NAME FireWire-PT-09-LTLCardinality-11
FORMULA_NAME FireWire-PT-09-LTLCardinality-12
FORMULA_NAME FireWire-PT-09-LTLCardinality-13
FORMULA_NAME FireWire-PT-09-LTLCardinality-14
FORMULA_NAME FireWire-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717361823033

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 20:57:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:57:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:57:04] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-06-02 20:57:04] [INFO ] Transformed 130 places.
[2024-06-02 20:57:04] [INFO ] Transformed 408 transitions.
[2024-06-02 20:57:04] [INFO ] Found NUPN structural information;
[2024-06-02 20:57:04] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA FireWire-PT-09-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 352/352 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 344
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 344
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 126 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 125 transition count 338
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 125 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 124 transition count 336
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 124 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 123 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 123 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 122 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 122 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 122 transition count 325
Applied a total of 25 rules in 53 ms. Remains 122 /130 variables (removed 8) and now considering 325/352 (removed 27) transitions.
[2024-06-02 20:57:04] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
// Phase 1: matrix 299 rows 122 cols
[2024-06-02 20:57:04] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 20:57:04] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-02 20:57:04] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
[2024-06-02 20:57:04] [INFO ] Invariant cache hit.
[2024-06-02 20:57:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:57:05] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 471 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/130 places, 325/352 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 542 ms. Remains : 120/130 places, 325/352 transitions.
Support contains 13 out of 120 places after structural reductions.
[2024-06-02 20:57:05] [INFO ] Flatten gal took : 49 ms
[2024-06-02 20:57:05] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:57:05] [INFO ] Input system was already deterministic with 325 transitions.
RANDOM walk for 40000 steps (2213 resets) in 1818 ms. (21 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (609 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (551 resets) in 104 ms. (380 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (571 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
[2024-06-02 20:57:06] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
// Phase 1: matrix 299 rows 120 cols
[2024-06-02 20:57:06] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 20:57:06] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/96 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/116 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 298/414 variables, 116/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 42/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/418 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/419 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/419 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 169 constraints, problems are : Problem set: 0 solved, 2 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 90/96 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/116 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-02 20:57:06] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 7 ms to minimize.
[2024-06-02 20:57:06] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 298/414 variables, 116/124 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 42/166 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/418 variables, 4/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 1/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-02 20:57:06] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/419 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/419 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 173 constraints, problems are : Problem set: 1 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 803ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 325/325 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 112 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 112 transition count 303
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 1 with 2 rules applied. Total rules applied 21 place count 111 transition count 302
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 109 transition count 306
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 29 place count 109 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 109 transition count 300
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 109 transition count 300
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 39 place count 106 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 106 transition count 296
Applied a total of 41 rules in 97 ms. Remains 106 /120 variables (removed 14) and now considering 296/325 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 106/120 places, 296/325 transitions.
RANDOM walk for 40000 steps (2136 resets) in 567 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (592 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21471 steps, run visited all 1 properties in 89 ms. (steps per millisecond=241 )
Probabilistic random walk after 21471 steps, saw 6643 distinct states, run finished after 93 ms. (steps per millisecond=230 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
Computed a total of 17 stabilizing places and 35 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 325/325 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 118 transition count 323
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
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 6 place count 116 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 116 transition count 323
Applied a total of 10 rules in 26 ms. Remains 116 /120 variables (removed 4) and now considering 323/325 (removed 2) transitions.
[2024-06-02 20:57:07] [INFO ] Flow matrix only has 293 transitions (discarded 30 similar events)
// Phase 1: matrix 293 rows 116 cols
[2024-06-02 20:57:07] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 20:57:07] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:57:07] [INFO ] Flow matrix only has 293 transitions (discarded 30 similar events)
[2024-06-02 20:57:07] [INFO ] Invariant cache hit.
[2024-06-02 20:57:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:57:07] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-06-02 20:57:07] [INFO ] Redundant transitions in 17 ms returned []
Running 320 sub problems to find dead transitions.
[2024-06-02 20:57:07] [INFO ] Flow matrix only has 293 transitions (discarded 30 similar events)
[2024-06-02 20:57:07] [INFO ] Invariant cache hit.
[2024-06-02 20:57:07] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 20:57:09] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:57:09] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:57:09] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:57:09] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:57:09] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 20:57:10] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-02 20:57:10] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 292/407 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 43/171 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 1/408 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/409 variables, and 172 constraints, problems are : Problem set: 0 solved, 320 unsolved in 13749 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 292/407 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 43/171 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 320/491 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 20:57:25] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:57:27] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 20:57:32] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (OVERLAPS) 1/408 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (OVERLAPS) 0/408 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/409 variables, and 495 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 10/10 constraints]
After SMT, in 44105ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 44111ms
Starting structural reductions in SI_LTL mode, iteration 1 : 116/120 places, 323/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44434 ms. Remains : 116/120 places, 323/325 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-09-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLCardinality-07 finished in 44696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&G(p1))))'
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 325/325 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 119 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 118 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 117 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 116 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 115 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 114 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 113 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 112 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 112 transition count 306
Applied a total of 16 rules in 15 ms. Remains 112 /120 variables (removed 8) and now considering 306/325 (removed 19) transitions.
[2024-06-02 20:57:52] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 112 cols
[2024-06-02 20:57:52] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 20:57:52] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:57:52] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 20:57:52] [INFO ] Invariant cache hit.
[2024-06-02 20:57:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:57:52] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-06-02 20:57:52] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 20:57:52] [INFO ] Invariant cache hit.
[2024-06-02 20:57:52] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 20:57:53] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:57:54] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:57:54] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:57:54] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 11200 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 20:58:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:58:07] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:58:09] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 470 constraints, problems are : Problem set: 0 solved, 305 unsolved in 27227 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 7/7 constraints]
After SMT, in 38609ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 38614ms
Starting structural reductions in LTL mode, iteration 1 : 112/120 places, 306/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38855 ms. Remains : 112/120 places, 306/325 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 105 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 23067 steps (1228 resets) in 203 ms. (113 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 6 factoid took 114 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-09-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-09-LTLCardinality-09 finished in 39854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(X(F(p1)))))))'
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 325/325 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 119 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 118 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 117 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 116 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 115 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 114 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 113 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 112 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 112 transition count 306
Applied a total of 16 rules in 11 ms. Remains 112 /120 variables (removed 8) and now considering 306/325 (removed 19) transitions.
[2024-06-02 20:58:31] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 20:58:31] [INFO ] Invariant cache hit.
[2024-06-02 20:58:32] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:58:32] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 20:58:32] [INFO ] Invariant cache hit.
[2024-06-02 20:58:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:58:32] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-06-02 20:58:32] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 20:58:32] [INFO ] Invariant cache hit.
[2024-06-02 20:58:32] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 20:58:33] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 8 ms to minimize.
[2024-06-02 20:58:33] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-02 20:58:34] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:58:34] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 11337 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 20:58:47] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:58:47] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:58:49] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 470 constraints, problems are : Problem set: 0 solved, 305 unsolved in 27363 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 7/7 constraints]
After SMT, in 38904ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 38908ms
Starting structural reductions in LTL mode, iteration 1 : 112/120 places, 306/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39150 ms. Remains : 112/120 places, 306/325 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-09-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLCardinality-10 finished in 39447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 325/325 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 117 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 117 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 116 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 116 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 115 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 115 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 114 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 114 transition count 311
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 12 place count 113 transition count 310
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 110 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 110 transition count 310
Applied a total of 24 rules in 43 ms. Remains 110 /120 variables (removed 10) and now considering 310/325 (removed 15) transitions.
[2024-06-02 20:59:11] [INFO ] Flow matrix only has 277 transitions (discarded 33 similar events)
// Phase 1: matrix 277 rows 110 cols
[2024-06-02 20:59:11] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 20:59:11] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:59:11] [INFO ] Flow matrix only has 277 transitions (discarded 33 similar events)
[2024-06-02 20:59:11] [INFO ] Invariant cache hit.
[2024-06-02 20:59:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:59:11] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-02 20:59:11] [INFO ] Redundant transitions in 5 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-02 20:59:11] [INFO ] Flow matrix only has 277 transitions (discarded 33 similar events)
[2024-06-02 20:59:11] [INFO ] Invariant cache hit.
[2024-06-02 20:59:11] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:59:12] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:59:12] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:59:12] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:59:12] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-02 20:59:12] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 276/385 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 40/160 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 1/386 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:59:19] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/387 variables, and 162 constraints, problems are : Problem set: 0 solved, 307 unsolved in 13168 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 276/385 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 40/161 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 307/468 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:59:29] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:59:41] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:59:44] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/387 variables, and 472 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 9/9 constraints]
After SMT, in 43375ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 43379ms
Starting structural reductions in SI_LTL mode, iteration 1 : 110/120 places, 310/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43643 ms. Remains : 110/120 places, 310/325 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-11
Product exploration explored 100000 steps with 1 reset in 145 ms.
Product exploration explored 100000 steps with 0 reset in 96 ms.
Computed a total of 10 stabilizing places and 20 stable transitions
Computed a total of 10 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 25111 steps (1444 resets) in 49 ms. (502 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 310/310 transitions.
Applied a total of 0 rules in 12 ms. Remains 110 /110 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2024-06-02 20:59:55] [INFO ] Flow matrix only has 277 transitions (discarded 33 similar events)
[2024-06-02 20:59:55] [INFO ] Invariant cache hit.
[2024-06-02 20:59:55] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:59:55] [INFO ] Flow matrix only has 277 transitions (discarded 33 similar events)
[2024-06-02 20:59:55] [INFO ] Invariant cache hit.
[2024-06-02 20:59:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:59:56] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-06-02 20:59:56] [INFO ] Redundant transitions in 6 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-02 20:59:56] [INFO ] Flow matrix only has 277 transitions (discarded 33 similar events)
[2024-06-02 20:59:56] [INFO ] Invariant cache hit.
[2024-06-02 20:59:56] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 20:59:57] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:59:57] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:59:57] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:59:57] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 2 ms to minimize.
[2024-06-02 20:59:57] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 276/385 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 40/160 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 1/386 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 21:00:04] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/387 variables, and 162 constraints, problems are : Problem set: 0 solved, 307 unsolved in 13512 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 276/385 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 40/161 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 307/468 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 21:00:14] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 21:00:25] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 21:00:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/387 variables, and 472 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 9/9 constraints]
After SMT, in 43719ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 43723ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43971 ms. Remains : 110/110 places, 310/310 transitions.
Computed a total of 10 stabilizing places and 20 stable transitions
Computed a total of 10 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 31871 steps (1848 resets) in 62 ms. (505 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 53 ms.
Product exploration explored 100000 steps with 4 reset in 46 ms.
Built C files in :
/tmp/ltsmin8227256769637033169
[2024-06-02 21:00:40] [INFO ] Computing symmetric may disable matrix : 310 transitions.
[2024-06-02 21:00:40] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:00:40] [INFO ] Computing symmetric may enable matrix : 310 transitions.
[2024-06-02 21:00:40] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:00:40] [INFO ] Computing Do-Not-Accords matrix : 310 transitions.
[2024-06-02 21:00:40] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:00:40] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8227256769637033169
Running compilation step : cd /tmp/ltsmin8227256769637033169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 804 ms.
Running link step : cd /tmp/ltsmin8227256769637033169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin8227256769637033169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5623263236105881700.hoa' '--buchi-type=spotba'
LTSmin run took 1069 ms.
FORMULA FireWire-PT-09-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-09-LTLCardinality-11 finished in 91036 ms.
All properties solved by simple procedures.
Total runtime 218306 ms.

BK_STOP 1717362042534

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="FireWire-PT-09"
export BK_EXAMINATION="LTLCardinality"
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-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898900235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-09.tgz
mv FireWire-PT-09 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;