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.r267-smll-171654405900187.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 greatspnxred
Input is PermAdmissibility-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405900187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 15K Apr 12 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Apr 12 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 12 09:04 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.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 504K Apr 12 09:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K 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 336K 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-20-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716711627575

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 08:20:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 08:20:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 08:20:31] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2024-05-26 08:20:31] [INFO ] Transformed 168 places.
[2024-05-26 08:20:31] [INFO ] Transformed 592 transitions.
[2024-05-26 08:20:31] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 650 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA PermAdmissibility-PT-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 129 transition count 592
Applied a total of 39 rules in 66 ms. Remains 129 /168 variables (removed 39) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 129 cols
[2024-05-26 08:20:31] [INFO ] Computed 19 invariants in 46 ms
[2024-05-26 08:20:32] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-05-26 08:20:32] [INFO ] Invariant cache hit.
[2024-05-26 08:20:33] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1437 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2024-05-26 08:20:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 25/128 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/720 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/720 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 6 (OVERLAPS) 1/721 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/721 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 8 (OVERLAPS) 0/721 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 588 unsolved
No progress, stopping.
After SMT solving in domain Real declared 721/721 variables, and 148 constraints, problems are : Problem set: 0 solved, 588 unsolved in 26485 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 25/128 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/720 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/720 variables, 460/607 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 720/721 variables, and 607 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30049 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 128/129 constraints, PredecessorRefiner: 460/588 constraints, Known Traps: 0/0 constraints]
After SMT, in 59292ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 59344ms
Starting structural reductions in LTL mode, iteration 1 : 129/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60934 ms. Remains : 129/168 places, 592/592 transitions.
Support contains 71 out of 129 places after structural reductions.
[2024-05-26 08:21:32] [INFO ] Flatten gal took : 148 ms
[2024-05-26 08:21:32] [INFO ] Flatten gal took : 83 ms
[2024-05-26 08:21:33] [INFO ] Input system was already deterministic with 592 transitions.
Support contains 70 out of 129 places (down from 71) after GAL structural reductions.
RANDOM walk for 11529 steps (32 resets) in 227 ms. (50 steps per ms) remains 0/20 properties
Computed a total of 129 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 129 transition count 592
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(G((!p0 U (p1 U (p1&&G(p2)))))))'
Support contains 12 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 37 place count 92 transition count 356
Iterating global reduction 1 with 20 rules applied. Total rules applied 57 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 71 place count 78 transition count 230
Iterating global reduction 1 with 14 rules applied. Total rules applied 85 place count 78 transition count 230
Applied a total of 85 rules in 38 ms. Remains 78 /129 variables (removed 51) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 78 cols
[2024-05-26 08:21:33] [INFO ] Computed 17 invariants in 5 ms
[2024-05-26 08:21:33] [INFO ] Implicit Places using invariants in 146 ms returned [0, 19, 33, 44]
[2024-05-26 08:21:33] [INFO ] Actually due to overlaps returned [0, 19, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 149 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/129 places, 230/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 75/129 places, 230/592 transitions.
Stuttering acceptance computed with spot in 528 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-00 finished in 918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(F(p1))||G(p2)))))'
Support contains 19 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 592
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 31 place count 98 transition count 368
Iterating global reduction 1 with 14 rules applied. Total rules applied 45 place count 98 transition count 368
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 84 transition count 242
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 84 transition count 242
Applied a total of 73 rules in 23 ms. Remains 84 /129 variables (removed 45) and now considering 242/592 (removed 350) transitions.
// Phase 1: matrix 242 rows 84 cols
[2024-05-26 08:21:34] [INFO ] Computed 17 invariants in 9 ms
[2024-05-26 08:21:34] [INFO ] Implicit Places using invariants in 175 ms returned [0, 18, 39, 50]
[2024-05-26 08:21:34] [INFO ] Actually due to overlaps returned [0, 18, 39]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 177 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/129 places, 242/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 202 ms. Remains : 81/129 places, 242/592 transitions.
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 470 ms.
Product exploration explored 100000 steps with 33333 reset in 290 ms.
Computed a total of 81 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 81 transition count 242
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 p0 p1 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLCardinality-01 finished in 1393 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 8 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Graph (complete) has 1225 edges and 129 vertex of which 112 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.5 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 92 transition count 356
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 55 place count 78 transition count 230
Iterating global reduction 0 with 14 rules applied. Total rules applied 69 place count 78 transition count 230
Applied a total of 69 rules in 42 ms. Remains 78 /129 variables (removed 51) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 78 cols
[2024-05-26 08:21:35] [INFO ] Computed 17 invariants in 3 ms
[2024-05-26 08:21:36] [INFO ] Implicit Places using invariants in 347 ms returned [0, 19, 33, 44]
[2024-05-26 08:21:36] [INFO ] Actually due to overlaps returned [0, 19, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 352 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/129 places, 230/592 transitions.
Applied a total of 0 rules in 12 ms. Remains 75 /75 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 407 ms. Remains : 75/129 places, 230/592 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-02
Product exploration explored 100000 steps with 311 reset in 910 ms.
Product exploration explored 100000 steps with 311 reset in 761 ms.
Computed a total of 75 stabilizing places and 230 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 230
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 97 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 38 ms :[(NOT p0)]
RANDOM walk for 1344 steps (0 resets) in 8 ms. (149 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 126 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
// Phase 1: matrix 230 rows 75 cols
[2024-05-26 08:21:38] [INFO ] Computed 14 invariants in 2 ms
[2024-05-26 08:21:38] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 16 ms returned sat
[2024-05-26 08:21:38] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-26 08:21:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 08:21:38] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 14 ms returned sat
[2024-05-26 08:21:38] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-26 08:21:38] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 198 transitions) in 38 ms.
[2024-05-26 08:21:39] [INFO ] Added : 24 causal constraints over 8 iterations in 218 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 230/230 transitions.
Applied a total of 0 rules in 13 ms. Remains 75 /75 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2024-05-26 08:21:39] [INFO ] Invariant cache hit.
[2024-05-26 08:21:39] [INFO ] Implicit Places using invariants in 113 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/75 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 74 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 73 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 73 transition count 228
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 72 transition count 228
Applied a total of 4 rules in 32 ms. Remains 72 /74 variables (removed 2) and now considering 228/230 (removed 2) transitions.
// Phase 1: matrix 228 rows 72 cols
[2024-05-26 08:21:39] [INFO ] Computed 13 invariants in 2 ms
[2024-05-26 08:21:39] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-26 08:21:39] [INFO ] Invariant cache hit.
[2024-05-26 08:21:39] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/75 places, 228/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 552 ms. Remains : 72/75 places, 228/230 transitions.
Computed a total of 72 stabilizing places and 228 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 228
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 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 38 ms :[(NOT p0)]
RANDOM walk for 1119 steps (0 resets) in 8 ms. (124 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 124 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-26 08:21:40] [INFO ] Invariant cache hit.
[2024-05-26 08:21:40] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 11 ms returned sat
[2024-05-26 08:21:40] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-26 08:21:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 08:21:40] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 9 ms returned sat
[2024-05-26 08:21:40] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-26 08:21:40] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 196 transitions) in 38 ms.
[2024-05-26 08:21:40] [INFO ] Added : 21 causal constraints over 6 iterations in 167 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 355 reset in 764 ms.
Product exploration explored 100000 steps with 355 reset in 757 ms.
Support contains 8 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 228/228 transitions.
Applied a total of 0 rules in 8 ms. Remains 72 /72 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-05-26 08:21:42] [INFO ] Invariant cache hit.
[2024-05-26 08:21:42] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-26 08:21:42] [INFO ] Invariant cache hit.
[2024-05-26 08:21:42] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-05-26 08:21:42] [INFO ] Redundant transitions in 11 ms returned []
Running 224 sub problems to find dead transitions.
[2024-05-26 08:21:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 9/72 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 228/300 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 85 constraints, problems are : Problem set: 0 solved, 224 unsolved in 5454 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 9/72 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 228/300 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 224/309 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 309 constraints, problems are : Problem set: 0 solved, 224 unsolved in 26617 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
After SMT, in 32515ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 32519ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32908 ms. Remains : 72/72 places, 228/228 transitions.
Treatment of property PermAdmissibility-PT-20-LTLCardinality-02 finished in 39614 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 10 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Graph (complete) has 1225 edges and 129 vertex of which 50 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.3 ms
Discarding 79 places :
Also discarding 384 output transitions
Drop transitions (Output transitions of discarded places.) removed 384 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 43 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 43 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 17 place count 41 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 41 transition count 82
Applied a total of 19 rules in 11 ms. Remains 41 /129 variables (removed 88) and now considering 82/592 (removed 510) transitions.
// Phase 1: matrix 82 rows 41 cols
[2024-05-26 08:22:15] [INFO ] Computed 10 invariants in 1 ms
[2024-05-26 08:22:15] [INFO ] Implicit Places using invariants in 74 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/129 places, 82/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 40/129 places, 82/592 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-03
Product exploration explored 100000 steps with 497 reset in 508 ms.
Product exploration explored 100000 steps with 497 reset in 536 ms.
Computed a total of 40 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 82
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 94 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 336 steps (0 resets) in 4 ms. (67 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 141 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 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
// Phase 1: matrix 82 rows 40 cols
[2024-05-26 08:22:17] [INFO ] Computed 9 invariants in 0 ms
[2024-05-26 08:22:17] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-26 08:22:17] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-26 08:22:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 08:22:17] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 6 ms returned sat
[2024-05-26 08:22:17] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-26 08:22:17] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 50 transitions) in 9 ms.
[2024-05-26 08:22:17] [INFO ] Added : 15 causal constraints over 4 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-26 08:22:17] [INFO ] Invariant cache hit.
[2024-05-26 08:22:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-26 08:22:17] [INFO ] Invariant cache hit.
[2024-05-26 08:22:17] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-26 08:22:17] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-26 08:22:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 82/122 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 49 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1335 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 82/122 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 78/127 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 127 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2029 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 3417ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3419ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3590 ms. Remains : 40/40 places, 82/82 transitions.
Computed a total of 40 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 82
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 175 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 42 ms :[(NOT p0)]
RANDOM walk for 336 steps (0 resets) in 4 ms. (67 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 124 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-26 08:22:21] [INFO ] Invariant cache hit.
[2024-05-26 08:22:21] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-26 08:22:21] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-26 08:22:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 08:22:21] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-26 08:22:21] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-26 08:22:21] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 50 transitions) in 10 ms.
[2024-05-26 08:22:21] [INFO ] Added : 14 causal constraints over 4 iterations in 54 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 497 reset in 509 ms.
Product exploration explored 100000 steps with 497 reset in 536 ms.
Support contains 10 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 82/82 transitions.
Applied a total of 0 rules in 7 ms. Remains 40 /40 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-26 08:22:22] [INFO ] Invariant cache hit.
[2024-05-26 08:22:23] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-26 08:22:23] [INFO ] Invariant cache hit.
[2024-05-26 08:22:23] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-26 08:22:23] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-26 08:22:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 82/122 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 49 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1388 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 82/122 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 78/127 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 127 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2068 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 3496ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3497ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3705 ms. Remains : 40/40 places, 82/82 transitions.
Treatment of property PermAdmissibility-PT-20-LTLCardinality-03 finished in 11298 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(p0)||X(p1)))'
Support contains 17 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 592
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 30 place count 99 transition count 468
Iterating global reduction 1 with 13 rules applied. Total rules applied 43 place count 99 transition count 468
Applied a total of 43 rules in 5 ms. Remains 99 /129 variables (removed 30) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 99 cols
[2024-05-26 08:22:26] [INFO ] Computed 17 invariants in 5 ms
[2024-05-26 08:22:26] [INFO ] Implicit Places using invariants in 180 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 186 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/129 places, 468/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 194 ms. Remains : 98/129 places, 468/592 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 49 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-04 finished in 382 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||X(X(F((p1&&X(X(p2)))))))))'
Support contains 19 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 37 place count 92 transition count 356
Iterating global reduction 1 with 20 rules applied. Total rules applied 57 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 71 place count 78 transition count 230
Iterating global reduction 1 with 14 rules applied. Total rules applied 85 place count 78 transition count 230
Applied a total of 85 rules in 5 ms. Remains 78 /129 variables (removed 51) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 78 cols
[2024-05-26 08:22:27] [INFO ] Computed 17 invariants in 2 ms
[2024-05-26 08:22:27] [INFO ] Implicit Places using invariants in 127 ms returned [0, 18, 33, 44]
[2024-05-26 08:22:27] [INFO ] Actually due to overlaps returned [0, 18, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 133 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/129 places, 230/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 75/129 places, 230/592 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-05
Stuttering criterion allowed to conclude after 320 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-05 finished in 453 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)&&F(G(p1)))))'
Support contains 11 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Graph (complete) has 1225 edges and 129 vertex of which 94 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 88 transition count 368
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 88 transition count 368
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 25 place count 76 transition count 248
Iterating global reduction 0 with 12 rules applied. Total rules applied 37 place count 76 transition count 248
Applied a total of 37 rules in 17 ms. Remains 76 /129 variables (removed 53) and now considering 248/592 (removed 344) transitions.
// Phase 1: matrix 248 rows 76 cols
[2024-05-26 08:22:27] [INFO ] Computed 15 invariants in 2 ms
[2024-05-26 08:22:27] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-26 08:22:27] [INFO ] Invariant cache hit.
[2024-05-26 08:22:27] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-26 08:22:27] [INFO ] Redundant transitions in 8 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-26 08:22:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 91 constraints, problems are : Problem set: 0 solved, 244 unsolved in 4217 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 244/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 0)
(s11 4)
(s12 10)
(s13 0)
(s14 0)
(s15 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 34559ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 34562ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/129 places, 248/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34934 ms. Remains : 76/129 places, 248/592 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-06
Product exploration explored 100000 steps with 355 reset in 869 ms.
Product exploration explored 100000 steps with 355 reset in 873 ms.
Computed a total of 76 stabilizing places and 248 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 248
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 p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 175 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1096 steps (0 resets) in 8 ms. (121 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-26 08:23:05] [INFO ] Invariant cache hit.
[2024-05-26 08:23:05] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 12 ms returned sat
[2024-05-26 08:23:05] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-26 08:23:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 08:23:05] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 14 ms returned sat
[2024-05-26 08:23:05] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-26 08:23:06] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 41 ms.
[2024-05-26 08:23:06] [INFO ] Added : 19 causal constraints over 5 iterations in 185 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 11 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 248/248 transitions.
Applied a total of 0 rules in 8 ms. Remains 76 /76 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-05-26 08:23:06] [INFO ] Invariant cache hit.
[2024-05-26 08:23:06] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-26 08:23:06] [INFO ] Invariant cache hit.
[2024-05-26 08:23:06] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-26 08:23:06] [INFO ] Redundant transitions in 4 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-26 08:23:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 91 constraints, problems are : Problem set: 0 solved, 244 unsolved in 4156 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 244/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 34525ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 34528ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34920 ms. Remains : 76/76 places, 248/248 transitions.
Computed a total of 76 stabilizing places and 248 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 248
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 p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1053 steps (0 resets) in 9 ms. (105 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-26 08:23:41] [INFO ] Invariant cache hit.
[2024-05-26 08:23:42] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2024-05-26 08:23:42] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-26 08:23:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 08:23:42] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 15 ms returned sat
[2024-05-26 08:23:42] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-26 08:23:42] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 28 ms.
[2024-05-26 08:23:42] [INFO ] Added : 19 causal constraints over 5 iterations in 165 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 355 reset in 835 ms.
Product exploration explored 100000 steps with 355 reset in 866 ms.
Support contains 11 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 76 /76 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-05-26 08:23:44] [INFO ] Invariant cache hit.
[2024-05-26 08:23:44] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-26 08:23:44] [INFO ] Invariant cache hit.
[2024-05-26 08:23:44] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-26 08:23:44] [INFO ] Redundant transitions in 2 ms returned []
Running 244 sub problems to find dead transitions.
[2024-05-26 08:23:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 91 constraints, problems are : Problem set: 0 solved, 244 unsolved in 4469 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 244/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 34828ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 34831ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35190 ms. Remains : 76/76 places, 248/248 transitions.
Treatment of property PermAdmissibility-PT-20-LTLCardinality-06 finished in 112141 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(p0)||X(X(F(p1)))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 51 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 77 place count 78 transition count 344
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 100 place count 55 transition count 114
Iterating global reduction 1 with 23 rules applied. Total rules applied 123 place count 55 transition count 114
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 52 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 52 transition count 90
Applied a total of 129 rules in 6 ms. Remains 52 /129 variables (removed 77) and now considering 90/592 (removed 502) transitions.
// Phase 1: matrix 90 rows 52 cols
[2024-05-26 08:24:19] [INFO ] Computed 16 invariants in 2 ms
[2024-05-26 08:24:19] [INFO ] Implicit Places using invariants in 105 ms returned [0, 5, 18, 26]
[2024-05-26 08:24:19] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 108 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/129 places, 90/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 49/129 places, 90/592 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 143 ms.
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Computed a total of 49 stabilizing places and 90 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 90
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 p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLCardinality-09 finished in 712 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))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 49 place count 80 transition count 346
Iterating global reduction 1 with 25 rules applied. Total rules applied 74 place count 80 transition count 346
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 96 place count 58 transition count 124
Iterating global reduction 1 with 22 rules applied. Total rules applied 118 place count 58 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 56 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 56 transition count 108
Applied a total of 122 rules in 6 ms. Remains 56 /129 variables (removed 73) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 56 cols
[2024-05-26 08:24:20] [INFO ] Computed 16 invariants in 1 ms
[2024-05-26 08:24:20] [INFO ] Implicit Places using invariants in 121 ms returned [0, 7, 21, 28]
[2024-05-26 08:24:20] [INFO ] Actually due to overlaps returned [0, 7, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 123 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/129 places, 108/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 53/129 places, 108/592 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Computed a total of 53 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 108
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLCardinality-10 finished in 730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 49 place count 80 transition count 348
Iterating global reduction 1 with 25 rules applied. Total rules applied 74 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 96 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 118 place count 58 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 56 transition count 102
Applied a total of 122 rules in 6 ms. Remains 56 /129 variables (removed 73) and now considering 102/592 (removed 490) transitions.
// Phase 1: matrix 102 rows 56 cols
[2024-05-26 08:24:21] [INFO ] Computed 16 invariants in 1 ms
[2024-05-26 08:24:21] [INFO ] Implicit Places using invariants in 78 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/129 places, 102/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 55/129 places, 102/592 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-11
Stuttering criterion allowed to conclude after 10361 steps with 76 reset in 82 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-11 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 51 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 77 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 52 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 52 transition count 92
Applied a total of 129 rules in 6 ms. Remains 52 /129 variables (removed 77) and now considering 92/592 (removed 500) transitions.
// Phase 1: matrix 92 rows 52 cols
[2024-05-26 08:24:21] [INFO ] Computed 16 invariants in 1 ms
[2024-05-26 08:24:21] [INFO ] Implicit Places using invariants in 112 ms returned [0, 5, 19, 26]
[2024-05-26 08:24:21] [INFO ] Actually due to overlaps returned [0, 5, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 113 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/129 places, 92/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 49/129 places, 92/592 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-14 finished in 259 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)))'
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)&&F(G(p1)))))'
[2024-05-26 08:24:22] [INFO ] Flatten gal took : 59 ms
[2024-05-26 08:24:22] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 7 ms.
[2024-05-26 08:24:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 592 transitions and 3144 arcs took 11 ms.
Total runtime 232049 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PermAdmissibility-PT-20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 129
TRANSITIONS: 592
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.023s, Sys 0.000s]


SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1248
MODEL NAME: /home/mcc/execution/408/model
129 places, 592 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PermAdmissibility-PT-20, 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 r267-smll-171654405900187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-20.tgz
mv PermAdmissibility-PT-20 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 ;