MCC'2024- Execution of r512-smll-171654407000155

About the Execution of LTSMin+red for PermAdmissibility-PT-01

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1606.399	795107.00	870663.00	1979.20	TTFTTFTFFFTFTFFF	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.r512-smll-171654407000155.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 ltsminxred
Input is PermAdmissibility-PT-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407000155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Apr 12 09:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 59K Apr 12 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 306K Apr 12 09:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 87K Apr 12 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 424K Apr 12 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 484K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717252487346

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:34:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:34:49] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-06-01 14:34:49] [INFO ] Transformed 168 places.
[2024-06-01 14:34:49] [INFO ] Transformed 592 transitions.
[2024-06-01 14:34:49] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 352 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA PermAdmissibility-PT-01-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 130 transition count 592
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 124 transition count 496
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 124 transition count 496
Applied a total of 50 rules in 82 ms. Remains 124 /168 variables (removed 44) and now considering 496/592 (removed 96) transitions.
// Phase 1: matrix 496 rows 124 cols
[2024-06-01 14:34:49] [INFO ] Computed 19 invariants in 38 ms
[2024-06-01 14:34:50] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-06-01 14:34:50] [INFO ] Invariant cache hit.
[2024-06-01 14:34:50] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
Running 492 sub problems to find dead transitions.
[2024-06-01 14:34:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 2 (OVERLAPS) 17/114 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 14:34:56] [INFO ] Deduced a trap composed of 22 places in 351 ms of which 73 ms to minimize.
[2024-06-01 14:34:56] [INFO ] Deduced a trap composed of 27 places in 252 ms of which 2 ms to minimize.
[2024-06-01 14:34:56] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:34:57] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 1 ms to minimize.
[2024-06-01 14:34:57] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 1 ms to minimize.
[2024-06-01 14:34:57] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:34:57] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:34:57] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:34:58] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:34:58] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:34:58] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:34:58] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 1 ms to minimize.
[2024-06-01 14:34:58] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 15 ms to minimize.
[2024-06-01 14:34:58] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
Problem TDEAD277 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 20/38 constraints. Problems are: Problem set: 1 solved, 491 unsolved
[2024-06-01 14:35:00] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
Problem TDEAD259 is UNSAT
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
Problem TDEAD267 is UNSAT
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 2 ms to minimize.
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD303 is UNSAT
[2024-06-01 14:35:02] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2024-06-01 14:35:02] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:35:02] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
Problem TDEAD319 is UNSAT
[2024-06-01 14:35:02] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 2 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
[2024-06-01 14:35:03] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD354 is UNSAT
[2024-06-01 14:35:03] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
Problem TDEAD364 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD380 is UNSAT
[2024-06-01 14:35:03] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD431 is UNSAT
[2024-06-01 14:35:03] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
Problem TDEAD440 is UNSAT
[2024-06-01 14:35:04] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
Problem TDEAD453 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD494 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 15/53 constraints. Problems are: Problem set: 32 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/53 constraints. Problems are: Problem set: 32 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 8/122 variables, 1/54 constraints. Problems are: Problem set: 32 solved, 460 unsolved
[2024-06-01 14:35:09] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:35:09] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:35:09] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:35:09] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 4/58 constraints. Problems are: Problem set: 32 solved, 460 unsolved
[2024-06-01 14:35:11] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/59 constraints. Problems are: Problem set: 32 solved, 460 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/59 constraints. Problems are: Problem set: 32 solved, 460 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD173 is UNSAT
At refinement iteration 10 (OVERLAPS) 496/618 variables, 122/181 constraints. Problems are: Problem set: 50 solved, 442 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/618 variables, 0/181 constraints. Problems are: Problem set: 50 solved, 442 unsolved
At refinement iteration 12 (OVERLAPS) 2/620 variables, 2/183 constraints. Problems are: Problem set: 50 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/620 variables, and 183 constraints, problems are : Problem set: 50 solved, 442 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 492/492 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 50 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 50 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 50 solved, 442 unsolved
At refinement iteration 2 (OVERLAPS) 17/114 variables, 11/18 constraints. Problems are: Problem set: 50 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 40/58 constraints. Problems are: Problem set: 50 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/58 constraints. Problems are: Problem set: 50 solved, 442 unsolved
At refinement iteration 5 (OVERLAPS) 8/122 variables, 1/59 constraints. Problems are: Problem set: 50 solved, 442 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/59 constraints. Problems are: Problem set: 50 solved, 442 unsolved
At refinement iteration 7 (OVERLAPS) 496/618 variables, 122/181 constraints. Problems are: Problem set: 50 solved, 442 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 300/481 constraints. Problems are: Problem set: 50 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/620 variables, and 481 constraints, problems are : Problem set: 50 solved, 442 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 122/124 constraints, PredecessorRefiner: 300/492 constraints, Known Traps: 40/40 constraints]
After SMT, in 61810ms problems are : Problem set: 50 solved, 442 unsolved
Search for dead transitions found 50 dead transitions in 61845ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 124/168 places, 446/592 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63183 ms. Remains : 124/168 places, 446/592 transitions.
Support contains 62 out of 124 places after structural reductions.
[2024-06-01 14:35:53] [INFO ] Flatten gal took : 114 ms
[2024-06-01 14:35:53] [INFO ] Flatten gal took : 64 ms
[2024-06-01 14:35:53] [INFO ] Input system was already deterministic with 446 transitions.
RANDOM walk for 40000 steps (2352 resets) in 2675 ms. (14 steps per ms) remains 6/21 properties
BEST_FIRST walk for 40003 steps (841 resets) in 293 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (839 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (840 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (840 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (840 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (839 resets) in 252 ms. (158 steps per ms) remains 6/6 properties
// Phase 1: matrix 446 rows 124 cols
[2024-06-01 14:35:54] [INFO ] Computed 19 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 116/570 variables, and 17 constraints, problems are : Problem set: 6 solved, 0 unsolved in 82 ms.
Refiners :[Generalized P Invariants (flows): 17/19 constraints, State Equation: 0/124 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA PermAdmissibility-PT-01-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 124 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 124 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 446/446 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 98 transition count 446
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 93 transition count 426
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 93 transition count 426
Applied a total of 36 rules in 19 ms. Remains 93 /124 variables (removed 31) and now considering 426/446 (removed 20) transitions.
// Phase 1: matrix 426 rows 93 cols
[2024-06-01 14:35:55] [INFO ] Computed 16 invariants in 6 ms
[2024-06-01 14:35:55] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 14:35:55] [INFO ] Invariant cache hit.
[2024-06-01 14:35:56] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2024-06-01 14:35:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 426/519 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 0/519 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 422 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 109 constraints, problems are : Problem set: 0 solved, 422 unsolved in 17296 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 426/519 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 422/531 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 531 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints]
After SMT, in 48289ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 48295ms
Starting structural reductions in LTL mode, iteration 1 : 93/124 places, 426/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49261 ms. Remains : 93/124 places, 426/446 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Computed a total of 93 stabilizing places and 426 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 93 transition count 426
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 52 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-01-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLCardinality-00 finished in 50398 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 8 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 446/446 transitions.
Graph (complete) has 1060 edges and 124 vertex of which 94 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.6 ms
Discarding 30 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Applied a total of 1 rules in 38 ms. Remains 94 /124 variables (removed 30) and now considering 416/446 (removed 30) transitions.
// Phase 1: matrix 416 rows 94 cols
[2024-06-01 14:36:45] [INFO ] Computed 15 invariants in 7 ms
[2024-06-01 14:36:45] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 14:36:45] [INFO ] Invariant cache hit.
[2024-06-01 14:36:46] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2024-06-01 14:36:46] [INFO ] Redundant transitions in 28 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-01 14:36:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 9/94 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:36:50] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:36:50] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 2 ms to minimize.
[2024-06-01 14:36:50] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 1 ms to minimize.
[2024-06-01 14:36:50] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:36:50] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:36:50] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:36:50] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2024-06-01 14:36:51] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:36:51] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2024-06-01 14:36:51] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2024-06-01 14:36:51] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:36:51] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2024-06-01 14:36:51] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2024-06-01 14:36:51] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 1 ms to minimize.
[2024-06-01 14:36:52] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:36:52] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 1 ms to minimize.
[2024-06-01 14:36:52] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 4 ms to minimize.
[2024-06-01 14:36:52] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2024-06-01 14:36:52] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2024-06-01 14:36:52] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:36:54] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:36:54] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2024-06-01 14:36:54] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2024-06-01 14:36:55] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:36:55] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2024-06-01 14:36:55] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2024-06-01 14:36:55] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 1 ms to minimize.
[2024-06-01 14:36:55] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:36:55] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:36:55] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:36:56] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2024-06-01 14:36:56] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 1 ms to minimize.
[2024-06-01 14:36:56] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2024-06-01 14:36:56] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:36:56] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2024-06-01 14:36:56] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2024-06-01 14:36:57] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2024-06-01 14:36:57] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2024-06-01 14:36:57] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:36:57] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2024-06-01 14:36:58] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:36:59] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2024-06-01 14:37:00] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-06-01 14:37:00] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2024-06-01 14:37:00] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:37:00] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:37:02] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:37:02] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2024-06-01 14:37:02] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:37:05] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:37:07] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:37:07] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-06-01 14:37:07] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2024-06-01 14:37:07] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 1 ms to minimize.
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:37:09] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:37:12] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2024-06-01 14:37:13] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:37:15] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 94/510 variables, and 86 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/94 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 9/94 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 71/86 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:37:20] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2024-06-01 14:37:20] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 416/510 variables, 94/182 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 412/594 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 594 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 73/73 constraints]
After SMT, in 60867ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60872ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/124 places, 416/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61659 ms. Remains : 94/124 places, 416/446 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-03
Product exploration explored 100000 steps with 6666 reset in 476 ms.
Product exploration explored 100000 steps with 6666 reset in 393 ms.
Computed a total of 94 stabilizing places and 416 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 416
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 56 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 116 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:37:48] [INFO ] Invariant cache hit.
[2024-06-01 14:37:48] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 10 ms returned sat
[2024-06-01 14:37:49] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-06-01 14:37:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:37:49] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 7 ms returned sat
[2024-06-01 14:37:49] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-06-01 14:37:49] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 384 transitions) in 81 ms.
[2024-06-01 14:37:49] [INFO ] Added : 9 causal constraints over 5 iterations in 266 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 416/416 transitions.
Applied a total of 0 rules in 24 ms. Remains 94 /94 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-06-01 14:37:49] [INFO ] Invariant cache hit.
[2024-06-01 14:37:50] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 14:37:50] [INFO ] Invariant cache hit.
[2024-06-01 14:37:50] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2024-06-01 14:37:50] [INFO ] Redundant transitions in 8 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-01 14:37:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 9/94 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:37:54] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2024-06-01 14:37:54] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 1 ms to minimize.
[2024-06-01 14:37:54] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 2 ms to minimize.
[2024-06-01 14:37:54] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:37:54] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 1 ms to minimize.
[2024-06-01 14:37:55] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 2 ms to minimize.
[2024-06-01 14:37:55] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:37:55] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2024-06-01 14:37:55] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2024-06-01 14:37:55] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2024-06-01 14:37:55] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2024-06-01 14:37:55] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 1 ms to minimize.
[2024-06-01 14:37:56] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2024-06-01 14:37:56] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 1 ms to minimize.
[2024-06-01 14:37:56] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2024-06-01 14:37:56] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2024-06-01 14:37:56] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 1 ms to minimize.
[2024-06-01 14:37:56] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:37:57] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2024-06-01 14:37:57] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:37:58] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2024-06-01 14:37:59] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2024-06-01 14:37:59] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2024-06-01 14:37:59] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 2 ms to minimize.
[2024-06-01 14:37:59] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2024-06-01 14:37:59] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 1 ms to minimize.
[2024-06-01 14:37:59] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2024-06-01 14:38:00] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2024-06-01 14:38:00] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2024-06-01 14:38:00] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:38:00] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2024-06-01 14:38:00] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2024-06-01 14:38:00] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 1 ms to minimize.
[2024-06-01 14:38:00] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2024-06-01 14:38:01] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:38:02] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:38:02] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:38:03] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:38:03] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 1 ms to minimize.
[2024-06-01 14:38:03] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:38:03] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:38:03] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2024-06-01 14:38:03] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:38:04] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2024-06-01 14:38:04] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-06-01 14:38:04] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:38:04] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2024-06-01 14:38:04] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2024-06-01 14:38:04] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:38:04] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:38:06] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:38:06] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:38:07] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:38:10] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:38:11] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:38:12] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:38:13] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
[2024-06-01 14:38:13] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:38:14] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:38:17] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2024-06-01 14:38:17] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:38:20] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 94/510 variables, and 86 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/94 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 9/94 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 71/86 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:38:24] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-06-01 14:38:24] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 416/510 variables, 94/182 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 412/594 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 594 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 73/73 constraints]
After SMT, in 60836ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60842ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61579 ms. Remains : 94/94 places, 416/416 transitions.
Computed a total of 94 stabilizing places and 416 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 416
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 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 56 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 120 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:38:51] [INFO ] Invariant cache hit.
[2024-06-01 14:38:52] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 10 ms returned sat
[2024-06-01 14:38:52] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-06-01 14:38:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:38:52] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 7 ms returned sat
[2024-06-01 14:38:52] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-06-01 14:38:52] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 384 transitions) in 67 ms.
[2024-06-01 14:38:52] [INFO ] Added : 9 causal constraints over 5 iterations in 219 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6666 reset in 306 ms.
Product exploration explored 100000 steps with 6666 reset in 311 ms.
Support contains 8 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 416/416 transitions.
Applied a total of 0 rules in 16 ms. Remains 94 /94 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-06-01 14:38:53] [INFO ] Invariant cache hit.
[2024-06-01 14:38:53] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-01 14:38:53] [INFO ] Invariant cache hit.
[2024-06-01 14:38:54] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2024-06-01 14:38:54] [INFO ] Redundant transitions in 4 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-01 14:38:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 9/94 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 1 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 1 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 2 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 1 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 1 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 1 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2024-06-01 14:39:01] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:39:02] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:39:02] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 1 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2024-06-01 14:39:03] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:39:04] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:39:04] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:39:04] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:39:04] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:39:04] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2024-06-01 14:39:04] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2024-06-01 14:39:05] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2024-06-01 14:39:05] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2024-06-01 14:39:05] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:39:05] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:39:06] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:39:06] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:39:06] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2024-06-01 14:39:07] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:39:07] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:39:07] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2024-06-01 14:39:07] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:39:07] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 5 ms to minimize.
[2024-06-01 14:39:07] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2024-06-01 14:39:07] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:39:07] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2024-06-01 14:39:08] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:39:08] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:39:08] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:39:08] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:39:10] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:39:10] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2024-06-01 14:39:10] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:39:13] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:39:15] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:39:15] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:39:15] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:39:15] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:39:16] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2024-06-01 14:39:16] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:39:16] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
[2024-06-01 14:39:16] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:39:17] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:39:20] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-06-01 14:39:21] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:39:23] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 94/510 variables, and 86 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/94 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 9/94 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 71/86 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 14:39:28] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:39:28] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 416/510 variables, 94/182 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 412/594 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 594 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 73/73 constraints]
After SMT, in 60838ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60843ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61610 ms. Remains : 94/94 places, 416/416 transitions.
Treatment of property PermAdmissibility-PT-01-LTLCardinality-03 finished in 189966 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(p0)&&X(p1)))'
Support contains 18 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 446/446 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 98 transition count 446
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 93 transition count 426
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 93 transition count 426
Applied a total of 36 rules in 7 ms. Remains 93 /124 variables (removed 31) and now considering 426/446 (removed 20) transitions.
// Phase 1: matrix 426 rows 93 cols
[2024-06-01 14:39:55] [INFO ] Computed 16 invariants in 5 ms
[2024-06-01 14:39:55] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 14:39:55] [INFO ] Invariant cache hit.
[2024-06-01 14:39:56] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2024-06-01 14:39:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 426/519 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 0/519 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 422 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 109 constraints, problems are : Problem set: 0 solved, 422 unsolved in 17175 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 426/519 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 422/531 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 531 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints]
After SMT, in 48016ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 48021ms
Starting structural reductions in LTL mode, iteration 1 : 93/124 places, 426/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48896 ms. Remains : 93/124 places, 426/446 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 25 steps with 2 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-05 finished in 49130 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((p0&&F(p1)&&(X(p0)||G(p2)))))'
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 446/446 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 98 transition count 446
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 94 transition count 430
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 94 transition count 430
Applied a total of 34 rules in 17 ms. Remains 94 /124 variables (removed 30) and now considering 430/446 (removed 16) transitions.
// Phase 1: matrix 430 rows 94 cols
[2024-06-01 14:40:44] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 14:40:44] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 14:40:44] [INFO ] Invariant cache hit.
[2024-06-01 14:40:45] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-06-01 14:40:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 430/524 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (OVERLAPS) 0/524 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 110 constraints, problems are : Problem set: 0 solved, 426 unsolved in 17426 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 430/524 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 426/536 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/524 variables, and 536 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
After SMT, in 48276ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 48281ms
Starting structural reductions in LTL mode, iteration 1 : 94/124 places, 430/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49213 ms. Remains : 94/124 places, 430/446 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-08 finished in 49486 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 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 446/446 transitions.
Graph (complete) has 1060 edges and 124 vertex of which 86 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.3 ms
Discarding 38 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Applied a total of 1 rules in 21 ms. Remains 86 /124 variables (removed 38) and now considering 416/446 (removed 30) transitions.
// Phase 1: matrix 416 rows 86 cols
[2024-06-01 14:41:34] [INFO ] Computed 14 invariants in 4 ms
[2024-06-01 14:41:34] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 14:41:34] [INFO ] Invariant cache hit.
[2024-06-01 14:41:34] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2024-06-01 14:41:34] [INFO ] Redundant transitions in 2 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-01 14:41:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 416/502 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 0/502 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 100 constraints, problems are : Problem set: 0 solved, 412 unsolved in 11646 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 416/502 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 412/512 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/502 variables, and 512 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 42435ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 42440ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/124 places, 416/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43340 ms. Remains : 86/124 places, 416/446 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-10
Product exploration explored 100000 steps with 6666 reset in 343 ms.
Product exploration explored 100000 steps with 6666 reset in 353 ms.
Computed a total of 86 stabilizing places and 416 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 416
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 194 steps (10 resets) in 5 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 416/416 transitions.
Applied a total of 0 rules in 15 ms. Remains 86 /86 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-06-01 14:42:18] [INFO ] Invariant cache hit.
[2024-06-01 14:42:18] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 14:42:18] [INFO ] Invariant cache hit.
[2024-06-01 14:42:19] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
[2024-06-01 14:42:19] [INFO ] Redundant transitions in 2 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-01 14:42:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 416/502 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 0/502 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 100 constraints, problems are : Problem set: 0 solved, 412 unsolved in 11427 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 416/502 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 412/512 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/502 variables, and 512 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 42232ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 42238ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43166 ms. Remains : 86/86 places, 416/416 transitions.
Computed a total of 86 stabilizing places and 416 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 416
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 254 steps (14 resets) in 5 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6666 reset in 283 ms.
Product exploration explored 100000 steps with 6666 reset in 300 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 416/416 transitions.
Applied a total of 0 rules in 15 ms. Remains 86 /86 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2024-06-01 14:43:02] [INFO ] Invariant cache hit.
[2024-06-01 14:43:03] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-01 14:43:03] [INFO ] Invariant cache hit.
[2024-06-01 14:43:03] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2024-06-01 14:43:03] [INFO ] Redundant transitions in 2 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-01 14:43:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 416/502 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 0/502 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 100 constraints, problems are : Problem set: 0 solved, 412 unsolved in 11375 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 416/502 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 412/512 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/502 variables, and 512 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 42159ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 42163ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43090 ms. Remains : 86/86 places, 416/416 transitions.
Treatment of property PermAdmissibility-PT-01-LTLCardinality-10 finished in 131988 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 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 446/446 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 98 transition count 446
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 93 transition count 426
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 93 transition count 426
Applied a total of 36 rules in 6 ms. Remains 93 /124 variables (removed 31) and now considering 426/446 (removed 20) transitions.
// Phase 1: matrix 426 rows 93 cols
[2024-06-01 14:43:46] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 14:43:46] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 14:43:46] [INFO ] Invariant cache hit.
[2024-06-01 14:43:46] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2024-06-01 14:43:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 426/519 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 0/519 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 422 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 109 constraints, problems are : Problem set: 0 solved, 422 unsolved in 17104 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 426/519 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 422/531 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 531 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints]
After SMT, in 47996ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 48001ms
Starting structural reductions in LTL mode, iteration 1 : 93/124 places, 426/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48810 ms. Remains : 93/124 places, 426/446 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Computed a total of 93 stabilizing places and 426 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 93 transition count 426
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 27 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-01-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLCardinality-12 finished in 49313 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 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 446/446 transitions.
Graph (complete) has 1060 edges and 124 vertex of which 87 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.2 ms
Discarding 37 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Applied a total of 1 rules in 12 ms. Remains 87 /124 variables (removed 37) and now considering 416/446 (removed 30) transitions.
// Phase 1: matrix 416 rows 87 cols
[2024-06-01 14:44:35] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 14:44:35] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 14:44:35] [INFO ] Invariant cache hit.
[2024-06-01 14:44:36] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2024-06-01 14:44:36] [INFO ] Redundant transitions in 2 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-01 14:44:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 416/502 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 1/503 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (OVERLAPS) 0/503 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 101 constraints, problems are : Problem set: 0 solved, 412 unsolved in 20046 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 416/502 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 300/400 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (OVERLAPS) 1/503 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 513 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30104 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 50966ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 50971ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/124 places, 416/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51815 ms. Remains : 87/124 places, 416/446 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-13
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-13 finished in 51872 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)) U (p1&&F(G(p1)))))'
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 446/446 transitions.
Graph (complete) has 1060 edges and 124 vertex of which 99 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 95 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 95 transition count 430
Applied a total of 9 rules in 20 ms. Remains 95 /124 variables (removed 29) and now considering 430/446 (removed 16) transitions.
// Phase 1: matrix 430 rows 95 cols
[2024-06-01 14:45:27] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 14:45:27] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 14:45:27] [INFO ] Invariant cache hit.
[2024-06-01 14:45:28] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
[2024-06-01 14:45:28] [INFO ] Redundant transitions in 2 ms returned []
Running 426 sub problems to find dead transitions.
[2024-06-01 14:45:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 430/524 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (OVERLAPS) 1/525 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 8 (OVERLAPS) 0/525 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 111 constraints, problems are : Problem set: 0 solved, 426 unsolved in 16725 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 430/524 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 413/523 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 426 unsolved
SMT process timed out in 47620ms, After SMT, problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 47625ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/124 places, 430/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48590 ms. Remains : 95/124 places, 430/446 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-14
Product exploration explored 100000 steps with 8099 reset in 343 ms.
Product exploration explored 100000 steps with 8120 reset in 374 ms.
Computed a total of 95 stabilizing places and 430 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 95 transition count 430
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 337 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 118 steps (4 resets) in 6 ms. (16 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p1 p0))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 484 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
[2024-06-01 14:46:18] [INFO ] Invariant cache hit.
[2024-06-01 14:46:18] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 10 ms returned sat
[2024-06-01 14:46:18] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-06-01 14:46:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:46:18] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 12 ms returned sat
[2024-06-01 14:46:18] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2024-06-01 14:46:19] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 398 transitions) in 49 ms.
[2024-06-01 14:46:19] [INFO ] Added : 7 causal constraints over 2 iterations in 139 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 430/430 transitions.
Applied a total of 0 rules in 11 ms. Remains 95 /95 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2024-06-01 14:46:19] [INFO ] Invariant cache hit.
[2024-06-01 14:46:19] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 14:46:19] [INFO ] Invariant cache hit.
[2024-06-01 14:46:20] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
[2024-06-01 14:46:20] [INFO ] Redundant transitions in 2 ms returned []
Running 426 sub problems to find dead transitions.
[2024-06-01 14:46:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 430/524 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (OVERLAPS) 1/525 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 8 (OVERLAPS) 0/525 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 111 constraints, problems are : Problem set: 0 solved, 426 unsolved in 17040 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 430/524 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 413/523 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 426 unsolved
SMT process timed out in 47856ms, After SMT, problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 47862ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48912 ms. Remains : 95/95 places, 430/430 transitions.
Computed a total of 95 stabilizing places and 430 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 95 transition count 430
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 345 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 642 steps (34 resets) in 8 ms. (71 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p1 p0))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 475 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
[2024-06-01 14:47:09] [INFO ] Invariant cache hit.
[2024-06-01 14:47:09] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 11 ms returned sat
[2024-06-01 14:47:09] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-06-01 14:47:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:47:10] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 10 ms returned sat
[2024-06-01 14:47:10] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-06-01 14:47:10] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 398 transitions) in 67 ms.
[2024-06-01 14:47:10] [INFO ] Added : 7 causal constraints over 2 iterations in 156 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 8081 reset in 276 ms.
Product exploration explored 100000 steps with 8065 reset in 308 ms.
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 430/430 transitions.
Applied a total of 0 rules in 23 ms. Remains 95 /95 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2024-06-01 14:47:11] [INFO ] Invariant cache hit.
[2024-06-01 14:47:11] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 14:47:11] [INFO ] Invariant cache hit.
[2024-06-01 14:47:12] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
[2024-06-01 14:47:12] [INFO ] Redundant transitions in 2 ms returned []
Running 426 sub problems to find dead transitions.
[2024-06-01 14:47:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 430/524 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (OVERLAPS) 1/525 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 8 (OVERLAPS) 0/525 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 111 constraints, problems are : Problem set: 0 solved, 426 unsolved in 16890 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 430/524 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 413/523 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 426 unsolved
SMT process timed out in 47797ms, After SMT, problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 47803ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48912 ms. Remains : 95/95 places, 430/430 transitions.
Treatment of property PermAdmissibility-PT-01-LTLCardinality-14 finished in 153094 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)))'
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)))'
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)) U (p1&&F(G(p1)))))'
[2024-06-01 14:48:00] [INFO ] Flatten gal took : 53 ms
[2024-06-01 14:48:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 14:48:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 446 transitions and 2476 arcs took 11 ms.
Total runtime 791866 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PermAdmissibility-PT-01-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-PT-01-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-PT-01-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717253282453

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PermAdmissibility-PT-01-LTLCardinality-03
ltl formula formula --ltl=/tmp/2075/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 124 places, 446 transitions and 2476 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.010 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2075/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2075/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2075/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2075/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 100 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 125, there are 449 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~17 levels ~10000 states ~18548 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 18705
pnml2lts-mc( 0/ 4): unique states count: 18705
pnml2lts-mc( 0/ 4): unique transitions count: 46963
pnml2lts-mc( 0/ 4): - self-loop count: 825
pnml2lts-mc( 0/ 4): - claim dead count: 27660
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 18936
pnml2lts-mc( 0/ 4): - cum. max stack depth: 68
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18936 states 47820 transitions, fanout: 2.525
pnml2lts-mc( 0/ 4): Total exploration time 0.280 sec (0.280 sec minimum, 0.280 sec on average)
pnml2lts-mc( 0/ 4): States per second: 67629, Transitions per second: 170786
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 13.8 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 449 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-01-LTLCardinality-10
ltl formula formula --ltl=/tmp/2075/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 124 places, 446 transitions and 2476 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2075/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2075/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2075/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2075/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 99 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 125, there are 450 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~17 levels ~10000 states ~18412 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10644
pnml2lts-mc( 0/ 4): unique states count: 10644
pnml2lts-mc( 0/ 4): unique transitions count: 19618
pnml2lts-mc( 0/ 4): - self-loop count: 829
pnml2lts-mc( 0/ 4): - claim dead count: 8331
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 10997
pnml2lts-mc( 0/ 4): - cum. max stack depth: 68
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10997 states 20424 transitions, fanout: 1.857
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.140 sec minimum, 0.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 78550, Transitions per second: 145886
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 16.8 B/state, compr.: 3.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 449 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-01-LTLCardinality-14
ltl formula formula --ltl=/tmp/2075/ltl_2_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 124 places, 446 transitions and 2476 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2075/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2075/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2075/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2075/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 99 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 125, there are 457 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~17!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8383
pnml2lts-mc( 0/ 4): unique states count: 8432
pnml2lts-mc( 0/ 4): unique transitions count: 16039
pnml2lts-mc( 0/ 4): - self-loop count: 824
pnml2lts-mc( 0/ 4): - claim dead count: 6781
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8587
pnml2lts-mc( 0/ 4): - cum. max stack depth: 68
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8587 states 16418 transitions, fanout: 1.912
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.100 sec minimum, 0.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 85870, Transitions per second: 164180
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 17.6 B/state, compr.: 3.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 449 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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="PermAdmissibility-PT-01"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PermAdmissibility-PT-01, 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 r512-smll-171654407000155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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