Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812700508.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 PermAdmissibility-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812700508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 402K 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.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 53K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 263K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 336K 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 PermAdmissibility-PT-02-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748902780076

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 22:19:41] [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-02 22:19:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:19:41] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2025-06-02 22:19:41] [INFO ] Transformed 168 places.
[2025-06-02 22:19:41] [INFO ] Transformed 592 transitions.
[2025-06-02 22:19:41] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Support contains 103 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Applied a total of 64 rules in 24 ms. Remains 104 /168 variables (removed 64) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 104 cols
[2025-06-02 22:19:41] [INFO ] Computed 16 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:42] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-02 22:19:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:42] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2025-06-02 22:19:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/696 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 696/696 variables, and 120 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/696 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 588/708 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/696 variables, and 708 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60838ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 60852ms
Starting structural reductions in LTL mode, iteration 1 : 104/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61342 ms. Remains : 104/168 places, 592/592 transitions.
Support contains 103 out of 104 places after structural reductions.
[2025-06-02 22:20:43] [INFO ] Flatten gal took : 85 ms
[2025-06-02 22:20:43] [INFO ] Flatten gal took : 67 ms
[2025-06-02 22:20:43] [INFO ] Input system was already deterministic with 592 transitions.
Reduction of identical properties reduced properties to check from 39 to 36
RANDOM walk for 40000 steps (850 resets) in 1699 ms. (23 steps per ms) remains 3/36 properties
BEST_FIRST walk for 40002 steps (315 resets) in 787 ms. (50 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (187 resets) in 149 ms. (266 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (193 resets) in 142 ms. (279 steps per ms) remains 1/2 properties
[2025-06-02 22:20:44] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 61/100 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/104 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 696/696 variables, and 120 constraints, problems are : Problem set: 1 solved, 0 unsolved in 257 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 273ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PermAdmissibility-PT-02-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 104 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 36 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 68 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Discarding 36 places :
Also discarding 256 output transitions
Drop transitions (Output transitions of discarded places.) removed 256 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 54 transition count 210
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 54 transition count 210
Applied a total of 29 rules in 22 ms. Remains 54 /104 variables (removed 50) and now considering 210/592 (removed 382) transitions.
// Phase 1: matrix 210 rows 54 cols
[2025-06-02 22:20:45] [INFO ] Computed 12 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:20:45] [INFO ] Implicit Places using invariants in 46 ms returned [17, 34]
[2025-06-02 22:20:45] [INFO ] Actually due to overlaps returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/104 places, 210/592 transitions.
Applied a total of 0 rules in 19 ms. Remains 53 /53 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 53/104 places, 210/592 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-00 finished in 405 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' '!(((p0 U X(((p0 U X(p0)) U X((p1 U p2)))))&&F(p3)))'
Support contains 36 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 19 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2025-06-02 22:20:45] [INFO ] Computed 16 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:20:46] [INFO ] Implicit Places using invariants in 108 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 451 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), false, (NOT p2), true, (NOT p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-01
Entered a terminal (fully accepting) state of product in 42 steps with 3 reset in 3 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-01 finished in 619 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((X(((G(F(p0)) U G(p0)) U X(p0))) U p1)))'
Support contains 18 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 76 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 100 place count 54 transition count 108
Applied a total of 100 rules in 16 ms. Remains 54 /104 variables (removed 50) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 54 cols
[2025-06-02 22:20:46] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:20:46] [INFO ] Implicit Places using invariants in 97 ms returned [0, 5, 19, 26]
[2025-06-02 22:20:46] [INFO ] Actually due to overlaps returned [0, 5, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 99 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/104 places, 108/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 51/104 places, 108/592 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-02
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-02 finished in 296 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 17 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 68 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 places :
Also discarding 256 output transitions
Drop transitions (Output transitions of discarded places.) removed 256 transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 54 transition count 210
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 54 transition count 210
Applied a total of 29 rules in 15 ms. Remains 54 /104 variables (removed 50) and now considering 210/592 (removed 382) transitions.
// Phase 1: matrix 210 rows 54 cols
[2025-06-02 22:20:46] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:20:46] [INFO ] Implicit Places using invariants in 41 ms returned [17, 34]
[2025-06-02 22:20:46] [INFO ] Actually due to overlaps returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/104 places, 210/592 transitions.
Applied a total of 0 rules in 6 ms. Remains 53 /53 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 53/104 places, 210/592 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-03
Product exploration explored 100000 steps with 6173 reset in 606 ms.
Product exploration explored 100000 steps with 6161 reset in 581 ms.
Computed a total of 53 stabilizing places and 210 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 210
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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 112 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLFireability-03 finished in 1670 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' '!(F(G(((p1||G((X((!p3 U (!p4||G(!p3))))&&p2)))&&p0))))'
Support contains 27 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 50 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.6 ms
Discarding 54 places :
Also discarding 384 output transitions
Drop transitions (Output transitions of discarded places.) removed 384 transitions
Applied a total of 1 rules in 19 ms. Remains 50 /104 variables (removed 54) and now considering 208/592 (removed 384) transitions.
// Phase 1: matrix 208 rows 50 cols
[2025-06-02 22:20:48] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:20:48] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-02 22:20:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:20:48] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:20:48] [INFO ] Redundant transitions in 12 ms returned []
Running 204 sub problems to find dead transitions.
[2025-06-02 22:20:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 208/258 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 60 constraints, problems are : Problem set: 0 solved, 204 unsolved in 6031 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 208/258 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 204/264 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/258 variables, and 264 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36192ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 36193ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/104 places, 208/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36414 ms. Remains : 50/104 places, 208/592 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) p3 p4) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) p3 p4) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-04
Product exploration explored 100000 steps with 4761 reset in 1402 ms.
Product exploration explored 100000 steps with 4761 reset in 1362 ms.
Computed a total of 50 stabilizing places and 208 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 208
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 p1 p0 p2 (NOT p4) (NOT p3)), (X p2), (X (NOT p3)), (X p4), (X (NOT (AND p2 (NOT p1) p0 p4 p3))), (X (OR (AND p2 p0 (NOT p4)) (AND p2 p0 (NOT p3)))), (X (NOT (OR (NOT p2) (AND p1 p4 p3) (NOT p0)))), (X (AND p1 p0)), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p1) p0))), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1) p0 p4 p3)))), (X (X (OR (AND p2 p0 (NOT p4)) (AND p2 p0 (NOT p3))))), (X (X (NOT (OR (NOT p2) (AND p1 p4 p3) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (G p0)), (F (G p2)), (F (G (NOT p4))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X p4)), (X (X (NOT p4)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 27 factoid took 166 ms. Reduced automaton from 2 states, 6 edges and 5 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLFireability-04 finished in 39581 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' '!((F((p0||G(p1)))&&X(X(p2))&&F(!p0)))'
Support contains 31 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 11 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2025-06-02 22:21:28] [INFO ] Computed 16 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:21:28] [INFO ] Implicit Places using invariants in 91 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p2) p0), (AND (NOT p0) (NOT p1)), (NOT p2), p0, (NOT p2), true]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-05 finished in 325 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(X(!p0)) U (X(X(G(!p0)))||(!p1&&X((X(!p0)&&F(p2)))))))))'
Support contains 43 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 9 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
[2025-06-02 22:21:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:21:28] [INFO ] Implicit Places using invariants in 58 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 455 ms :[true, (NOT p2), p0, p0, p0, (AND (NOT p2) p0), p0, p0, p0, p0, p0, p0]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-06
Product exploration explored 100000 steps with 20000 reset in 365 ms.
Product exploration explored 100000 steps with 20000 reset in 384 ms.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
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 p2 (NOT p0) (NOT p1)), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 12 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[p0, p0, p0, p0, true, p0]
RANDOM walk for 145 steps (0 resets) in 8 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 232 ms :[p0, p0, p0, p0, true, p0]
Support contains 17 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
// Phase 1: matrix 468 rows 90 cols
[2025-06-02 22:21:30] [INFO ] Computed 15 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:21:30] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 22:21:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:21:31] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-02 22:21:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 468/558 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (OVERLAPS) 0/558 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 105 constraints, problems are : Problem set: 0 solved, 464 unsolved in 24531 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 468/558 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 464/569 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 569 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54931ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 54935ms
Finished structural reductions in LTL mode , in 1 iterations and 55411 ms. Remains : 90/90 places, 468/468 transitions.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
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 : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[p0, p0, p0, p0, true, p0]
RANDOM walk for 160 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 154 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 160 ms :[p0, p0, p0, p0, true, p0]
Product exploration explored 100000 steps with 20000 reset in 251 ms.
Product exploration explored 100000 steps with 20000 reset in 252 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 220 ms :[p0, p0, p0, p0, true, p0]
Support contains 17 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 20 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:22:28] [INFO ] Redundant transitions in 24 ms returned []
Running 464 sub problems to find dead transitions.
[2025-06-02 22:22:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 468/558 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (OVERLAPS) 0/558 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 105 constraints, problems are : Problem set: 0 solved, 464 unsolved in 24239 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 468/558 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 464/569 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 569 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54624ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 54626ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54678 ms. Remains : 90/90 places, 468/468 transitions.
Built C files in :
/tmp/ltsmin3050432775314039693
[2025-06-02 22:23:22] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3050432775314039693
Running compilation step : cd /tmp/ltsmin3050432775314039693;'/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 919 ms.
Running link step : cd /tmp/ltsmin3050432775314039693;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3050432775314039693;'/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/stateBased2405727808973577428.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-02-LTLFireability-06 finished in 115535 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' '!(F((X(p1)&&p0)))'
Support contains 11 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 68 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 88 place count 60 transition count 136
Applied a total of 88 rules in 8 ms. Remains 60 /104 variables (removed 44) and now considering 136/592 (removed 456) transitions.
// Phase 1: matrix 136 rows 60 cols
[2025-06-02 22:23:23] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:24] [INFO ] Implicit Places using invariants in 53 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/104 places, 136/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 59 /59 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 59/104 places, 136/592 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-08
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-08 finished in 163 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' '!(F(((p0 U (!p1||F(p2)))&&X(F(p1)))))'
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 68 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 88 place count 60 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 58 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 58 transition count 120
Applied a total of 92 rules in 3 ms. Remains 58 /104 variables (removed 46) and now considering 120/592 (removed 472) transitions.
// Phase 1: matrix 120 rows 58 cols
[2025-06-02 22:23:24] [INFO ] Computed 16 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:24] [INFO ] Implicit Places using invariants in 53 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/104 places, 120/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 57/104 places, 120/592 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-09
Product exploration explored 100000 steps with 38076 reset in 161 ms.
Product exploration explored 100000 steps with 38050 reset in 163 ms.
Computed a total of 57 stabilizing places and 120 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 57 transition count 120
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 p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0))), (X (AND p1 (NOT p2) p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0))))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 950 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40002 steps (845 resets) in 233 ms. (170 steps per ms) remains 1/6 properties
BEST_FIRST walk for 3518 steps (22 resets) in 15 ms. (219 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0))), (X (AND p1 (NOT p2) p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p0))))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 1456 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 227 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
// Phase 1: matrix 120 rows 57 cols
[2025-06-02 22:23:27] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:23:27] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 5 ms returned sat
[2025-06-02 22:23:27] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-06-02 22:23:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:23:28] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-02 22:23:28] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-02 22:23:28] [INFO ] Computed and/alt/rep : 13/57/13 causal constraints (skipped 103 transitions) in 11 ms.
[2025-06-02 22:23:28] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Support contains 6 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 120/120 transitions.
Graph (complete) has 286 edges and 57 vertex of which 53 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 51 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 51 transition count 102
Applied a total of 5 rules in 5 ms. Remains 51 /57 variables (removed 6) and now considering 102/120 (removed 18) transitions.
// Phase 1: matrix 102 rows 51 cols
[2025-06-02 22:23:28] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:28] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 22:23:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:28] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:23:28] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-06-02 22:23:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/153 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/153 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 65 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2068 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 102/153 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 98/163 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/153 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 163 constraints, problems are : Problem set: 0 solved, 98 unsolved in 10852 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12958ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 12958ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/57 places, 102/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13143 ms. Remains : 51/57 places, 102/120 transitions.
Computed a total of 51 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 102
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 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 467 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 40002 steps (965 resets) in 97 ms. (408 steps per ms) remains 1/6 properties
BEST_FIRST walk for 1211 steps (6 resets) in 7 ms. (151 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 808 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 203 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2025-06-02 22:23:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:23:43] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned sat
[2025-06-02 22:23:43] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 22:23:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:23:43] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 4 ms returned sat
[2025-06-02 22:23:43] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-02 22:23:43] [INFO ] Computed and/alt/rep : 12/48/12 causal constraints (skipped 86 transitions) in 9 ms.
[2025-06-02 22:23:43] [INFO ] Added : 6 causal constraints over 2 iterations in 37 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 192 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 28605 reset in 135 ms.
Product exploration explored 100000 steps with 28583 reset in 141 ms.
Built C files in :
/tmp/ltsmin17786157649976786555
[2025-06-02 22:23:44] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2025-06-02 22:23:44] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:23:44] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2025-06-02 22:23:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:23:44] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2025-06-02 22:23:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:23:44] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17786157649976786555
Running compilation step : cd /tmp/ltsmin17786157649976786555;'/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 247 ms.
Running link step : cd /tmp/ltsmin17786157649976786555;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17786157649976786555;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17082894597786046485.hoa' '--buchi-type=spotba'
LTSmin run took 99 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-02-LTLFireability-09 finished in 20287 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(F((p0&&(p1||F(G(p2)))))))))'
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 74 place count 56 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 96 place count 56 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 54 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 54 transition count 98
Applied a total of 100 rules in 5 ms. Remains 54 /104 variables (removed 50) and now considering 98/592 (removed 494) transitions.
// Phase 1: matrix 98 rows 54 cols
[2025-06-02 22:23:44] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:44] [INFO ] Implicit Places using invariants in 55 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/104 places, 98/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 52 /52 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 52/104 places, 98/592 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-10
Product exploration explored 100000 steps with 3568 reset in 228 ms.
Product exploration explored 100000 steps with 3611 reset in 238 ms.
Computed a total of 52 stabilizing places and 98 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 98
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) p2), (F (G p0)), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLFireability-10 finished in 912 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(((!p1 U p2)||X(X(p3))))))'
Support contains 11 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 73 place count 57 transition count 130
Iterating global reduction 0 with 21 rules applied. Total rules applied 94 place count 57 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 55 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 55 transition count 114
Applied a total of 98 rules in 11 ms. Remains 55 /104 variables (removed 49) and now considering 114/592 (removed 478) transitions.
// Phase 1: matrix 114 rows 55 cols
[2025-06-02 22:23:45] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:45] [INFO ] Implicit Places using invariants in 59 ms returned [0, 5, 18, 26]
[2025-06-02 22:23:45] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/104 places, 114/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 52/104 places, 114/592 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-11
Stuttering criterion allowed to conclude after 152 steps with 37 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-11 finished in 415 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' '!(((!p0&&X(G(p0))) U X((!p1||G(!p2)))))'
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 72 place count 58 transition count 124
Iterating global reduction 0 with 20 rules applied. Total rules applied 92 place count 58 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 56 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 56 transition count 108
Applied a total of 96 rules in 6 ms. Remains 56 /104 variables (removed 48) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 56 cols
[2025-06-02 22:23:45] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:45] [INFO ] Implicit Places using invariants in 58 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/104 places, 108/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 54/104 places, 108/592 transitions.
Stuttering acceptance computed with spot in 256 ms :[(AND p1 p2), (AND p2 p1), (AND p1 p2), true, p2, (NOT p0), (AND p2 (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Computed a total of 54 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 108
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 27 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLFireability-12 finished in 659 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' '!(F(G((F(p0) U !p1))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 86 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 75 transition count 348
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 75 transition count 348
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 45 place count 53 transition count 118
Iterating global reduction 0 with 22 rules applied. Total rules applied 67 place count 53 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 70 place count 50 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 73 place count 50 transition count 94
Applied a total of 73 rules in 12 ms. Remains 50 /104 variables (removed 54) and now considering 94/592 (removed 498) transitions.
// Phase 1: matrix 94 rows 50 cols
[2025-06-02 22:23:46] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:46] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-02 22:23:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:46] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:23:46] [INFO ] Redundant transitions in 1 ms returned []
Running 90 sub problems to find dead transitions.
[2025-06-02 22:23:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 94/144 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/144 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 64 constraints, problems are : Problem set: 0 solved, 90 unsolved in 1875 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 94/144 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 90/154 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/144 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 154 constraints, problems are : Problem set: 0 solved, 90 unsolved in 9041 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10944ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 10944ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/104 places, 94/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11124 ms. Remains : 50/104 places, 94/592 transitions.
Stuttering acceptance computed with spot in 116 ms :[p1, (AND p1 (NOT p0)), p1]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-13
Product exploration explored 100000 steps with 3483 reset in 290 ms.
Product exploration explored 100000 steps with 3489 reset in 213 ms.
Computed a total of 50 stabilizing places and 94 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 94
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 p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (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 22 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLFireability-13 finished in 11819 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(G((p0&&X((X(p2)||p1))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 74 place count 56 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 96 place count 56 transition count 114
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 53 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 53 transition count 90
Applied a total of 102 rules in 6 ms. Remains 53 /104 variables (removed 51) and now considering 90/592 (removed 502) transitions.
// Phase 1: matrix 90 rows 53 cols
[2025-06-02 22:23:58] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:58] [INFO ] Implicit Places using invariants in 48 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/104 places, 90/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 51/104 places, 90/592 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-14
Entered a terminal (fully accepting) state of product in 124 steps with 3 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-14 finished in 277 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(G((G(p1)||p0))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 74 place count 56 transition count 122
Iterating global reduction 0 with 22 rules applied. Total rules applied 96 place count 56 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 54 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 54 transition count 106
Applied a total of 100 rules in 5 ms. Remains 54 /104 variables (removed 50) and now considering 106/592 (removed 486) transitions.
// Phase 1: matrix 106 rows 54 cols
[2025-06-02 22:23:58] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:58] [INFO ] Implicit Places using invariants in 62 ms returned [0, 5, 18, 26]
[2025-06-02 22:23:58] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 63 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/104 places, 106/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 51/104 places, 106/592 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3610 steps with 109 reset in 12 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-15 finished in 301 ms.
All properties solved by simple procedures.
Total runtime 257529 ms.

BK_STOP 1748903039194

--------------------
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="PermAdmissibility-PT-02"
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 PermAdmissibility-PT-02, 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 r142-tall-174876812700508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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