Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r311-tall-171662335800067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is QuasiCertifProtocol-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 78K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716655170150

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:39:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 16:39:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:39:31] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-25 16:39:31] [INFO ] Transformed 270 places.
[2024-05-25 16:39:31] [INFO ] Transformed 116 transitions.
[2024-05-25 16:39:31] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 195 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 258 transition count 116
Applied a total of 12 rules in 19 ms. Remains 258 /270 variables (removed 12) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 258 cols
[2024-05-25 16:39:31] [INFO ] Computed 143 invariants in 13 ms
[2024-05-25 16:39:31] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-25 16:39:31] [INFO ] Invariant cache hit.
[2024-05-25 16:39:32] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-25 16:39:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 5/256 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 116/374 variables, 258/401 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 401 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4847 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 5/256 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 116/374 variables, 258/401 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 108/509 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 509 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5965 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 10923ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10941ms
Starting structural reductions in LTL mode, iteration 1 : 258/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11483 ms. Remains : 258/270 places, 116/116 transitions.
Support contains 195 out of 258 places after structural reductions.
[2024-05-25 16:39:43] [INFO ] Flatten gal took : 40 ms
[2024-05-25 16:39:43] [INFO ] Flatten gal took : 17 ms
[2024-05-25 16:39:43] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 40000 steps (3933 resets) in 2075 ms. (19 steps per ms) remains 21/31 properties
BEST_FIRST walk for 4003 steps (71 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (68 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (70 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (65 resets) in 18 ms. (210 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (69 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (70 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (65 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (88 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (69 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (67 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (70 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (69 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (66 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (71 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (69 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (69 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (72 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (69 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (69 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
[2024-05-25 16:39:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 2 (OVERLAPS) 5/147 variables, 2/38 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/38 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 47/194 variables, 58/96 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 50/244 variables, 41/137 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/137 constraints. Problems are: Problem set: 3 solved, 17 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 8 (OVERLAPS) 116/360 variables, 244/381 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/381 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 14/374 variables, 14/395 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 6/401 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/401 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/401 constraints. Problems are: Problem set: 7 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 401 constraints, problems are : Problem set: 7 solved, 13 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 36/36 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/36 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 5/146 variables, 2/38 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/38 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 44/190 variables, 57/95 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/95 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 40/230 variables, 36/131 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/131 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 116/346 variables, 230/361 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 8/369 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/369 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 28/374 variables, 28/397 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 12/409 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 5/414 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/414 constraints. Problems are: Problem set: 7 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/374 variables, 0/414 constraints. Problems are: Problem set: 7 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 414 constraints, problems are : Problem set: 7 solved, 13 unsolved in 2225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 141/141 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 13/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 3120ms problems are : Problem set: 7 solved, 13 unsolved
Fused 13 Parikh solutions to 10 different solutions.
Finished Parikh walk after 47 steps, including 0 resets, run visited all 13 properties in 7 ms. (steps per millisecond=6 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 15 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 258 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 258 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&G(F(p2)))))'
Support contains 65 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 252 transition count 115
Applied a total of 2 rules in 40 ms. Remains 252 /258 variables (removed 6) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 252 cols
[2024-05-25 16:39:47] [INFO ] Computed 138 invariants in 6 ms
[2024-05-25 16:39:47] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-25 16:39:47] [INFO ] Invariant cache hit.
[2024-05-25 16:39:48] [INFO ] Implicit Places using invariants and state equation in 219 ms returned [148, 149, 150, 151, 155, 160, 161, 198, 199, 223, 224, 225, 226, 227]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 367 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 238/258 places, 115/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 238 /238 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 415 ms. Remains : 238/258 places, 115/116 transitions.
Stuttering acceptance computed with spot in 502 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-00
Product exploration explored 100000 steps with 10263 reset in 298 ms.
Product exploration explored 100000 steps with 10261 reset in 218 ms.
Computed a total of 238 stabilizing places and 115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 115
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 571 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (4090 resets) in 271 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (495 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 171851 steps, run visited all 1 properties in 217 ms. (steps per millisecond=791 )
Probabilistic random walk after 171851 steps, saw 29132 distinct states, run finished after 220 ms. (steps per millisecond=781 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 14 factoid took 627 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p2)]
Support contains 50 out of 238 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 115/115 transitions.
Applied a total of 0 rules in 15 ms. Remains 238 /238 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 238 cols
[2024-05-25 16:39:51] [INFO ] Computed 126 invariants in 7 ms
[2024-05-25 16:39:51] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-25 16:39:51] [INFO ] Invariant cache hit.
[2024-05-25 16:39:51] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-25 16:39:51] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-25 16:39:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 115/345 variables, 230/356 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 8/353 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 364 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3540 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 115/345 variables, 230/356 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 91/447 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 8/353 variables, 8/455 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 9/464 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 464 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6683 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 10273ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 10274ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10601 ms. Remains : 238/238 places, 115/115 transitions.
Computed a total of 238 stabilizing places and 115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 115
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (4105 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (499 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 171851 steps, run visited all 1 properties in 190 ms. (steps per millisecond=904 )
Probabilistic random walk after 171851 steps, saw 29132 distinct states, run finished after 190 ms. (steps per millisecond=904 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10247 reset in 174 ms.
Product exploration explored 100000 steps with 10244 reset in 177 ms.
Support contains 50 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 115/115 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 114
Applied a total of 3 rules in 21 ms. Remains 237 /238 variables (removed 1) and now considering 114/115 (removed 1) transitions.
// Phase 1: matrix 114 rows 237 cols
[2024-05-25 16:40:02] [INFO ] Computed 126 invariants in 8 ms
[2024-05-25 16:40:03] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-25 16:40:03] [INFO ] Invariant cache hit.
[2024-05-25 16:40:03] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-25 16:40:03] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-25 16:40:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 114/343 variables, 229/355 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 8/351 variables, 8/363 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/351 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 363 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3532 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 114/343 variables, 229/355 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 91/446 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 8/351 variables, 8/454 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 8/462 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/351 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 462 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6460 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 10036ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 10037ms
Starting structural reductions in SI_LTL mode, iteration 1 : 237/238 places, 114/115 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10377 ms. Remains : 237/238 places, 114/115 transitions.
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-00 finished in 25628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 49 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 244 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) 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 241 transition count 111
Applied a total of 5 rules in 18 ms. Remains 241 /258 variables (removed 17) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-25 16:40:13] [INFO ] Computed 132 invariants in 3 ms
[2024-05-25 16:40:13] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-25 16:40:13] [INFO ] Invariant cache hit.
[2024-05-25 16:40:13] [INFO ] Implicit Places using invariants and state equation in 197 ms returned [144, 145, 146, 147, 151, 156, 157, 194, 195, 219, 220, 221, 222, 223]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 330 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/258 places, 111/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 354 ms. Remains : 227/258 places, 111/116 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-01
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-01 finished in 396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1 U (G(p1)||(p1&&G(p0))))))))'
Support contains 15 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 173 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.2 ms
Discarding 85 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 172 transition count 84
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 172 transition count 84
Applied a total of 16 rules in 19 ms. Remains 172 /258 variables (removed 86) and now considering 84/116 (removed 32) transitions.
// Phase 1: matrix 84 rows 172 cols
[2024-05-25 16:40:13] [INFO ] Computed 90 invariants in 1 ms
[2024-05-25 16:40:13] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-25 16:40:13] [INFO ] Invariant cache hit.
[2024-05-25 16:40:14] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [127, 128, 150, 151, 152, 153, 154]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 222 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/258 places, 84/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 165 /165 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 248 ms. Remains : 165/258 places, 84/116 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-02
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-02 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0&&X(G((!p0||G(p1)))))) U (p2||X(X(p3)))))'
Support contains 66 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 5 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-05-25 16:40:14] [INFO ] Computed 139 invariants in 4 ms
[2024-05-25 16:40:14] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-25 16:40:14] [INFO ] Invariant cache hit.
[2024-05-25 16:40:14] [INFO ] Implicit Places using invariants and state equation in 202 ms returned [148, 149, 150, 151, 155, 160, 161]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 320 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/258 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 326 ms. Remains : 246/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p3), (AND (NOT p1) p0 (NOT p3)), true, (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 169 ms.
Product exploration explored 100000 steps with 33333 reset in 168 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
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 p2) (NOT p0) p3 p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 22 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-04 finished in 1147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(p1)))))'
Support contains 64 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 173 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.2 ms
Discarding 85 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 173 transition count 85
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 1 with 2 rules applied. Total rules applied 17 place count 172 transition count 84
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 172 transition count 84
Applied a total of 18 rules in 16 ms. Remains 172 /258 variables (removed 86) and now considering 84/116 (removed 32) transitions.
// Phase 1: matrix 84 rows 172 cols
[2024-05-25 16:40:15] [INFO ] Computed 90 invariants in 1 ms
[2024-05-25 16:40:15] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-25 16:40:15] [INFO ] Invariant cache hit.
[2024-05-25 16:40:15] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [81, 82, 83, 84, 87, 92, 93]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 194 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/258 places, 84/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 165 /165 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 213 ms. Remains : 165/258 places, 84/116 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-05
Stuttering criterion allowed to conclude after 672 steps with 62 reset in 4 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-05 finished in 351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(F(p0)&&G(p1))))))'
Support contains 2 out of 258 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 254 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 253 transition count 115
Applied a total of 2 rules in 16 ms. Remains 253 /258 variables (removed 5) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 253 cols
[2024-05-25 16:40:15] [INFO ] Computed 139 invariants in 3 ms
[2024-05-25 16:40:15] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-25 16:40:15] [INFO ] Invariant cache hit.
[2024-05-25 16:40:16] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [149, 150, 151, 152, 156, 161, 162, 199, 200, 224, 225, 226, 227, 228]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 384 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/258 places, 115/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 239 /239 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 406 ms. Remains : 239/258 places, 115/116 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-07
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-07 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 3 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-05-25 16:40:16] [INFO ] Computed 139 invariants in 1 ms
[2024-05-25 16:40:16] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-25 16:40:16] [INFO ] Invariant cache hit.
[2024-05-25 16:40:16] [INFO ] Implicit Places using invariants and state equation in 278 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 421 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/258 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 426 ms. Remains : 246/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-12 finished in 804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X(p0)||F(p1))))))))'
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 5 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-05-25 16:40:16] [INFO ] Computed 138 invariants in 2 ms
[2024-05-25 16:40:17] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-25 16:40:17] [INFO ] Invariant cache hit.
[2024-05-25 16:40:17] [INFO ] Implicit Places using invariants and state equation in 251 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 392 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/258 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 399 ms. Remains : 246/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-15
Product exploration explored 100000 steps with 9835 reset in 184 ms.
Product exploration explored 100000 steps with 9830 reset in 145 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (3935 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (706 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (701 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (712 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1389671 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :2 out of 3
Probabilistic random walk after 1389671 steps, saw 223069 distinct states, run finished after 3007 ms. (steps per millisecond=462 ) properties seen :2
// Phase 1: matrix 116 rows 246 cols
[2024-05-25 16:40:21] [INFO ] Computed 132 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/82 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/93 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/113 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 102/215 variables, 75/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 147/362 variables, 147/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 114/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/362 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 2/362 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 13 ms.
Refiners :[Generalized P Invariants (flows): 0/132 constraints, State Equation: 0/246 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-15 finished in 4706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&G(F(p2)))))'
[2024-05-25 16:40:21] [INFO ] Flatten gal took : 15 ms
[2024-05-25 16:40:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-25 16:40:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 258 places, 116 transitions and 647 arcs took 5 ms.
Total runtime 50608 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-PT-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 258
TRANSITIONS: 116
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.001s]


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


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

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

Process ID: 975
MODEL NAME: /home/mcc/execution/412/model
258 places, 116 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716655259140

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is QuasiCertifProtocol-PT-06, 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 r311-tall-171662335800067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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