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.r297-tall-167873951100883.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 ltsminxred
Input is QuasiCertifProtocol-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873951100883
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 42K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 289K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 01:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 593K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 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 360K 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 QuasiCertifProtocol-PT-18-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679670134144

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 15:02:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 15:02:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 15:02:16] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-24 15:02:16] [INFO ] Transformed 1398 places.
[2023-03-24 15:02:16] [INFO ] Transformed 296 transitions.
[2023-03-24 15:02:16] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 856 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1379 transition count 296
Applied a total of 19 rules in 68 ms. Remains 1379 /1398 variables (removed 19) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1379 cols
[2023-03-24 15:02:16] [INFO ] Computed 1084 place invariants in 68 ms
[2023-03-24 15:02:18] [INFO ] Implicit Places using invariants in 1428 ms returned []
[2023-03-24 15:02:18] [INFO ] Invariant cache hit.
[2023-03-24 15:02:20] [INFO ] Implicit Places using invariants and state equation in 2569 ms returned [835, 837, 838, 839, 840, 841, 842, 843, 844, 948, 949, 950, 951, 952, 953, 954, 955, 956]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 4240 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1361/1398 places, 296/296 transitions.
Applied a total of 0 rules in 24 ms. Remains 1361 /1361 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4332 ms. Remains : 1361/1398 places, 296/296 transitions.
Support contains 856 out of 1361 places after structural reductions.
[2023-03-24 15:02:21] [INFO ] Flatten gal took : 168 ms
[2023-03-24 15:02:21] [INFO ] Flatten gal took : 71 ms
[2023-03-24 15:02:21] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 837 out of 1361 places (down from 856) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 443 resets, run finished after 705 ms. (steps per millisecond=14 ) properties (out of 28) seen :8
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 296 rows 1361 cols
[2023-03-24 15:02:22] [INFO ] Computed 1066 place invariants in 36 ms
[2023-03-24 15:02:23] [INFO ] After 690ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-24 15:02:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-24 15:02:24] [INFO ] [Nat]Absence check using 3 positive and 1063 generalized place invariants in 225 ms returned sat
[2023-03-24 15:02:41] [INFO ] After 16306ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :15
[2023-03-24 15:02:48] [INFO ] After 23637ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :14
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 15:02:48] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :14
Fused 20 Parikh solutions to 15 different solutions.
Finished Parikh walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 15 properties in 51 ms.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1361 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1361 transition count 296
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U (p2||G(p1)))||p0)))'
Support contains 400 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 1358 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1357 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 1356 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1356 transition count 294
Applied a total of 5 rules in 210 ms. Remains 1356 /1361 variables (removed 5) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1356 cols
[2023-03-24 15:02:48] [INFO ] Computed 1063 place invariants in 17 ms
[2023-03-24 15:02:50] [INFO ] Implicit Places using invariants in 1268 ms returned []
[2023-03-24 15:02:50] [INFO ] Invariant cache hit.
[2023-03-24 15:02:52] [INFO ] Implicit Places using invariants and state equation in 2032 ms returned [832, 1176, 1177, 1178, 1179, 1180, 1181, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1316, 1317, 1318, 1319, 1322]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 3306 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1361 places, 294/296 transitions.
Applied a total of 0 rules in 47 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3564 ms. Remains : 1336/1361 places, 294/296 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s75 s76 s77 s78 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s93 s95 s96 s97 s98)) (LEQ 1 s128)), p2:(AND (GT 1 s128) (GT (ADD s138 s139 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6265 reset in 2809 ms.
Product exploration explored 100000 steps with 6270 reset in 2733 ms.
Computed a total of 1336 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 294
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) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 317 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 421 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 1336 cols
[2023-03-24 15:02:59] [INFO ] Computed 1044 place invariants in 19 ms
[2023-03-24 15:02:59] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 360 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-24 15:02:59] [INFO ] Invariant cache hit.
[2023-03-24 15:03:01] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1196 ms returned sat
[2023-03-24 15:03:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 15:03:05] [INFO ] [Real]Absence check using state equation in 3905 ms returned sat
[2023-03-24 15:03:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 15:03:07] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1152 ms returned sat
[2023-03-24 15:03:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 15:03:19] [INFO ] [Nat]Absence check using state equation in 12180 ms returned sat
[2023-03-24 15:03:19] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 19 ms.
[2023-03-24 15:03:20] [INFO ] Added : 57 causal constraints over 12 iterations in 917 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 400 out of 1336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 42 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-24 15:03:20] [INFO ] Invariant cache hit.
[2023-03-24 15:03:21] [INFO ] Implicit Places using invariants in 1065 ms returned []
[2023-03-24 15:03:21] [INFO ] Invariant cache hit.
[2023-03-24 15:03:23] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2879 ms to find 0 implicit places.
[2023-03-24 15:03:23] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-24 15:03:23] [INFO ] Invariant cache hit.
[2023-03-24 15:03:23] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3519 ms. Remains : 1336/1336 places, 294/294 transitions.
Computed a total of 1336 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 294
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) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 217 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-24 15:03:24] [INFO ] Invariant cache hit.
[2023-03-24 15:03:26] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1234 ms returned sat
[2023-03-24 15:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 15:03:30] [INFO ] [Real]Absence check using state equation in 4047 ms returned sat
[2023-03-24 15:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 15:03:32] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1206 ms returned sat
[2023-03-24 15:03:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 15:03:44] [INFO ] [Nat]Absence check using state equation in 12211 ms returned sat
[2023-03-24 15:03:44] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 29 ms.
[2023-03-24 15:03:45] [INFO ] Added : 57 causal constraints over 12 iterations in 841 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 6267 reset in 981 ms.
Product exploration explored 100000 steps with 6233 reset in 991 ms.
Support contains 400 out of 1336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 47 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-24 15:03:47] [INFO ] Invariant cache hit.
[2023-03-24 15:03:48] [INFO ] Implicit Places using invariants in 1092 ms returned []
[2023-03-24 15:03:48] [INFO ] Invariant cache hit.
[2023-03-24 15:03:50] [INFO ] Implicit Places using invariants and state equation in 1963 ms returned []
Implicit Place search using SMT with State Equation took 3060 ms to find 0 implicit places.
[2023-03-24 15:03:50] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-24 15:03:50] [INFO ] Invariant cache hit.
[2023-03-24 15:03:51] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3679 ms. Remains : 1336/1336 places, 294/294 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-00 finished in 62921 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))||(F(p0)&&F((p1||G(p2))))))'
Support contains 382 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 971 are kept as prefixes of interest. Removing 390 places using SCC suffix rule.4 ms
Discarding 390 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 971 transition count 283
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 941 transition count 223
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 941 transition count 223
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 941 transition count 223
Applied a total of 68 rules in 67 ms. Remains 941 /1361 variables (removed 420) and now considering 223/296 (removed 73) transitions.
// Phase 1: matrix 223 rows 941 cols
[2023-03-24 15:03:51] [INFO ] Computed 720 place invariants in 3 ms
[2023-03-24 15:03:52] [INFO ] Implicit Places using invariants in 616 ms returned []
[2023-03-24 15:03:52] [INFO ] Invariant cache hit.
[2023-03-24 15:03:53] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned [416]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1729 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/1361 places, 223/296 transitions.
Applied a total of 0 rules in 21 ms. Remains 940 /940 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1817 ms. Remains : 940/1361 places, 223/296 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10672 reset in 908 ms.
Product exploration explored 100000 steps with 10571 reset in 951 ms.
Computed a total of 940 stabilizing places and 223 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 940 transition count 223
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) (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (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 (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 504 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 391 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 223 rows 940 cols
[2023-03-24 15:03:56] [INFO ] Computed 720 place invariants in 6 ms
[2023-03-24 15:03:57] [INFO ] [Real]Absence check using 0 positive and 720 generalized place invariants in 140 ms returned sat
[2023-03-24 15:03:57] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 15:03:57] [INFO ] [Nat]Absence check using 0 positive and 720 generalized place invariants in 122 ms returned sat
[2023-03-24 15:04:02] [INFO ] After 5241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 15:04:03] [INFO ] After 6364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1300 ms.
[2023-03-24 15:04:05] [INFO ] After 7971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 68 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (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 (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 9 factoid took 587 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 382 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 223/223 transitions.
Applied a total of 0 rules in 14 ms. Remains 940 /940 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-24 15:04:05] [INFO ] Invariant cache hit.
[2023-03-24 15:04:06] [INFO ] Implicit Places using invariants in 695 ms returned []
[2023-03-24 15:04:06] [INFO ] Invariant cache hit.
[2023-03-24 15:04:07] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1730 ms to find 0 implicit places.
[2023-03-24 15:04:07] [INFO ] Invariant cache hit.
[2023-03-24 15:04:08] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2114 ms. Remains : 940/940 places, 223/223 transitions.
Computed a total of 940 stabilizing places and 223 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 940 transition count 223
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 539 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 391 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 15:04:09] [INFO ] Invariant cache hit.
[2023-03-24 15:04:09] [INFO ] [Real]Absence check using 0 positive and 720 generalized place invariants in 128 ms returned sat
[2023-03-24 15:04:09] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 15:04:10] [INFO ] [Nat]Absence check using 0 positive and 720 generalized place invariants in 137 ms returned sat
[2023-03-24 15:04:15] [INFO ] After 5040ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 15:04:17] [INFO ] After 7639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2600 ms.
[2023-03-24 15:04:20] [INFO ] After 10586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 406 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10622 reset in 822 ms.
Product exploration explored 100000 steps with 10649 reset in 853 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 382 out of 940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 940/940 places, 223/223 transitions.
Applied a total of 0 rules in 42 ms. Remains 940 /940 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2023-03-24 15:04:23] [INFO ] Redundant transitions in 37 ms returned [189]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 222 rows 940 cols
[2023-03-24 15:04:23] [INFO ] Computed 720 place invariants in 8 ms
[2023-03-24 15:04:23] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/940 places, 222/223 transitions.
Graph (complete) has 8560 edges and 940 vertex of which 578 are kept as prefixes of interest. Removing 362 places using SCC suffix rule.2 ms
Discarding 362 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 560 transition count 185
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 560 transition count 185
Applied a total of 37 rules in 14 ms. Remains 560 /940 variables (removed 380) and now considering 185/222 (removed 37) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 560/940 places, 185/223 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 636 ms. Remains : 560/940 places, 185/223 transitions.
Support contains 382 out of 940 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 940/940 places, 223/223 transitions.
Applied a total of 0 rules in 8 ms. Remains 940 /940 variables (removed 0) and now considering 223/223 (removed 0) transitions.
// Phase 1: matrix 223 rows 940 cols
[2023-03-24 15:04:23] [INFO ] Computed 720 place invariants in 19 ms
[2023-03-24 15:04:24] [INFO ] Implicit Places using invariants in 782 ms returned []
[2023-03-24 15:04:24] [INFO ] Invariant cache hit.
[2023-03-24 15:04:25] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
[2023-03-24 15:04:25] [INFO ] Invariant cache hit.
[2023-03-24 15:04:26] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2264 ms. Remains : 940/940 places, 223/223 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-01 finished in 34530 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(p0)&&F(!p0)))'
Support contains 20 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1338 transition count 296
Applied a total of 23 rules in 42 ms. Remains 1338 /1361 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-24 15:04:26] [INFO ] Computed 1044 place invariants in 78 ms
[2023-03-24 15:04:27] [INFO ] Implicit Places using invariants in 1505 ms returned []
[2023-03-24 15:04:27] [INFO ] Invariant cache hit.
[2023-03-24 15:04:30] [INFO ] Implicit Places using invariants and state equation in 2705 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4233 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1361 places, 296/296 transitions.
Applied a total of 0 rules in 30 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4305 ms. Remains : 1337/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), p0, true]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s1236 s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1269 s1270 s1271 s1272) s1268)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 2 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-02 finished in 4496 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((p0||F(p1)))&&F(G(!p0))))'
Support contains 40 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 1337 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1336 transition count 293
Applied a total of 3 rules in 88 ms. Remains 1336 /1361 variables (removed 25) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1336 cols
[2023-03-24 15:04:30] [INFO ] Computed 1045 place invariants in 11 ms
[2023-03-24 15:04:32] [INFO ] Implicit Places using invariants in 1519 ms returned []
[2023-03-24 15:04:32] [INFO ] Invariant cache hit.
[2023-03-24 15:04:34] [INFO ] Implicit Places using invariants and state equation in 2479 ms returned [830]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4037 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1361 places, 293/296 transitions.
Applied a total of 0 rules in 50 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4176 ms. Remains : 1335/1361 places, 293/296 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s472 s473 s474 s475 s478 s479 s536 s537 s538 s539 s540 s541 s542 s543 s544 s548 s549 s550 s551) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 ...], 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 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-04 finished in 4332 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(p0)||G(F(!p0))))'
Support contains 1 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 1 are kept as prefixes of interest. Removing 1360 places using SCC suffix rule.2 ms
Discarding 1360 places :
Also discarding 295 output transitions
Drop transitions removed 295 transitions
Applied a total of 1 rules in 3 ms. Remains 1 /1361 variables (removed 1360) and now considering 1/296 (removed 295) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-24 15:04:34] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-24 15:04:35] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-24 15:04:35] [INFO ] Invariant cache hit.
[2023-03-24 15:04:35] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-24 15:04:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-24 15:04:35] [INFO ] Invariant cache hit.
[2023-03-24 15:04:35] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/1361 places, 1/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 1/1361 places, 1/296 transitions.
Stuttering acceptance computed with spot in 157 ms :[false, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-05 finished in 621 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(X((p0&&X(F(!p0))&&F(p1))))))'
Support contains 39 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1338 transition count 296
Applied a total of 23 rules in 39 ms. Remains 1338 /1361 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-24 15:04:35] [INFO ] Computed 1044 place invariants in 18 ms
[2023-03-24 15:04:37] [INFO ] Implicit Places using invariants in 1434 ms returned []
[2023-03-24 15:04:37] [INFO ] Invariant cache hit.
[2023-03-24 15:04:39] [INFO ] Implicit Places using invariants and state equation in 2636 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4077 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1361 places, 296/296 transitions.
Applied a total of 0 rules in 32 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4148 ms. Remains : 1337/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, true, true, true, true, p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 2 (ADD s1236 s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1269 s1270 s1271 s1272)), p1:(LEQ s146 (ADD s20 ...], nbAcceptance=0, 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-06 finished in 4478 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)))'
Support contains 19 out of 1361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 970 are kept as prefixes of interest. Removing 391 places using SCC suffix rule.6 ms
Discarding 391 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 969 transition count 282
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 939 transition count 222
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 939 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 937 transition count 220
Applied a total of 71 rules in 108 ms. Remains 937 /1361 variables (removed 424) and now considering 220/296 (removed 76) transitions.
// Phase 1: matrix 220 rows 937 cols
[2023-03-24 15:04:40] [INFO ] Computed 720 place invariants in 5 ms
[2023-03-24 15:04:41] [INFO ] Implicit Places using invariants in 954 ms returned []
[2023-03-24 15:04:41] [INFO ] Invariant cache hit.
[2023-03-24 15:04:42] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned [413, 757, 758, 759, 760, 761, 762, 765, 766, 767, 768, 769, 770, 771, 772, 897, 898, 899, 900, 903]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 2596 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 917/1361 places, 220/296 transitions.
Applied a total of 0 rules in 28 ms. Remains 917 /917 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2732 ms. Remains : 917/1361 places, 220/296 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s822 s823 s824 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s854 s855 s856 s857))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-07 finished in 2820 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((p0 U G(p1)))))'
Support contains 3 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1339 transition count 296
Applied a total of 22 rules in 39 ms. Remains 1339 /1361 variables (removed 22) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-24 15:04:42] [INFO ] Computed 1045 place invariants in 20 ms
[2023-03-24 15:04:44] [INFO ] Implicit Places using invariants in 1503 ms returned []
[2023-03-24 15:04:44] [INFO ] Invariant cache hit.
[2023-03-24 15:04:47] [INFO ] Implicit Places using invariants and state equation in 2772 ms returned [814]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4282 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1361 places, 296/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4374 ms. Remains : 1338/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LEQ 3 s19) (LEQ 1 s19)), p0:(GT s55 s1337)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-09 finished in 4563 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 3 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1338 transition count 296
Applied a total of 23 rules in 42 ms. Remains 1338 /1361 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-24 15:04:47] [INFO ] Computed 1044 place invariants in 11 ms
[2023-03-24 15:04:48] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2023-03-24 15:04:48] [INFO ] Invariant cache hit.
[2023-03-24 15:04:51] [INFO ] Implicit Places using invariants and state equation in 2146 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3605 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1361 places, 296/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3694 ms. Remains : 1337/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-10 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:(OR (LEQ s1319 s66) (LEQ 2 s0))], 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]]
Product exploration explored 100000 steps with 4413 reset in 364 ms.
Product exploration explored 100000 steps with 4418 reset in 302 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1692890 steps, run timeout after 3001 ms. (steps per millisecond=564 ) properties seen :{}
Probabilistic random walk after 1692890 steps, saw 239759 distinct states, run finished after 3002 ms. (steps per millisecond=563 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-24 15:04:55] [INFO ] Computed 1044 place invariants in 100 ms
[2023-03-24 15:04:55] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 15:04:56] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 184 ms returned sat
[2023-03-24 15:04:56] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 15:04:56] [INFO ] After 650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-24 15:04:56] [INFO ] After 1128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 29 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-24 15:04:57] [INFO ] Invariant cache hit.
[2023-03-24 15:04:58] [INFO ] Implicit Places using invariants in 1335 ms returned []
[2023-03-24 15:04:58] [INFO ] Invariant cache hit.
[2023-03-24 15:05:01] [INFO ] Implicit Places using invariants and state equation in 2326 ms returned []
Implicit Place search using SMT with State Equation took 3684 ms to find 0 implicit places.
[2023-03-24 15:05:01] [INFO ] Invariant cache hit.
[2023-03-24 15:05:01] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4240 ms. Remains : 1337/1337 places, 296/296 transitions.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 438 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1676228 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :{}
Probabilistic random walk after 1676228 steps, saw 237765 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 15:05:05] [INFO ] Invariant cache hit.
[2023-03-24 15:05:05] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 15:05:05] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 181 ms returned sat
[2023-03-24 15:05:06] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 15:05:06] [INFO ] After 759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-24 15:05:06] [INFO ] After 1182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4417 reset in 231 ms.
Product exploration explored 100000 steps with 4421 reset in 253 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Graph (complete) has 8669 edges and 1337 vertex of which 1317 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1317 transition count 296
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 103 ms. Remains 1317 /1337 variables (removed 20) and now considering 296/296 (removed 0) transitions.
[2023-03-24 15:05:07] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 296 rows 1317 cols
[2023-03-24 15:05:07] [INFO ] Computed 1026 place invariants in 107 ms
[2023-03-24 15:05:08] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1317/1337 places, 296/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 807 ms. Remains : 1317/1337 places, 296/296 transitions.
Support contains 3 out of 1337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1337/1337 places, 296/296 transitions.
Applied a total of 0 rules in 33 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-24 15:05:08] [INFO ] Computed 1044 place invariants in 109 ms
[2023-03-24 15:05:09] [INFO ] Implicit Places using invariants in 1494 ms returned []
[2023-03-24 15:05:09] [INFO ] Invariant cache hit.
[2023-03-24 15:05:12] [INFO ] Implicit Places using invariants and state equation in 2235 ms returned []
Implicit Place search using SMT with State Equation took 3746 ms to find 0 implicit places.
[2023-03-24 15:05:12] [INFO ] Invariant cache hit.
[2023-03-24 15:05:12] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4281 ms. Remains : 1337/1337 places, 296/296 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-10 finished in 25266 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((p0||(p1&&G(p2)))))'
Support contains 5 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1339 transition count 296
Applied a total of 22 rules in 33 ms. Remains 1339 /1361 variables (removed 22) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-24 15:05:12] [INFO ] Computed 1045 place invariants in 24 ms
[2023-03-24 15:05:14] [INFO ] Implicit Places using invariants in 1507 ms returned []
[2023-03-24 15:05:14] [INFO ] Invariant cache hit.
[2023-03-24 15:05:16] [INFO ] Implicit Places using invariants and state equation in 2533 ms returned [814]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4044 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1361 places, 296/296 transitions.
Applied a total of 0 rules in 34 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4111 ms. Remains : 1338/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(LEQ 1 s52), p0:(GT s37 s1296), p1:(LEQ s147 s1159)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 69 steps with 34 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-12 finished in 4286 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((F(p0)&&X(p1))))))'
Support contains 3 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1338 transition count 296
Applied a total of 23 rules in 34 ms. Remains 1338 /1361 variables (removed 23) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-24 15:05:17] [INFO ] Computed 1044 place invariants in 18 ms
[2023-03-24 15:05:18] [INFO ] Implicit Places using invariants in 1505 ms returned []
[2023-03-24 15:05:18] [INFO ] Invariant cache hit.
[2023-03-24 15:05:21] [INFO ] Implicit Places using invariants and state equation in 2480 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3988 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1361 places, 296/296 transitions.
Applied a total of 0 rules in 31 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4055 ms. Remains : 1337/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s125 s736), p1:(LEQ 1 s541)], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-13 finished in 4284 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(p0)||X(G(!p0))))'
Support contains 2 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1339 transition count 296
Applied a total of 22 rules in 33 ms. Remains 1339 /1361 variables (removed 22) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2023-03-24 15:05:21] [INFO ] Computed 1044 place invariants in 19 ms
[2023-03-24 15:05:22] [INFO ] Implicit Places using invariants in 1499 ms returned []
[2023-03-24 15:05:22] [INFO ] Invariant cache hit.
[2023-03-24 15:05:25] [INFO ] Implicit Places using invariants and state equation in 2843 ms returned [813]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4346 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1361 places, 296/296 transitions.
Applied a total of 0 rules in 33 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4413 ms. Remains : 1338/1361 places, 296/296 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s1269 s1120)], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4418 reset in 226 ms.
Product exploration explored 100000 steps with 4419 reset in 256 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 5 states, 9 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1756140 steps, run timeout after 3001 ms. (steps per millisecond=585 ) properties seen :{}
Probabilistic random walk after 1756140 steps, saw 249189 distinct states, run finished after 3001 ms. (steps per millisecond=585 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-24 15:05:30] [INFO ] Computed 1044 place invariants in 28 ms
[2023-03-24 15:05:30] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 15:05:30] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 211 ms returned sat
[2023-03-24 15:05:31] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 15:05:31] [INFO ] After 509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-24 15:05:31] [INFO ] After 961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 35 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-24 15:05:31] [INFO ] Invariant cache hit.
[2023-03-24 15:05:33] [INFO ] Implicit Places using invariants in 1462 ms returned []
[2023-03-24 15:05:33] [INFO ] Invariant cache hit.
[2023-03-24 15:05:35] [INFO ] Implicit Places using invariants and state equation in 2536 ms returned []
Implicit Place search using SMT with State Equation took 4022 ms to find 0 implicit places.
[2023-03-24 15:05:35] [INFO ] Invariant cache hit.
[2023-03-24 15:05:36] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4581 ms. Remains : 1338/1338 places, 296/296 transitions.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 441 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1771673 steps, run timeout after 3001 ms. (steps per millisecond=590 ) properties seen :{}
Probabilistic random walk after 1771673 steps, saw 251039 distinct states, run finished after 3001 ms. (steps per millisecond=590 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 15:05:39] [INFO ] Invariant cache hit.
[2023-03-24 15:05:39] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 15:05:40] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 199 ms returned sat
[2023-03-24 15:05:40] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 15:05:40] [INFO ] After 455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-24 15:05:40] [INFO ] After 900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4416 reset in 225 ms.
Product exploration explored 100000 steps with 4416 reset in 248 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1338 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Graph (complete) has 8689 edges and 1338 vertex of which 970 are kept as prefixes of interest. Removing 368 places using SCC suffix rule.5 ms
Discarding 368 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 970 transition count 283
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 940 transition count 223
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 940 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 940 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 69 rules in 69 ms. Remains 940 /1338 variables (removed 398) and now considering 225/296 (removed 71) transitions.
[2023-03-24 15:05:42] [INFO ] Redundant transitions in 55 ms returned [188]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 224 rows 940 cols
[2023-03-24 15:05:42] [INFO ] Computed 720 place invariants in 3 ms
[2023-03-24 15:05:42] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 940/1338 places, 224/296 transitions.
Graph (complete) has 8955 edges and 940 vertex of which 597 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.2 ms
Discarding 343 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 597 transition count 224
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 597 transition count 224
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 20 place count 580 transition count 190
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 37 place count 580 transition count 190
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 37 rules in 22 ms. Remains 580 /940 variables (removed 360) and now considering 190/224 (removed 34) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 580/1338 places, 190/296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 716 ms. Remains : 580/1338 places, 190/296 transitions.
Support contains 2 out of 1338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1338/1338 places, 296/296 transitions.
Applied a total of 0 rules in 28 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1338 cols
[2023-03-24 15:05:42] [INFO ] Computed 1044 place invariants in 27 ms
[2023-03-24 15:05:44] [INFO ] Implicit Places using invariants in 1500 ms returned []
[2023-03-24 15:05:44] [INFO ] Invariant cache hit.
[2023-03-24 15:05:46] [INFO ] Implicit Places using invariants and state equation in 2289 ms returned []
Implicit Place search using SMT with State Equation took 3807 ms to find 0 implicit places.
[2023-03-24 15:05:46] [INFO ] Invariant cache hit.
[2023-03-24 15:05:46] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4344 ms. Remains : 1338/1338 places, 296/296 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-14 finished in 25673 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(((p1 U (p2||G(p1)))||p0)))'
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))||(F(p0)&&F((p1||G(p2))))))'
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)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-18-LTLCardinality-10
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 1318 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.8 ms
Discarding 43 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1315 transition count 291
Applied a total of 5 rules in 81 ms. Remains 1315 /1361 variables (removed 46) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1315 cols
[2023-03-24 15:05:47] [INFO ] Computed 1026 place invariants in 10 ms
[2023-03-24 15:05:49] [INFO ] Implicit Places using invariants in 1599 ms returned []
[2023-03-24 15:05:49] [INFO ] Invariant cache hit.
[2023-03-24 15:05:51] [INFO ] Implicit Places using invariants and state equation in 2358 ms returned [810, 1154, 1155, 1156, 1157, 1158, 1159, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1275, 1276, 1277, 1278, 1281]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 3980 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1295/1361 places, 291/296 transitions.
Applied a total of 0 rules in 38 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4101 ms. Remains : 1295/1361 places, 291/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-10 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:(OR (LEQ s1277 s66) (LEQ 2 s0))], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4211 reset in 252 ms.
Product exploration explored 100000 steps with 4210 reset in 267 ms.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 421 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1994786 steps, run timeout after 3001 ms. (steps per millisecond=664 ) properties seen :{}
Probabilistic random walk after 1994786 steps, saw 274851 distinct states, run finished after 3001 ms. (steps per millisecond=664 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 291 rows 1295 cols
[2023-03-24 15:05:55] [INFO ] Computed 1008 place invariants in 72 ms
[2023-03-24 15:05:55] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 15:05:56] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 182 ms returned sat
[2023-03-24 15:05:56] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 15:05:56] [INFO ] After 707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-24 15:05:56] [INFO ] After 1158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 26 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-24 15:05:57] [INFO ] Invariant cache hit.
[2023-03-24 15:05:58] [INFO ] Implicit Places using invariants in 1360 ms returned []
[2023-03-24 15:05:58] [INFO ] Invariant cache hit.
[2023-03-24 15:06:01] [INFO ] Implicit Places using invariants and state equation in 2223 ms returned []
Implicit Place search using SMT with State Equation took 3630 ms to find 0 implicit places.
[2023-03-24 15:06:01] [INFO ] Invariant cache hit.
[2023-03-24 15:06:01] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4150 ms. Remains : 1295/1295 places, 291/291 transitions.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 420 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2040249 steps, run timeout after 3001 ms. (steps per millisecond=679 ) properties seen :{}
Probabilistic random walk after 2040249 steps, saw 281174 distinct states, run finished after 3001 ms. (steps per millisecond=679 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 15:06:05] [INFO ] Invariant cache hit.
[2023-03-24 15:06:05] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 15:06:05] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 188 ms returned sat
[2023-03-24 15:06:06] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 15:06:06] [INFO ] After 571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-24 15:06:06] [INFO ] After 1157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4218 reset in 260 ms.
Product exploration explored 100000 steps with 4212 reset in 267 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 41 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-24 15:06:07] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-24 15:06:07] [INFO ] Invariant cache hit.
[2023-03-24 15:06:08] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 614 ms. Remains : 1295/1295 places, 291/291 transitions.
Support contains 3 out of 1295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 26 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-24 15:06:08] [INFO ] Invariant cache hit.
[2023-03-24 15:06:09] [INFO ] Implicit Places using invariants in 1372 ms returned []
[2023-03-24 15:06:09] [INFO ] Invariant cache hit.
[2023-03-24 15:06:11] [INFO ] Implicit Places using invariants and state equation in 2221 ms returned []
Implicit Place search using SMT with State Equation took 3634 ms to find 0 implicit places.
[2023-03-24 15:06:11] [INFO ] Invariant cache hit.
[2023-03-24 15:06:12] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4167 ms. Remains : 1295/1295 places, 291/291 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-10 finished in 25295 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(p0)||X(G(!p0))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-18-LTLCardinality-14
Stuttering acceptance computed with spot in 155 ms :[true, p0, (NOT p0), false, false]
Support contains 2 out of 1361 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1361/1361 places, 296/296 transitions.
Graph (complete) has 9229 edges and 1361 vertex of which 971 are kept as prefixes of interest. Removing 390 places using SCC suffix rule.5 ms
Discarding 390 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 970 transition count 282
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 940 transition count 222
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 940 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 938 transition count 220
Applied a total of 71 rules in 72 ms. Remains 938 /1361 variables (removed 423) and now considering 220/296 (removed 76) transitions.
// Phase 1: matrix 220 rows 938 cols
[2023-03-24 15:06:12] [INFO ] Computed 720 place invariants in 4 ms
[2023-03-24 15:06:13] [INFO ] Implicit Places using invariants in 882 ms returned []
[2023-03-24 15:06:13] [INFO ] Invariant cache hit.
[2023-03-24 15:06:15] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned [413, 757, 758, 759, 760, 761, 762, 765, 766, 767, 768, 769, 770, 771, 772, 898, 899, 900, 901, 904]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 2624 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 918/1361 places, 220/296 transitions.
Applied a total of 0 rules in 23 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2721 ms. Remains : 918/1361 places, 220/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s854 s720)], 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4156 reset in 255 ms.
Product exploration explored 100000 steps with 4154 reset in 270 ms.
Computed a total of 918 stabilizing places and 220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 918 transition count 220
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 332 ms. Reduced automaton from 5 states, 9 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 388 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2240060 steps, run timeout after 3001 ms. (steps per millisecond=746 ) properties seen :{}
Probabilistic random walk after 2240060 steps, saw 305896 distinct states, run finished after 3002 ms. (steps per millisecond=746 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 918 cols
[2023-03-24 15:06:19] [INFO ] Computed 702 place invariants in 11 ms
[2023-03-24 15:06:19] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 15:06:20] [INFO ] [Nat]Absence check using 0 positive and 702 generalized place invariants in 120 ms returned sat
[2023-03-24 15:06:20] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 15:06:20] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-24 15:06:20] [INFO ] After 612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 918 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 14 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-24 15:06:20] [INFO ] Invariant cache hit.
[2023-03-24 15:06:21] [INFO ] Implicit Places using invariants in 948 ms returned []
[2023-03-24 15:06:21] [INFO ] Invariant cache hit.
[2023-03-24 15:06:23] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned []
Implicit Place search using SMT with State Equation took 2582 ms to find 0 implicit places.
[2023-03-24 15:06:23] [INFO ] Invariant cache hit.
[2023-03-24 15:06:23] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2955 ms. Remains : 918/918 places, 220/220 transitions.
Computed a total of 918 stabilizing places and 220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 918 transition count 220
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), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 386 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2181620 steps, run timeout after 3001 ms. (steps per millisecond=726 ) properties seen :{}
Probabilistic random walk after 2181620 steps, saw 297328 distinct states, run finished after 3001 ms. (steps per millisecond=726 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 15:06:27] [INFO ] Invariant cache hit.
[2023-03-24 15:06:27] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 15:06:27] [INFO ] [Nat]Absence check using 0 positive and 702 generalized place invariants in 148 ms returned sat
[2023-03-24 15:06:27] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 15:06:28] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-24 15:06:28] [INFO ] After 653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4155 reset in 258 ms.
Product exploration explored 100000 steps with 4160 reset in 275 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 23 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-24 15:06:29] [INFO ] Redundant transitions in 21 ms returned [183]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 219 rows 918 cols
[2023-03-24 15:06:29] [INFO ] Computed 702 place invariants in 4 ms
[2023-03-24 15:06:29] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 918/918 places, 219/220 transitions.
Graph (complete) has 8857 edges and 918 vertex of which 575 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.4 ms
Discarding 343 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 575 transition count 219
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 575 transition count 219
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 20 place count 558 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 37 place count 558 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 37 rules in 20 ms. Remains 558 /918 variables (removed 360) and now considering 185/219 (removed 34) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 558/918 places, 185/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 467 ms. Remains : 558/918 places, 185/220 transitions.
Support contains 2 out of 918 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 14 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
// Phase 1: matrix 220 rows 918 cols
[2023-03-24 15:06:29] [INFO ] Computed 702 place invariants in 2 ms
[2023-03-24 15:06:30] [INFO ] Implicit Places using invariants in 876 ms returned []
[2023-03-24 15:06:30] [INFO ] Invariant cache hit.
[2023-03-24 15:06:32] [INFO ] Implicit Places using invariants and state equation in 1595 ms returned []
Implicit Place search using SMT with State Equation took 2498 ms to find 0 implicit places.
[2023-03-24 15:06:32] [INFO ] Invariant cache hit.
[2023-03-24 15:06:32] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2855 ms. Remains : 918/918 places, 220/220 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-14 finished in 20101 ms.
[2023-03-24 15:06:32] [INFO ] Flatten gal took : 48 ms
[2023-03-24 15:06:32] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-24 15:06:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1361 places, 296 transitions and 3082 arcs took 4 ms.
Total runtime 256541 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2102/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 16028172 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16086324 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2102/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 16022612 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16078912 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2102/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2102/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : QuasiCertifProtocol-PT-18-LTLCardinality-00
Could not compute solution for formula : QuasiCertifProtocol-PT-18-LTLCardinality-01
Could not compute solution for formula : QuasiCertifProtocol-PT-18-LTLCardinality-10
Could not compute solution for formula : QuasiCertifProtocol-PT-18-LTLCardinality-14

BK_STOP 1679672180925

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name QuasiCertifProtocol-PT-18-LTLCardinality-00
ltl formula formula --ltl=/tmp/2102/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1361 places, 296 transitions and 3082 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2102/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2102/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2102/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2102/ltl_0_
Killing (15) : 2108 2109 2110 2111 2112
Killing (9) : 2108 2109 2110 2111 2112
ltl formula name QuasiCertifProtocol-PT-18-LTLCardinality-01
ltl formula formula --ltl=/tmp/2102/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1361 places, 296 transitions and 3082 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2102/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2102/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2102/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2102/ltl_1_
Killing (15) : 2193 2194 2195 2196 2197
Killing (9) : 2193 2194 2195 2196 2197
ltl formula name QuasiCertifProtocol-PT-18-LTLCardinality-10
ltl formula formula --ltl=/tmp/2102/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1361 places, 296 transitions and 3082 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2102/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2102/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2102/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2102/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x564dd6afb3f4]
1: pnml2lts-mc(+0xa2496) [0x564dd6afb496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7ff8b5bc3140]
3: pnml2lts-mc(+0x405be5) [0x564dd6e5ebe5]
4: pnml2lts-mc(+0x16b3f9) [0x564dd6bc43f9]
5: pnml2lts-mc(+0x164ac4) [0x564dd6bbdac4]
6: pnml2lts-mc(+0x272e0a) [0x564dd6ccbe0a]
7: pnml2lts-mc(+0xb61f0) [0x564dd6b0f1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7ff8b5a164d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7ff8b5a1667a]
10: pnml2lts-mc(+0xa1581) [0x564dd6afa581]
11: pnml2lts-mc(+0xa1910) [0x564dd6afa910]
12: pnml2lts-mc(+0xa32a2) [0x564dd6afc2a2]
13: pnml2lts-mc(+0xa50f4) [0x564dd6afe0f4]
14: pnml2lts-mc(+0x3f34b3) [0x564dd6e4c4b3]
15: pnml2lts-mc(+0x7c63d) [0x564dd6ad563d]
16: pnml2lts-mc(+0x67d86) [0x564dd6ac0d86]
17: pnml2lts-mc(+0x60a8a) [0x564dd6ab9a8a]
18: pnml2lts-mc(+0x5eb15) [0x564dd6ab7b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7ff8b59fed0a]
20: pnml2lts-mc(+0x6075e) [0x564dd6ab975e]
ltl formula name QuasiCertifProtocol-PT-18-LTLCardinality-14
ltl formula formula --ltl=/tmp/2102/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1361 places, 296 transitions and 3082 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.030 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2102/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2102/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2102/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2102/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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="QuasiCertifProtocol-PT-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-PT-18, 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 r297-tall-167873951100883"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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