Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254600740.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is QuasiCertifProtocol-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254600740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 72K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749123181736

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-05 11:33:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 11:33:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 11:33:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-05 11:33:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 11:33:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 556 ms
[2025-06-05 11:33:03] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2025-06-05 11:33:03] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2025-06-05 11:33:03] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 8 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40005 steps (2223 resets) in 563 ms. (70 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40002 steps (788 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (698 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (839 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (657 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
// Phase 1: matrix 26 rows 30 cols
[2025-06-05 11:33:04] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/22 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 26/50 variables, 24/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 7 (OVERLAPS) 6/56 variables, 6/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 2 solved, 2 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 14/46 variables, 8/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/52 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/52 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 14 (OVERLAPS) 4/56 variables, 5/37 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 3 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 457ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 11:33:04] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-05 11:33:04] [INFO ] Flatten gal took : 19 ms
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 11:33:04] [INFO ] Flatten gal took : 5 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2025-06-05 11:33:04] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 15 ms.
[2025-06-05 11:33:04] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 326 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 24 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2025-06-05 11:33:04] [INFO ] Computed 350 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:33:05] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-06-05 11:33:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:33:05] [INFO ] Implicit Places using invariants and state equation in 370 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 675 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/550 places, 176/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 718 ms. Remains : 513/550 places, 176/176 transitions.
Support contains 326 out of 513 places after structural reductions.
[2025-06-05 11:33:05] [INFO ] Flatten gal took : 41 ms
[2025-06-05 11:33:05] [INFO ] Flatten gal took : 38 ms
[2025-06-05 11:33:05] [INFO ] Input system was already deterministic with 176 transitions.
RANDOM walk for 40000 steps (2773 resets) in 1054 ms. (37 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4004 steps (31 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (22 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (23 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (40 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (21 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (30 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (28 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (27 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
// Phase 1: matrix 176 rows 513 cols
[2025-06-05 11:33:06] [INFO ] Computed 340 invariants in 18 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/326 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 143/469 variables, 130/330 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 4 (OVERLAPS) 176/645 variables, 469/799 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 0/799 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 44/689 variables, 44/843 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 10/853 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 3 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 3 solved, 12 unsolved in 1582 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 15/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 200/200 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/200 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 132/445 variables, 120/320 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 0/320 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 163/608 variables, 445/765 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 5/770 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 0/770 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 69/677 variables, 56/826 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 10/836 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 3/839 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/677 variables, 0/839 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 11/688 variables, 10/849 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/688 variables, 11/860 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/689 variables, and 860 constraints, problems are : Problem set: 3 solved, 12 unsolved in 5075 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 512/513 constraints, PredecessorRefiner: 12/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6726ms problems are : Problem set: 3 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 313 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 512 transition count 174
Applied a total of 2 rules in 42 ms. Remains 512 /513 variables (removed 1) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 512/513 places, 174/176 transitions.
RANDOM walk for 40000 steps (2906 resets) in 756 ms. (52 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (227 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (207 resets) in 183 ms. (217 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (228 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (226 resets) in 260 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (202 resets) in 296 ms. (134 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (226 resets) in 270 ms. (147 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (227 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (224 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
// Phase 1: matrix 174 rows 512 cols
[2025-06-05 11:33:13] [INFO ] Computed 341 invariants in 13 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 132/433 variables, 120/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 161/594 variables, 433/753 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 69/663 variables, 56/809 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 10/819 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 23/686 variables, 23/842 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/686 variables, 11/853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/686 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 686/686 variables, and 853 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1858 ms.
Refiners :[Generalized P Invariants (flows): 341/341 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 132/433 variables, 120/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 161/594 variables, 433/753 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 69/663 variables, 56/810 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 10/820 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 3/823 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 23/686 variables, 23/846 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 11/857 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/686 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 686/686 variables, and 857 constraints, problems are : Problem set: 0 solved, 8 unsolved in 9836 ms.
Refiners :[Generalized P Invariants (flows): 341/341 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11736ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=81 )
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 8 properties in 90 ms.
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(F(p0))))))'
Support contains 12 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 24 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2025-06-05 11:33:25] [INFO ] Computed 340 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:33:26] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-06-05 11:33:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:33:27] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:33:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17549 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47641ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 47647ms
Finished structural reductions in LTL mode , in 1 iterations and 48894 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 240 ms.
Product exploration explored 100000 steps with 25000 reset in 200 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-02 finished in 49799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F((p0||G(p1))))))'
Support contains 13 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 11:34:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:34:16] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-06-05 11:34:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:34:16] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:34:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17617 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47691ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 47692ms
Finished structural reductions in LTL mode , in 1 iterations and 48834 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-03 finished in 48970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((X(G(p0))||((!p1 U (p2||G(!p1))) U ((G(p3)&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))))))'
Support contains 146 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 11:35:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:35:04] [INFO ] Implicit Places using invariants in 265 ms returned []
[2025-06-05 11:35:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:35:05] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:35:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17813 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47883ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 47883ms
Finished structural reductions in LTL mode , in 1 iterations and 48603 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-05
Product exploration explored 100000 steps with 7512 reset in 693 ms.
Product exploration explored 100000 steps with 7531 reset in 675 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1) p3), (X p2), (X p3), (X (NOT (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND p2 (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p2) p1 p3 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0)))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1 p3 p0)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT p1))), (X (X (AND p2 p3))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1))), (F (G p3))]
False Knowledge obtained : [(X (AND p2 p3 (NOT p0))), (X (NOT (AND p2 p3 (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (OR (NOT p3) (NOT p0)))), (X (X (NOT (OR (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 28 factoid took 577 ms. Reduced automaton from 9 states, 28 edges and 4 AP (stutter sensitive) to 7 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2)))]
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (2774 resets) in 753 ms. (53 steps per ms) remains 14/16 properties
BEST_FIRST walk for 40004 steps (241 resets) in 522 ms. (76 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (241 resets) in 1217 ms. (32 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (322 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (179 resets) in 289 ms. (137 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (240 resets) in 286 ms. (139 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (242 resets) in 1039 ms. (38 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (322 resets) in 472 ms. (84 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (178 resets) in 328 ms. (121 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (235 resets) in 294 ms. (135 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (320 resets) in 620 ms. (64 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (324 resets) in 345 ms. (115 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (400 resets) in 526 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (317 resets) in 175 ms. (227 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (329 resets) in 198 ms. (201 steps per ms) remains 14/14 properties
[2025-06-05 11:35:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 138/284 variables, 146/246 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 4 (OVERLAPS) 394/678 variables, 356/602 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 230/832 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 0/832 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 11/689 variables, 10/842 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 11/853 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 3 solved, 11 unsolved in 1946 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 14/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 100/100 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/100 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 138/284 variables, 146/246 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/246 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 394/678 variables, 356/602 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 230/832 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 1/833 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 0/833 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 11/689 variables, 10/843 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/689 variables, 11/854 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 0/854 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/689 variables, 0/854 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 854 constraints, problems are : Problem set: 3 solved, 11 unsolved in 2908 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 11/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4882ms problems are : Problem set: 3 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
Finished Parikh walk after 83 steps, including 0 resets, run visited all 11 properties in 7 ms. (steps per millisecond=11 )
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 11 properties in 7 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1) p3), (X p2), (X p3), (X (NOT (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND p2 (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p2) p1 p3 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0)))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1 p3 p0)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT p1))), (X (X (AND p2 p3))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1))), (F (G p3)), (G (OR (NOT p0) p1 p2 (NOT p3))), (G (OR (NOT p1) p2 p3)), (G (OR (NOT p0) (NOT p1) p2 (NOT p3)))]
False Knowledge obtained : [(X (AND p2 p3 (NOT p0))), (X (NOT (AND p2 p3 (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (OR (NOT p3) (NOT p0)))), (X (X (NOT (OR (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (OR p0 p1 p2) (OR p1 p3) (OR (NOT p2) p3)))), (F p1), (F (NOT (OR (NOT p0) (NOT p3)))), (F p0), (F (NOT (AND (OR p1 p2) (OR (NOT p2) p3)))), (F (NOT (AND (OR p0 (NOT p1) p2) (OR (NOT p1) p2 p3)))), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT p2)), (F (NOT p3)), (F (NOT (AND p2 p3))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (AND (OR p1 p3) (OR (NOT p2) p3))))]
Knowledge based reduction with 31 factoid took 1158 ms. Reduced automaton from 7 states, 18 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 237 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Support contains 146 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 11:36:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:36:04] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-06-05 11:36:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:36:05] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:36:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17456 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47522ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 47522ms
Finished structural reductions in LTL mode , in 1 iterations and 48231 ms. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p2 p3 (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p2 p3))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p2)), (F (G p3)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 11 factoid took 146 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (2764 resets) in 526 ms. (75 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (238 resets) in 265 ms. (150 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (319 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (327 resets) in 648 ms. (61 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (324 resets) in 419 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (244 resets) in 340 ms. (117 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (322 resets) in 275 ms. (144 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (318 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
[2025-06-05 11:36:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 135/280 variables, 145/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 369/649 variables, 332/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 220/797 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 11/660 variables, 10/807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 11/818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 26/686 variables, 23/841 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 10/851 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/689 variables, 2/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1609 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 7/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 135/280 variables, 145/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 369/649 variables, 332/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 220/797 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 11/660 variables, 10/808 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 11/819 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/660 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 26/686 variables, 23/842 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 10/852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/686 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 3/689 variables, 2/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/689 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/689 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 854 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2233 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 7/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3855ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 82 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=27 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p2 p3 (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p2 p3))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p2)), (F (G p3)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT (AND (OR p1 p2) p3))), (F (NOT (AND (OR p1 p2) (OR (NOT p2) p3)))), (F p0), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT p3)), (F (NOT (AND p2 p3))), (F (NOT (OR (NOT p0) (NOT p3)))), (F p1)]
Knowledge based reduction with 11 factoid took 456 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 235 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 247 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 7522 reset in 360 ms.
Product exploration explored 100000 steps with 7498 reset in 369 ms.
Applying partial POR strategy [true, false, false, false, false, true]
Stuttering acceptance computed with spot in 239 ms :[true, (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (AND p1 (NOT p2)), (OR (NOT p3) (NOT p0))]
Support contains 146 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.10 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) 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
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 501 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 47 ms. Remains 501 /513 variables (removed 12) and now considering 175/176 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:37:00] [INFO ] Redundant transitions in 19 ms returned []
Running 163 sub problems to find dead transitions.
// Phase 1: matrix 175 rows 501 cols
[2025-06-05 11:37:00] [INFO ] Computed 330 invariants in 20 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 2 (OVERLAPS) 175/675 variables, 500/830 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/675 variables, 0/830 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 1/676 variables, 1/831 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 0/831 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/676 variables, 0/831 constraints. Problems are: Problem set: 2 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 831 constraints, problems are : Problem set: 2 solved, 161 unsolved in 16792 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 330/330 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 174/673 variables, 499/829 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 161/990 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 0/990 constraints. Problems are: Problem set: 2 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 3/676 variables, 2/992 constraints. Problems are: Problem set: 2 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 992 constraints, problems are : Problem set: 2 solved, 161 unsolved in 30007 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 161/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46855ms problems are : Problem set: 2 solved, 161 unsolved
Search for dead transitions found 2 dead transitions in 46857ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 501/513 places, 173/176 transitions.
Graph (complete) has 2126 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 500 /501 variables (removed 1) and now considering 173/173 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 500/513 places, 173/176 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46951 ms. Remains : 500/513 places, 173/176 transitions.
Built C files in :
/tmp/ltsmin535037780950614792
[2025-06-05 11:37:47] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin535037780950614792
Running compilation step : cd /tmp/ltsmin535037780950614792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 563 ms.
Running link step : cd /tmp/ltsmin535037780950614792;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin535037780950614792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1004021088572111803.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 146 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2025-06-05 11:38:02] [INFO ] Computed 340 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:38:02] [INFO ] Implicit Places using invariants in 344 ms returned []
[2025-06-05 11:38:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:38:03] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:38:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17588 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47648ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 47650ms
Finished structural reductions in LTL mode , in 1 iterations and 48427 ms. Remains : 513/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin14507193861009858192
[2025-06-05 11:38:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14507193861009858192
Running compilation step : cd /tmp/ltsmin14507193861009858192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 450 ms.
Running link step : cd /tmp/ltsmin14507193861009858192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14507193861009858192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15424702357397374262.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 11:39:05] [INFO ] Flatten gal took : 24 ms
[2025-06-05 11:39:05] [INFO ] Flatten gal took : 22 ms
[2025-06-05 11:39:05] [INFO ] Time to serialize gal into /tmp/LTL1868419737524535092.gal : 5 ms
[2025-06-05 11:39:06] [INFO ] Time to serialize properties into /tmp/LTL17012510777625903537.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1868419737524535092.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10214828937357098660.hoa' '-atoms' '/tmp/LTL17012510777625903537.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17012510777625903537.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10214828937357098660.hoa
Detected timeout of ITS tools.
[2025-06-05 11:39:21] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:39:21] [INFO ] Flatten gal took : 22 ms
[2025-06-05 11:39:21] [INFO ] Time to serialize gal into /tmp/LTL7873441830899922097.gal : 2 ms
[2025-06-05 11:39:21] [INFO ] Time to serialize properties into /tmp/LTL15817875257487335376.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7873441830899922097.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15817875257487335376.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X("(a1>=1)"))||(G((X(G("(a1>=1)")))||(((!("(((((((((n9_1>=1)&&(n9_12>=1))&&((n9_23>=1)&&(n9_34>=1)))&&(((n9_45>=1)&&(n9_56>=1))&&(...18156
Formula 0 simplified : X!"(a1>=1)" & F(XF!"(a1>=1)" & (("(((((((((n9_1>=1)&&(n9_12>=1))&&((n9_23>=1)&&(n9_34>=1)))&&(((n9_45>=1)&&(n9_56>=1))&&((n9_67>=1)&...12555
Detected timeout of ITS tools.
[2025-06-05 11:39:36] [INFO ] Flatten gal took : 25 ms
[2025-06-05 11:39:36] [INFO ] Applying decomposition
[2025-06-05 11:39:36] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4827404015808138724.txt' '-o' '/tmp/graph4827404015808138724.bin' '-w' '/tmp/graph4827404015808138724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4827404015808138724.bin' '-l' '-1' '-v' '-w' '/tmp/graph4827404015808138724.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:39:36] [INFO ] Decomposing Gal with order
[2025-06-05 11:39:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:39:36] [INFO ] Removed a total of 109 redundant transitions.
[2025-06-05 11:39:36] [INFO ] Flatten gal took : 74 ms
[2025-06-05 11:39:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 21 ms.
[2025-06-05 11:39:36] [INFO ] Time to serialize gal into /tmp/LTL12423263272901372463.gal : 7 ms
[2025-06-05 11:39:36] [INFO ] Time to serialize properties into /tmp/LTL8346147442352686876.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12423263272901372463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8346147442352686876.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X("(i3.u66.a1>=1)"))||(G((X(G("(i3.u66.a1>=1)")))||(((!("(((((((((u54.n9_1>=1)&&(u55.n9_12>=1))&&((u56.n9_23>=1)&&(u57.n9_34>=1)))...23796
Formula 0 simplified : X!"(i3.u66.a1>=1)" & F(XF!"(i3.u66.a1>=1)" & (("(((((((((u54.n9_1>=1)&&(u55.n9_12>=1))&&((u56.n9_23>=1)&&(u57.n9_34>=1)))&&(((u58.n9...16452
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-05 finished in 286961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 132 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 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 498 transition count 171
Applied a total of 5 rules in 27 ms. Remains 498 /513 variables (removed 15) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 498 cols
[2025-06-05 11:39:51] [INFO ] Computed 330 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:39:51] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-06-05 11:39:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:39:52] [INFO ] Implicit Places using invariants and state equation in 586 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 865 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/513 places, 171/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 903 ms. Remains : 487/513 places, 171/176 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-09
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-09 finished in 991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(!p1)))'
Support contains 14 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2025-06-05 11:39:52] [INFO ] Computed 340 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:39:52] [INFO ] Implicit Places using invariants in 337 ms returned []
[2025-06-05 11:39:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:39:53] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:39:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17833 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47887ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 47887ms
Finished structural reductions in LTL mode , in 1 iterations and 49016 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 166 ms :[p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 234 ms.
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 11 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-11 finished in 49779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(p0)) U (X(X(G(p0)))||(!p0&&X(X(p0)))))) U G(p1)))'
Support contains 12 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 11:40:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:40:42] [INFO ] Implicit Places using invariants in 314 ms returned []
[2025-06-05 11:40:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:40:43] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:40:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17590 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47635ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 47635ms
Finished structural reductions in LTL mode , in 1 iterations and 48743 ms. Remains : 513/513 places, 176/176 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-12
Stuttering criterion allowed to conclude after 33035 steps with 6575 reset in 73 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-12 finished in 49130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 71 are kept as prefixes of interest. Removing 442 places using SCC suffix rule.3 ms
Discarding 442 places :
Also discarding 70 output transitions
Drop transitions (Output transitions of discarded places.) removed 70 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 70 transition count 51
Applied a total of 55 rules in 10 ms. Remains 70 /513 variables (removed 443) and now considering 51/176 (removed 125) transitions.
// Phase 1: matrix 51 rows 70 cols
[2025-06-05 11:41:31] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:41:31] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-05 11:41:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:41:31] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 132 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/513 places, 51/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 59/513 places, 51/176 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLFireability-13
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLFireability-13 finished in 224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((X(G(p0))||((!p1 U (p2||G(!p1))) U ((G(p3)&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))))))'
[2025-06-05 11:41:31] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1900202226212659122
[2025-06-05 11:41:31] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2025-06-05 11:41:31] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:41:31] [INFO ] Applying decomposition
[2025-06-05 11:41:31] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2025-06-05 11:41:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:41:31] [INFO ] Flatten gal took : 44 ms
[2025-06-05 11:41:31] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2025-06-05 11:41:31] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:41:31] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1900202226212659122
Running compilation step : cd /tmp/ltsmin1900202226212659122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15587493933463666776.txt' '-o' '/tmp/graph15587493933463666776.bin' '-w' '/tmp/graph15587493933463666776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15587493933463666776.bin' '-l' '-1' '-v' '-w' '/tmp/graph15587493933463666776.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:41:31] [INFO ] Decomposing Gal with order
[2025-06-05 11:41:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:41:32] [INFO ] Removed a total of 109 redundant transitions.
[2025-06-05 11:41:32] [INFO ] Flatten gal took : 40 ms
[2025-06-05 11:41:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 13 ms.
[2025-06-05 11:41:32] [INFO ] Time to serialize gal into /tmp/LTLFireability5149864833185476275.gal : 5 ms
[2025-06-05 11:41:32] [INFO ] Time to serialize properties into /tmp/LTLFireability16852310657245558726.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5149864833185476275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16852310657245558726.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X("(i3.u31.a1>=1)"))||(G((X(G("(i3.u31.a1>=1)")))||(((!("(((((((((u55.n9_1>=1)&&(u56.n9_12>=1))&&((u57.n9_23>=1)&&(u58.n9_34>=1)))...23784
Formula 0 simplified : X!"(i3.u31.a1>=1)" & F(XF!"(i3.u31.a1>=1)" & (("(((((((((u55.n9_1>=1)&&(u56.n9_12>=1))&&((u57.n9_23>=1)&&(u58.n9_34>=1)))&&(((u59.n9...16443
Compilation finished in 523 ms.
Running link step : cd /tmp/ltsmin1900202226212659122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1900202226212659122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true))||[]((X([]((LTLAPp0==true)))||((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))) U (([]((LTLAPp3==true))&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))||[]((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))))))' '--buchi-type=spotba'
LTSmin run took 60996 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 570690 ms.

BK_STOP 1749123753974

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254600740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;