Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536500507.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
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 r261-smll-167863536500507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 01:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 26 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 150K Feb 26 01:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 01:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 550K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 484K Mar 5 18:23 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 1678961133812

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-01
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-16 10:05:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 10:05:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 10:05:37] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2023-03-16 10:05:37] [INFO ] Transformed 168 places.
[2023-03-16 10:05:37] [INFO ] Transformed 592 transitions.
[2023-03-16 10:05:37] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 423 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-PT-01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 96 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 145 transition count 592
Applied a total of 23 rules in 44 ms. Remains 145 /168 variables (removed 23) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 145 cols
[2023-03-16 10:05:37] [INFO ] Computed 21 place invariants in 44 ms
[2023-03-16 10:05:38] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-16 10:05:38] [INFO ] Invariant cache hit.
[2023-03-16 10:05:39] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2023-03-16 10:05:39] [INFO ] Invariant cache hit.
[2023-03-16 10:05:40] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2489 ms. Remains : 145/168 places, 592/592 transitions.
Support contains 96 out of 145 places after structural reductions.
[2023-03-16 10:05:40] [INFO ] Flatten gal took : 210 ms
[2023-03-16 10:05:40] [INFO ] Flatten gal took : 98 ms
[2023-03-16 10:05:40] [INFO ] Input system was already deterministic with 592 transitions.
Support contains 88 out of 145 places (down from 96) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 824 ms. (steps per millisecond=12 ) properties (out of 32) seen :18
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 204 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-16 10:05:44] [INFO ] Invariant cache hit.
[2023-03-16 10:05:44] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-16 10:05:44] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :14 sat :0
Fused 14 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 14 atomic propositions for a total of 14 simplifications.
FORMULA PermAdmissibility-PT-01-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 145 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 145 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).
FORMULA PermAdmissibility-PT-01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 16 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 592/592 transitions.
Graph (complete) has 1385 edges and 145 vertex of which 112 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.9 ms
Discarding 33 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 93 transition count 372
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 93 transition count 372
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 44 place count 88 transition count 292
Iterating global reduction 0 with 5 rules applied. Total rules applied 49 place count 88 transition count 292
Applied a total of 49 rules in 90 ms. Remains 88 /145 variables (removed 57) and now considering 292/592 (removed 300) transitions.
// Phase 1: matrix 292 rows 88 cols
[2023-03-16 10:05:45] [INFO ] Computed 17 place invariants in 6 ms
[2023-03-16 10:05:45] [INFO ] Implicit Places using invariants in 173 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/145 places, 292/592 transitions.
Applied a total of 0 rules in 29 ms. Remains 87 /87 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 299 ms. Remains : 87/145 places, 292/592 transitions.
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s11 s12 s14 s15 s16 s17 s18 s19)), p1:(AND (GT 3 (ADD s60 s61 s62 s63 s72 s73 s74 s75)) (GT 1 (ADD s11 s12 s14 s15 s16 s17 s18 s19)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 32 steps with 1 reset in 5 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-00 finished in 772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(G((p0 U p1)))) U X(X(X(X(p2))))))'
Support contains 19 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 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 120 transition count 592
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 38 place count 107 transition count 384
Iterating global reduction 1 with 13 rules applied. Total rules applied 51 place count 107 transition count 384
Applied a total of 51 rules in 20 ms. Remains 107 /145 variables (removed 38) and now considering 384/592 (removed 208) transitions.
// Phase 1: matrix 384 rows 107 cols
[2023-03-16 10:05:45] [INFO ] Computed 18 place invariants in 12 ms
[2023-03-16 10:05:46] [INFO ] Implicit Places using invariants in 261 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 277 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/145 places, 384/592 transitions.
Applied a total of 0 rules in 10 ms. Remains 106 /106 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 310 ms. Remains : 106/145 places, 384/592 transitions.
Stuttering acceptance computed with spot in 1373 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR p0 p1), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 8}, { cond=p0, acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(OR p0 p1), acceptance={} source=7 dest: 10}], [{ cond=true, acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 11}, { cond=(OR p0 p1), acceptance={} source=9 dest: 12}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 13}, { cond=p0, acceptance={} source=9 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 5}, { cond=(OR p0 p1), acceptance={} source=10 dest: 15}], [{ cond=true, acceptance={} source=11 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 16}, { cond=(OR p0 p1), acceptance={} source=12 dest: 17}], [{ cond=true, acceptance={} source=13 dest: 18}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=14 dest: 18}, { cond=(OR p0 p1), acceptance={} source=14 dest: 19}, { cond=(AND (NOT p0) p1), acceptance={} source=14 dest: 20}, { cond=p0, acceptance={} source=14 dest: 21}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=15 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=15 dest: 22}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=15 dest: 23}], [{ cond=(NOT p2), acceptance={} source=16 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=17 dest: 5}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=17 dest: 15}], [{ cond=(NOT p2), acceptance={} source=18 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=19 dest: 16}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=19 dest: 17}], [{ cond=(NOT p2), acceptance={} source=20 dest: 18}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=21 dest: 18}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=21 dest: 19}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=21 dest: 20}, { cond=(AND p0 (NOT p2)), acceptance={0} source=21 dest: 21}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=22 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=22 dest: 22}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=23 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=23 dest: 22}, { cond=(OR p0 p1), acceptance={} source=23 dest: 23}]], initial=0, aps=[p0:(LEQ 1 s40), p1:(LEQ (ADD s9 s10 s11 s12 s13 s14 s15 s16) s27), p2:(LEQ (ADD s28 s29 s31 s32 s33 s34 s35 s36) s37)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 680 ms.
Product exploration explored 100000 steps with 20000 reset in 522 ms.
Computed a total of 106 stabilizing places and 384 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 transition count 384
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 p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (AND (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (NOT 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 : []
Knowledge based reduction with 13 factoid took 925 ms. Reduced automaton from 24 states, 47 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (AND (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (NOT 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 : [(F (NOT p2))]
Knowledge based reduction with 13 factoid took 934 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Support contains 9 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 384/384 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 106 cols
[2023-03-16 10:05:51] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-16 10:05:51] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-16 10:05:51] [INFO ] Invariant cache hit.
[2023-03-16 10:05:52] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
[2023-03-16 10:05:52] [INFO ] Invariant cache hit.
[2023-03-16 10:05:52] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1332 ms. Remains : 106/106 places, 384/384 transitions.
Computed a total of 106 stabilizing places and 384 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 transition count 384
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 : [p2, true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [p2, true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 20000 reset in 337 ms.
Product exploration explored 100000 steps with 20000 reset in 351 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 261 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Support contains 9 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 384/384 transitions.
Graph (complete) has 765 edges and 106 vertex of which 88 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 76 transition count 248
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 76 transition count 248
Applied a total of 25 rules in 40 ms. Remains 76 /106 variables (removed 30) and now considering 248/384 (removed 136) transitions.
[2023-03-16 10:05:55] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 248 rows 76 cols
[2023-03-16 10:05:55] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-16 10:05:56] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/106 places, 248/384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 76/106 places, 248/384 transitions.
Built C files in :
/tmp/ltsmin15923735548987725125
[2023-03-16 10:05:56] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15923735548987725125
Running compilation step : cd /tmp/ltsmin15923735548987725125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1573 ms.
Running link step : cd /tmp/ltsmin15923735548987725125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15923735548987725125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3397778115222419886.hoa' '--buchi-type=spotba'
LTSmin run took 331 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-01-LTLCardinality-01 finished in 12364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 592/592 transitions.
Graph (complete) has 1385 edges and 145 vertex of which 32 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.3 ms
Discarding 113 places :
Also discarding 512 output transitions
Drop transitions removed 512 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 28 transition count 50
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 28 transition count 50
Applied a total of 9 rules in 9 ms. Remains 28 /145 variables (removed 117) and now considering 50/592 (removed 542) transitions.
// Phase 1: matrix 50 rows 28 cols
[2023-03-16 10:05:58] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-16 10:05:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-16 10:05:58] [INFO ] Invariant cache hit.
[2023-03-16 10:05:58] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-16 10:05:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 10:05:58] [INFO ] Invariant cache hit.
[2023-03-16 10:05:58] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/145 places, 50/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 28/145 places, 50/592 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s2 (ADD s10 s11 s12 s13))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11111 reset in 324 ms.
Product exploration explored 100000 steps with 11111 reset in 346 ms.
Computed a total of 28 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 28 transition count 50
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 194 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 87 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
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 211 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-16 10:05:59] [INFO ] Invariant cache hit.
[2023-03-16 10:05:59] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-16 10:05:59] [INFO ] Invariant cache hit.
[2023-03-16 10:06:00] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-16 10:06:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 10:06:00] [INFO ] Invariant cache hit.
[2023-03-16 10:06:00] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 28/28 places, 50/50 transitions.
Computed a total of 28 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 28 transition count 50
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 212 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 105 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
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 263 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 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 257 ms.
Product exploration explored 100000 steps with 11111 reset in 299 ms.
Built C files in :
/tmp/ltsmin6453057986954346221
[2023-03-16 10:06:01] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2023-03-16 10:06:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 10:06:01] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2023-03-16 10:06:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 10:06:01] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2023-03-16 10:06:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 10:06:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6453057986954346221
Running compilation step : cd /tmp/ltsmin6453057986954346221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 295 ms.
Running link step : cd /tmp/ltsmin6453057986954346221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6453057986954346221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased142929076067297246.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-01-LTLCardinality-02 finished in 3988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(F(p1))))))'
Support contains 20 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 592/592 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 104 transition count 592
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 90 transition count 368
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 90 transition count 368
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 83 place count 76 transition count 242
Iterating global reduction 1 with 14 rules applied. Total rules applied 97 place count 76 transition count 242
Applied a total of 97 rules in 12 ms. Remains 76 /145 variables (removed 69) and now considering 242/592 (removed 350) transitions.
// Phase 1: matrix 242 rows 76 cols
[2023-03-16 10:06:02] [INFO ] Computed 16 place invariants in 4 ms
[2023-03-16 10:06:02] [INFO ] Implicit Places using invariants in 198 ms returned [0, 11, 31, 42]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 214 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/145 places, 242/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 229 ms. Remains : 72/145 places, 242/592 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s8) (ADD s37 s38 s46 s47)), p1:(GT (ADD s37 s38 s46 s47) (ADD s10 s11 s12 s13 s15 s16 s17 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-05 finished in 547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 592/592 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 67 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 93 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 117 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 141 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 144 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 147 place count 51 transition count 84
Applied a total of 147 rules in 17 ms. Remains 51 /145 variables (removed 94) and now considering 84/592 (removed 508) transitions.
// Phase 1: matrix 84 rows 51 cols
[2023-03-16 10:06:02] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-16 10:06:02] [INFO ] Implicit Places using invariants in 119 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 123 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/145 places, 84/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143 ms. Remains : 47/145 places, 84/592 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s42)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-06 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 592/592 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 65 place count 80 transition count 346
Iterating global reduction 1 with 25 rules applied. Total rules applied 90 place count 80 transition count 346
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 112 place count 58 transition count 124
Iterating global reduction 1 with 22 rules applied. Total rules applied 134 place count 58 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 56 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 56 transition count 108
Applied a total of 138 rules in 12 ms. Remains 56 /145 variables (removed 89) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 56 cols
[2023-03-16 10:06:02] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-16 10:06:03] [INFO ] Implicit Places using invariants in 94 ms returned [0, 7, 20, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 97 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/145 places, 108/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 52/145 places, 108/592 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s18 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
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 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 592/592 transitions.
Graph (complete) has 1385 edges and 145 vertex of which 68 are kept as prefixes of interest. Removing 77 places using SCC suffix rule.3 ms
Discarding 77 places :
Also discarding 256 output transitions
Drop transitions removed 256 transitions
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 29 place count 40 transition count 84
Iterating global reduction 0 with 28 rules applied. Total rules applied 57 place count 40 transition count 84
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 64 place count 33 transition count 42
Iterating global reduction 0 with 7 rules applied. Total rules applied 71 place count 33 transition count 42
Applied a total of 71 rules in 13 ms. Remains 33 /145 variables (removed 112) and now considering 42/592 (removed 550) transitions.
// Phase 1: matrix 42 rows 33 cols
[2023-03-16 10:06:03] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-16 10:06:03] [INFO ] Implicit Places using invariants in 61 ms returned [7, 9, 12, 14, 16]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 63 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/145 places, 42/592 transitions.
Drop transitions 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 28 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 27 transition count 41
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 27 transition count 40
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 26 transition count 40
Applied a total of 4 rules in 13 ms. Remains 26 /28 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 26 cols
[2023-03-16 10:06:03] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-16 10:06:03] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-16 10:06:03] [INFO ] Invariant cache hit.
[2023-03-16 10:06:03] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/145 places, 40/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 234 ms. Remains : 26/145 places, 40/592 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s22 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Computed a total of 26 stabilizing places and 40 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 40
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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-01-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-01-LTLCardinality-10 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p0&&G(F(p1))))))'
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 592/592 transitions.
Graph (complete) has 1385 edges and 145 vertex of which 105 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 80 transition count 346
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 80 transition count 346
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 72 place count 59 transition count 132
Iterating global reduction 0 with 21 rules applied. Total rules applied 93 place count 59 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 57 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 57 transition count 116
Applied a total of 97 rules in 21 ms. Remains 57 /145 variables (removed 88) and now considering 116/592 (removed 476) transitions.
// Phase 1: matrix 116 rows 57 cols
[2023-03-16 10:06:03] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-16 10:06:03] [INFO ] Implicit Places using invariants in 77 ms returned [0, 6, 20, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 79 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/145 places, 116/592 transitions.
Drop transitions 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 53 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 52 transition count 115
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 52 transition count 114
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 51 transition count 114
Applied a total of 4 rules in 7 ms. Remains 51 /53 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 51 cols
[2023-03-16 10:06:04] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-16 10:06:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-16 10:06:04] [INFO ] Invariant cache hit.
[2023-03-16 10:06:04] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/145 places, 114/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 51/145 places, 114/592 transitions.
Stuttering acceptance computed with spot in 203 ms :[p0, (AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s48 s40), p0:(AND (LEQ s48 s40) (LEQ s6 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 1 reset in 1 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-12 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 592/592 transitions.
Graph (complete) has 1385 edges and 145 vertex of which 50 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.2 ms
Discarding 95 places :
Also discarding 384 output transitions
Drop transitions removed 384 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 37 transition count 84
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 37 transition count 84
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 34 place count 30 transition count 42
Iterating global reduction 0 with 7 rules applied. Total rules applied 41 place count 30 transition count 42
Applied a total of 41 rules in 11 ms. Remains 30 /145 variables (removed 115) and now considering 42/592 (removed 550) transitions.
// Phase 1: matrix 42 rows 30 cols
[2023-03-16 10:06:04] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-16 10:06:04] [INFO ] Implicit Places using invariants in 59 ms returned [13, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/145 places, 42/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 28/145 places, 42/592 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-01-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT 3 s9) (GT s7 s12))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1162 steps with 128 reset in 2 ms.
FORMULA PermAdmissibility-PT-01-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-01-LTLCardinality-15 finished in 193 ms.
All properties solved by simple procedures.
Total runtime 27765 ms.

BK_STOP 1678961165872

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-01"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r261-smll-167863536500507"
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 ;