About the Execution of ITS-Tools for DoubleLock-PT-p2s1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.871 | 3391039.00 | 3659370.00 | 10731.50 | TFFFTFTTFFF?FFFF | normal |
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.r136-tall-171631133000611.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 DoubleLock-PT-p2s1, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631133000611
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 13:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 13:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 97K May 18 16:42 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 DoubleLock-PT-p2s1-LTLCardinality-00
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-01
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-02
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-03
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-04
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-05
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-06
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-07
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-08
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-09
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-10
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-11
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-12
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-13
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-14
FORMULA_NAME DoubleLock-PT-p2s1-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716408977220
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 20:16:18] [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-05-22 20:16:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 20:16:18] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-22 20:16:18] [INFO ] Transformed 64 places.
[2024-05-22 20:16:18] [INFO ] Transformed 212 transitions.
[2024-05-22 20:16:18] [INFO ] Parsed PT model containing 64 places and 212 transitions and 860 arcs in 160 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 2 formulas.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 8 transitions.
FORMULA DoubleLock-PT-p2s1-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s1-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s1-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s1-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 204/204 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 204
Applied a total of 1 rules in 15 ms. Remains 55 /56 variables (removed 1) and now considering 204/204 (removed 0) transitions.
[2024-05-22 20:16:18] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
// Phase 1: matrix 152 rows 55 cols
[2024-05-22 20:16:18] [INFO ] Computed 3 invariants in 13 ms
[2024-05-22 20:16:18] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 20:16:18] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2024-05-22 20:16:18] [INFO ] Invariant cache hit.
[2024-05-22 20:16:18] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-22 20:16:19] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-22 20:16:19] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2024-05-22 20:16:19] [INFO ] Invariant cache hit.
[2024-05-22 20:16:19] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 152/205 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 27/83 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-22 20:16:20] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 7 ms to minimize.
[2024-05-22 20:16:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 2/207 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 87 constraints, problems are : Problem set: 0 solved, 202 unsolved in 5231 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 152/205 variables, 53/58 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 27/85 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 2/207 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 190/289 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 289 constraints, problems are : Problem set: 0 solved, 202 unsolved in 6475 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 2/2 constraints]
After SMT, in 11921ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 11938ms
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 204/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12284 ms. Remains : 55/56 places, 204/204 transitions.
Support contains 26 out of 55 places after structural reductions.
[2024-05-22 20:16:31] [INFO ] Flatten gal took : 35 ms
[2024-05-22 20:16:31] [INFO ] Flatten gal took : 16 ms
[2024-05-22 20:16:31] [INFO ] Input system was already deterministic with 204 transitions.
Support contains 25 out of 55 places (down from 26) after GAL structural reductions.
RANDOM walk for 40000 steps (194 resets) in 992 ms. (40 steps per ms) remains 3/20 properties
BEST_FIRST walk for 40004 steps (35 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (34 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (83 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
[2024-05-22 20:16:31] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2024-05-22 20:16:31] [INFO ] Invariant cache hit.
[2024-05-22 20:16:31] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 29/207 variables, and 2 constraints, problems are : Problem set: 3 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/55 constraints, ReadFeed: 0/27 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA DoubleLock-PT-p2s1-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s1-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 24 stable transitions
Graph (complete) has 419 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
FORMULA DoubleLock-PT-p2s1-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1)||X((p0||X(F((p0&&F(p1)))))))))'
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 192
Applied a total of 9 rules in 11 ms. Remains 49 /55 variables (removed 6) and now considering 192/204 (removed 12) transitions.
[2024-05-22 20:16:32] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
// Phase 1: matrix 143 rows 49 cols
[2024-05-22 20:16:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 20:16:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 20:16:32] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2024-05-22 20:16:32] [INFO ] Invariant cache hit.
[2024-05-22 20:16:32] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 20:16:32] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-22 20:16:32] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2024-05-22 20:16:32] [INFO ] Invariant cache hit.
[2024-05-22 20:16:32] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 77 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2699 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 190/267 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 267 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4393 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7217ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7221ms
Starting structural reductions in LTL mode, iteration 1 : 49/55 places, 192/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7383 ms. Remains : 49/55 places, 192/204 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLCardinality-01
Stuttering criterion allowed to conclude after 100 steps with 5 reset in 4 ms.
FORMULA DoubleLock-PT-p2s1-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLCardinality-01 finished in 7656 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)))&&F(p1)))'
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 204
Applied a total of 2 rules in 4 ms. Remains 53 /55 variables (removed 2) and now considering 204/204 (removed 0) transitions.
[2024-05-22 20:16:39] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
// Phase 1: matrix 152 rows 53 cols
[2024-05-22 20:16:39] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 20:16:39] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 20:16:39] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2024-05-22 20:16:39] [INFO ] Invariant cache hit.
[2024-05-22 20:16:39] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-22 20:16:39] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-22 20:16:39] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2024-05-22 20:16:39] [INFO ] Invariant cache hit.
[2024-05-22 20:16:39] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 152/204 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 27/81 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 82 constraints, problems are : Problem set: 0 solved, 202 unsolved in 3782 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 152/204 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 27/81 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 190/284 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/205 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 284 constraints, problems are : Problem set: 0 solved, 202 unsolved in 5052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 8952ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 8955ms
Starting structural reductions in LTL mode, iteration 1 : 53/55 places, 204/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9087 ms. Remains : 53/55 places, 204/204 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p2s1-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLCardinality-05 finished in 9309 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(F(p0)))'
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 52 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 52 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 51 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 51 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 50 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 50 transition count 192
Applied a total of 8 rules in 9 ms. Remains 50 /55 variables (removed 5) and now considering 192/204 (removed 12) transitions.
[2024-05-22 20:16:48] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
// Phase 1: matrix 143 rows 50 cols
[2024-05-22 20:16:48] [INFO ] Computed 3 invariants in 2 ms
[2024-05-22 20:16:48] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 20:16:48] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2024-05-22 20:16:48] [INFO ] Invariant cache hit.
[2024-05-22 20:16:49] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 20:16:49] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-22 20:16:49] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2024-05-22 20:16:49] [INFO ] Invariant cache hit.
[2024-05-22 20:16:49] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 143/193 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 26/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 79 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 143/193 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 26/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 190/269 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 269 constraints, problems are : Problem set: 0 solved, 190 unsolved in 5473 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7885ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7887ms
Starting structural reductions in LTL mode, iteration 1 : 50/55 places, 192/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8027 ms. Remains : 50/55 places, 192/204 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 4 stabilizing places and 24 stable transitions
Graph (complete) has 383 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p2s1-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p2s1-LTLCardinality-06 finished in 8446 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(F((p0||X(F(p1))))))'
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 204
Applied a total of 2 rules in 2 ms. Remains 53 /55 variables (removed 2) and now considering 204/204 (removed 0) transitions.
[2024-05-22 20:16:57] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
// Phase 1: matrix 152 rows 53 cols
[2024-05-22 20:16:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 20:16:57] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 20:16:57] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2024-05-22 20:16:57] [INFO ] Invariant cache hit.
[2024-05-22 20:16:57] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-22 20:16:57] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-22 20:16:57] [INFO ] Flow matrix only has 152 transitions (discarded 52 similar events)
[2024-05-22 20:16:57] [INFO ] Invariant cache hit.
[2024-05-22 20:16:57] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 152/204 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 27/81 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 1/205 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 82 constraints, problems are : Problem set: 0 solved, 202 unsolved in 3265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 152/204 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 27/81 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 1/205 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 190/284 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/205 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 284 constraints, problems are : Problem set: 0 solved, 202 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 8419ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 8421ms
Starting structural reductions in LTL mode, iteration 1 : 53/55 places, 204/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8545 ms. Remains : 53/55 places, 204/204 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Computed a total of 4 stabilizing places and 24 stable transitions
Graph (complete) has 409 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p2s1-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p2s1-LTLCardinality-07 finished in 8877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 192
Applied a total of 9 rules in 10 ms. Remains 49 /55 variables (removed 6) and now considering 192/204 (removed 12) transitions.
[2024-05-22 20:17:06] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
// Phase 1: matrix 143 rows 49 cols
[2024-05-22 20:17:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 20:17:06] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 20:17:06] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2024-05-22 20:17:06] [INFO ] Invariant cache hit.
[2024-05-22 20:17:06] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 20:17:06] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-22 20:17:06] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2024-05-22 20:17:06] [INFO ] Invariant cache hit.
[2024-05-22 20:17:06] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 77 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2735 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 190/267 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 267 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4599 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7436ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7438ms
Starting structural reductions in LTL mode, iteration 1 : 49/55 places, 192/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7569 ms. Remains : 49/55 places, 192/204 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p2s1-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLCardinality-10 finished in 7788 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 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Graph (complete) has 419 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 51 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 200
Applied a total of 3 rules in 17 ms. Remains 51 /55 variables (removed 4) and now considering 200/204 (removed 4) transitions.
[2024-05-22 20:17:14] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
// Phase 1: matrix 148 rows 51 cols
[2024-05-22 20:17:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 20:17:14] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 20:17:14] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
[2024-05-22 20:17:14] [INFO ] Invariant cache hit.
[2024-05-22 20:17:14] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-22 20:17:14] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-22 20:17:14] [INFO ] Redundant transitions in 6 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-22 20:17:14] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
[2024-05-22 20:17:14] [INFO ] Invariant cache hit.
[2024-05-22 20:17:14] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 27/80 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 80 constraints, problems are : Problem set: 0 solved, 198 unsolved in 3072 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 27/80 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 198/278 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 278 constraints, problems are : Problem set: 0 solved, 198 unsolved in 5331 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 8509ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 8511ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/55 places, 200/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8665 ms. Remains : 51/55 places, 200/204 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLCardinality-11
Product exploration explored 100000 steps with 1028 reset in 194 ms.
Product exploration explored 100000 steps with 1005 reset in 194 ms.
Computed a total of 4 stabilizing places and 24 stable transitions
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 509 steps (0 resets) in 6 ms. (72 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 89 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 200/200 transitions.
Applied a total of 0 rules in 12 ms. Remains 51 /51 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-22 20:17:23] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
[2024-05-22 20:17:23] [INFO ] Invariant cache hit.
[2024-05-22 20:17:23] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 20:17:23] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
[2024-05-22 20:17:23] [INFO ] Invariant cache hit.
[2024-05-22 20:17:23] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-22 20:17:23] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-22 20:17:23] [INFO ] Redundant transitions in 7 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-22 20:17:23] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
[2024-05-22 20:17:23] [INFO ] Invariant cache hit.
[2024-05-22 20:17:23] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 27/80 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 80 constraints, problems are : Problem set: 0 solved, 198 unsolved in 2957 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 27/80 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 198/278 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 278 constraints, problems are : Problem set: 0 solved, 198 unsolved in 5278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 8356ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 8359ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8503 ms. Remains : 51/51 places, 200/200 transitions.
Computed a total of 4 stabilizing places and 24 stable transitions
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 469 steps (1 resets) in 5 ms. (78 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 109 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 991 reset in 162 ms.
Product exploration explored 100000 steps with 1004 reset in 177 ms.
Built C files in :
/tmp/ltsmin14441589026612475831
[2024-05-22 20:17:32] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2024-05-22 20:17:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:17:32] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2024-05-22 20:17:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:17:32] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2024-05-22 20:17:32] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:17:32] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14441589026612475831
Running compilation step : cd /tmp/ltsmin14441589026612475831;'/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 669 ms.
Running link step : cd /tmp/ltsmin14441589026612475831;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14441589026612475831;'/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/stateBased489786081675508168.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 200/200 transitions.
Applied a total of 0 rules in 15 ms. Remains 51 /51 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-22 20:17:48] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
[2024-05-22 20:17:48] [INFO ] Invariant cache hit.
[2024-05-22 20:17:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 20:17:48] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
[2024-05-22 20:17:48] [INFO ] Invariant cache hit.
[2024-05-22 20:17:48] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-22 20:17:48] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-22 20:17:48] [INFO ] Redundant transitions in 3 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-22 20:17:48] [INFO ] Flow matrix only has 148 transitions (discarded 52 similar events)
[2024-05-22 20:17:48] [INFO ] Invariant cache hit.
[2024-05-22 20:17:48] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 27/80 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 80 constraints, problems are : Problem set: 0 solved, 198 unsolved in 2977 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 27/80 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 198/278 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 278 constraints, problems are : Problem set: 0 solved, 198 unsolved in 5295 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 8390ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 8393ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8541 ms. Remains : 51/51 places, 200/200 transitions.
Built C files in :
/tmp/ltsmin12858244730704255637
[2024-05-22 20:17:56] [INFO ] Computing symmetric may disable matrix : 200 transitions.
[2024-05-22 20:17:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:17:56] [INFO ] Computing symmetric may enable matrix : 200 transitions.
[2024-05-22 20:17:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:17:56] [INFO ] Computing Do-Not-Accords matrix : 200 transitions.
[2024-05-22 20:17:56] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:17:56] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12858244730704255637
Running compilation step : cd /tmp/ltsmin12858244730704255637;'/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 423 ms.
Running link step : cd /tmp/ltsmin12858244730704255637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12858244730704255637;'/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/stateBased1955084613552386983.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 20:18:11] [INFO ] Flatten gal took : 11 ms
[2024-05-22 20:18:11] [INFO ] Flatten gal took : 11 ms
[2024-05-22 20:18:11] [INFO ] Time to serialize gal into /tmp/LTL7903437496398670450.gal : 4 ms
[2024-05-22 20:18:11] [INFO ] Time to serialize properties into /tmp/LTL16968962169043332443.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7903437496398670450.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18154312505815748716.hoa' '-atoms' '/tmp/LTL16968962169043332443.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16968962169043332443.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18154312505815748716.hoa
Detected timeout of ITS tools.
[2024-05-22 20:18:26] [INFO ] Flatten gal took : 9 ms
[2024-05-22 20:18:26] [INFO ] Flatten gal took : 9 ms
[2024-05-22 20:18:26] [INFO ] Time to serialize gal into /tmp/LTL8031303748404159119.gal : 2 ms
[2024-05-22 20:18:26] [INFO ] Time to serialize properties into /tmp/LTL11826479992326412987.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8031303748404159119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11826479992326412987.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(l40<=l35)"))))
Formula 0 simplified : FG!"(l40<=l35)"
Detected timeout of ITS tools.
[2024-05-22 20:18:41] [INFO ] Flatten gal took : 13 ms
[2024-05-22 20:18:41] [INFO ] Applying decomposition
[2024-05-22 20:18:41] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5469011165863363407.txt' '-o' '/tmp/graph5469011165863363407.bin' '-w' '/tmp/graph5469011165863363407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5469011165863363407.bin' '-l' '-1' '-v' '-w' '/tmp/graph5469011165863363407.weights' '-q' '0' '-e' '0.001'
[2024-05-22 20:18:41] [INFO ] Decomposing Gal with order
[2024-05-22 20:18:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 20:18:42] [INFO ] Removed a total of 411 redundant transitions.
[2024-05-22 20:18:42] [INFO ] Flatten gal took : 46 ms
[2024-05-22 20:18:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2024-05-22 20:18:42] [INFO ] Time to serialize gal into /tmp/LTL10692623316216423122.gal : 3 ms
[2024-05-22 20:18:42] [INFO ] Time to serialize properties into /tmp/LTL16156686230096419567.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10692623316216423122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16156686230096419567.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu17.l40<=gu17.l35)"))))
Formula 0 simplified : FG!"(gu17.l40<=gu17.l35)"
Detected timeout of ITS tools.
Treatment of property DoubleLock-PT-p2s1-LTLCardinality-11 finished in 103085 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' '!(F(G(((p0||G(!p0))&&(p0||X(X(p1)))))))'
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Graph (complete) has 419 edges and 55 vertex of which 53 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 52 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 52 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 51 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 51 transition count 196
Applied a total of 5 rules in 10 ms. Remains 51 /55 variables (removed 4) and now considering 196/204 (removed 8) transitions.
[2024-05-22 20:18:57] [INFO ] Flow matrix only has 147 transitions (discarded 49 similar events)
// Phase 1: matrix 147 rows 51 cols
[2024-05-22 20:18:57] [INFO ] Computed 3 invariants in 2 ms
[2024-05-22 20:18:57] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 20:18:57] [INFO ] Flow matrix only has 147 transitions (discarded 49 similar events)
[2024-05-22 20:18:57] [INFO ] Invariant cache hit.
[2024-05-22 20:18:57] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 20:18:57] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-22 20:18:57] [INFO ] Redundant transitions in 1 ms returned []
Running 194 sub problems to find dead transitions.
[2024-05-22 20:18:57] [INFO ] Flow matrix only has 147 transitions (discarded 49 similar events)
[2024-05-22 20:18:57] [INFO ] Invariant cache hit.
[2024-05-22 20:18:57] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 147/198 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 26/80 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 80 constraints, problems are : Problem set: 0 solved, 194 unsolved in 2850 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 51/51 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 147/198 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 26/80 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 194/274 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 274 constraints, problems are : Problem set: 0 solved, 194 unsolved in 4055 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 51/51 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 7032ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 7035ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/55 places, 196/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7191 ms. Remains : 51/55 places, 196/204 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLCardinality-12
Product exploration explored 100000 steps with 689 reset in 273 ms.
Product exploration explored 100000 steps with 700 reset in 244 ms.
Computed a total of 4 stabilizing places and 24 stable transitions
Graph (complete) has 392 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 960 steps (2 resets) in 23 ms. (40 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 235 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-22 20:19:05] [INFO ] Flow matrix only has 147 transitions (discarded 49 similar events)
[2024-05-22 20:19:05] [INFO ] Invariant cache hit.
[2024-05-22 20:19:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1)))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 9 factoid took 214 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p2s1-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p2s1-LTLCardinality-12 finished in 8746 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' '!(F(G(p0)))'
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Graph (complete) has 419 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 51 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 50 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 49 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 49 transition count 192
Applied a total of 7 rules in 19 ms. Remains 49 /55 variables (removed 6) and now considering 192/204 (removed 12) transitions.
[2024-05-22 20:19:05] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
// Phase 1: matrix 143 rows 49 cols
[2024-05-22 20:19:05] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 20:19:05] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 20:19:05] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2024-05-22 20:19:05] [INFO ] Invariant cache hit.
[2024-05-22 20:19:06] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 20:19:06] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-22 20:19:06] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-22 20:19:06] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2024-05-22 20:19:06] [INFO ] Invariant cache hit.
[2024-05-22 20:19:06] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 77 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2660 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 190/267 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 267 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7207ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7212ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/55 places, 192/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7372 ms. Remains : 49/55 places, 192/204 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLCardinality-13
Stuttering criterion allowed to conclude after 322 steps with 0 reset in 7 ms.
FORMULA DoubleLock-PT-p2s1-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLCardinality-13 finished in 7429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 204/204 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 192
Applied a total of 9 rules in 4 ms. Remains 49 /55 variables (removed 6) and now considering 192/204 (removed 12) transitions.
[2024-05-22 20:19:13] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2024-05-22 20:19:13] [INFO ] Invariant cache hit.
[2024-05-22 20:19:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 20:19:13] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2024-05-22 20:19:13] [INFO ] Invariant cache hit.
[2024-05-22 20:19:13] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 20:19:13] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-22 20:19:13] [INFO ] Flow matrix only has 143 transitions (discarded 49 similar events)
[2024-05-22 20:19:13] [INFO ] Invariant cache hit.
[2024-05-22 20:19:13] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 77 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2777 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 143/192 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 190/267 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 267 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4400 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7271ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7275ms
Starting structural reductions in LTL mode, iteration 1 : 49/55 places, 192/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7398 ms. Remains : 49/55 places, 192/204 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s1-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p2s1-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s1-LTLCardinality-14 finished in 7490 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)))'
[2024-05-22 20:19:20] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6707148740524134961
[2024-05-22 20:19:20] [INFO ] Computing symmetric may disable matrix : 204 transitions.
[2024-05-22 20:19:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:19:20] [INFO ] Computing symmetric may enable matrix : 204 transitions.
[2024-05-22 20:19:20] [INFO ] Applying decomposition
[2024-05-22 20:19:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:19:21] [INFO ] Computing Do-Not-Accords matrix : 204 transitions.
[2024-05-22 20:19:21] [INFO ] Flatten gal took : 10 ms
[2024-05-22 20:19:21] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:19:21] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6707148740524134961
Running compilation step : cd /tmp/ltsmin6707148740524134961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14961415600169280813.txt' '-o' '/tmp/graph14961415600169280813.bin' '-w' '/tmp/graph14961415600169280813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14961415600169280813.bin' '-l' '-1' '-v' '-w' '/tmp/graph14961415600169280813.weights' '-q' '0' '-e' '0.001'
[2024-05-22 20:19:21] [INFO ] Decomposing Gal with order
[2024-05-22 20:19:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 20:19:21] [INFO ] Removed a total of 419 redundant transitions.
[2024-05-22 20:19:21] [INFO ] Flatten gal took : 21 ms
[2024-05-22 20:19:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-05-22 20:19:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality13340408162368587333.gal : 2 ms
[2024-05-22 20:19:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality6779104677241102931.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13340408162368587333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6779104677241102931.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu16.l40<=gu16.l35)"))))
Formula 0 simplified : FG!"(gu16.l40<=gu16.l35)"
Compilation finished in 435 ms.
Running link step : cd /tmp/ltsmin6707148740524134961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6707148740524134961;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Initializing POR dependencies: labels 205, guards 204
pins2lts-mc-linux64( 7/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.107: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.107: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.107: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.205: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.208: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.217: There are 207 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.217: State length is 56, there are 207 groups
pins2lts-mc-linux64( 0/ 8), 0.217: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.217: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.217: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.217: Visible groups: 0 / 207, labels: 1 / 207
pins2lts-mc-linux64( 0/ 8), 0.217: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.217: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.260: [Blue] ~118 levels ~960 states ~3408 transitions
pins2lts-mc-linux64( 3/ 8), 0.291: [Blue] ~240 levels ~1920 states ~6576 transitions
pins2lts-mc-linux64( 1/ 8), 0.346: [Blue] ~477 levels ~3840 states ~14168 transitions
pins2lts-mc-linux64( 3/ 8), 0.445: [Blue] ~960 levels ~7680 states ~25776 transitions
pins2lts-mc-linux64( 4/ 8), 0.579: [Blue] ~1901 levels ~15360 states ~38080 transitions
pins2lts-mc-linux64( 4/ 8), 0.746: [Blue] ~3811 levels ~30720 states ~74176 transitions
pins2lts-mc-linux64( 4/ 8), 1.077: [Blue] ~7630 levels ~61440 states ~146536 transitions
pins2lts-mc-linux64( 4/ 8), 1.580: [Blue] ~15268 levels ~122880 states ~291216 transitions
pins2lts-mc-linux64( 4/ 8), 2.377: [Blue] ~30544 levels ~245760 states ~580632 transitions
pins2lts-mc-linux64( 4/ 8), 3.545: [Blue] ~61096 levels ~491520 states ~1159456 transitions
pins2lts-mc-linux64( 4/ 8), 5.664: [Blue] ~122201 levels ~983040 states ~2317176 transitions
pins2lts-mc-linux64( 4/ 8), 9.819: [Blue] ~244409 levels ~1966080 states ~4632312 transitions
pins2lts-mc-linux64( 4/ 8), 18.021: [Blue] ~488826 levels ~3932160 states ~9262816 transitions
pins2lts-mc-linux64( 2/ 8), 35.145: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 35.226:
pins2lts-mc-linux64( 0/ 8), 35.226: Explored 5517540 states 20010534 transitions, fanout: 3.627
pins2lts-mc-linux64( 0/ 8), 35.226: Total exploration time 35.000 sec (34.910 sec minimum, 34.938 sec on average)
pins2lts-mc-linux64( 0/ 8), 35.226: States per second: 157644, Transitions per second: 571730
pins2lts-mc-linux64( 0/ 8), 35.226:
pins2lts-mc-linux64( 0/ 8), 35.226: State space has 19596194 states, 25255 are accepting
pins2lts-mc-linux64( 0/ 8), 35.226: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 35.226: blue states: 5517540 (28.16%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 35.226: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 35.226: all-red states: 25255 (0.13%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 35.226:
pins2lts-mc-linux64( 0/ 8), 35.226: Total memory used for local state coloring: 83.1MB
pins2lts-mc-linux64( 0/ 8), 35.226:
pins2lts-mc-linux64( 0/ 8), 35.226: Queue width: 8B, total height: 5444304, memory: 41.54MB
pins2lts-mc-linux64( 0/ 8), 35.226: Tree memory: 405.5MB, 21.7 B/state, compr.: 9.6%
pins2lts-mc-linux64( 0/ 8), 35.226: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 35.226: Stored 204 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 35.226: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 35.226: Est. total memory use: 447.0MB (~1065.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6707148740524134961;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6707148740524134961;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-22 20:35:27] [INFO ] Flatten gal took : 11 ms
[2024-05-22 20:35:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality17179404401100048492.gal : 2 ms
[2024-05-22 20:35:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality5888930719984947029.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17179404401100048492.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5888930719984947029.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F("(l40<=l35)"))))
Formula 0 simplified : FG!"(l40<=l35)"
ITS-tools command line returned an error code 137
[2024-05-22 20:51:47] [INFO ] Flatten gal took : 20 ms
[2024-05-22 20:51:47] [INFO ] Input system was already deterministic with 204 transitions.
[2024-05-22 20:51:47] [INFO ] Transformed 55 places.
[2024-05-22 20:51:47] [INFO ] Transformed 204 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 20:51:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality9753875042976994623.gal : 2 ms
[2024-05-22 20:51:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality668941624689772787.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9753875042976994623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality668941624689772787.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(l40<=l35)"))))
Formula 0 simplified : FG!"(l40<=l35)"
Detected timeout of ITS tools.
Total runtime 3389897 ms.
BK_STOP 1716412368259
--------------------
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="DoubleLock-PT-p2s1"
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 DoubleLock-PT-p2s1, 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 r136-tall-171631133000611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s1.tgz
mv DoubleLock-PT-p2s1 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;