Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 22:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 22:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.2K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716301308245

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0020P1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 14:21:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 14:21:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:21:49] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2024-05-21 14:21:49] [INFO ] Transformed 25 places.
[2024-05-21 14:21:49] [INFO ] Transformed 18 transitions.
[2024-05-21 14:21:49] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 20 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-21 14:21:49] [INFO ] Computed 7 invariants in 7 ms
[2024-05-21 14:21:49] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-21 14:21:49] [INFO ] Invariant cache hit.
[2024-05-21 14:21:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 14:21:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 31 constraints, problems are : Problem set: 0 solved, 17 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 48 constraints, problems are : Problem set: 0 solved, 17 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 473ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 482ms
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 750 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 21 out of 24 places after structural reductions.
[2024-05-21 14:21:50] [INFO ] Flatten gal took : 15 ms
[2024-05-21 14:21:50] [INFO ] Flatten gal took : 5 ms
[2024-05-21 14:21:50] [INFO ] Input system was already deterministic with 18 transitions.
Support contains 20 out of 24 places (down from 21) after GAL structural reductions.
RANDOM walk for 40067 steps (15 resets) in 272 ms. (146 steps per ms) remains 2/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
[2024-05-21 14:21:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp31 is UNSAT
After SMT solving in domain Real declared 24/42 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 45ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 14:21:51] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 14:21:51] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 284 ms.
Product exploration explored 100000 steps with 2 reset in 253 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40050 steps (13 resets) in 47 ms. (834 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 14:21:52] [INFO ] Computed 5 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 12/40 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/22 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 355 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 15 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 15 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 11 transition count 7
Applied a total of 22 rules in 16 ms. Remains 11 /22 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2024-05-21 14:21:53] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 14:21:53] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 14:21:53] [INFO ] Invariant cache hit.
[2024-05-21 14:21:53] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-21 14:21:53] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-21 14:21:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 488ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 581 ms. Remains : 11/22 places, 7/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 319 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40064 steps (24 resets) in 275 ms. (145 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
[2024-05-21 14:21:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 7/18 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/11 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 524 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5 reset in 98 ms.
Product exploration explored 100000 steps with 7 reset in 109 ms.
Built C files in :
/tmp/ltsmin538876818201316748
[2024-05-21 14:21:55] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-21 14:21:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:21:55] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-21 14:21:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:21:55] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-21 14:21:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:21:55] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin538876818201316748
Running compilation step : cd /tmp/ltsmin538876818201316748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 212 ms.
Running link step : cd /tmp/ltsmin538876818201316748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin538876818201316748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10158775556724520934.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-21 14:22:10] [INFO ] Invariant cache hit.
[2024-05-21 14:22:10] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 14:22:10] [INFO ] Invariant cache hit.
[2024-05-21 14:22:10] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-21 14:22:10] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-21 14:22:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 175ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 11/11 places, 7/7 transitions.
Built C files in :
/tmp/ltsmin875779644708134744
[2024-05-21 14:22:10] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-21 14:22:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:22:10] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-21 14:22:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:22:10] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-21 14:22:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:22:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin875779644708134744
Running compilation step : cd /tmp/ltsmin875779644708134744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin875779644708134744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin875779644708134744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7387189119974304230.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 14:22:25] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:22:25] [INFO ] Flatten gal took : 1 ms
[2024-05-21 14:22:25] [INFO ] Time to serialize gal into /tmp/LTL18047065600461200403.gal : 1 ms
[2024-05-21 14:22:25] [INFO ] Time to serialize properties into /tmp/LTL8932269508853762945.prop : 0 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18047065600461200403.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3999250666431444918.hoa' '-atoms' '/tmp/LTL8932269508853762945.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8932269508853762945.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3999250666431444918.hoa
Detected timeout of ITS tools.
[2024-05-21 14:22:40] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:22:40] [INFO ] Flatten gal took : 1 ms
[2024-05-21 14:22:40] [INFO ] Time to serialize gal into /tmp/LTL11167440296175197198.gal : 1 ms
[2024-05-21 14:22:40] [INFO ] Time to serialize properties into /tmp/LTL13541136155188358247.ltl : 1 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11167440296175197198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13541136155188358247.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(SR<=CwA)")||(X("(SwG>=1)"))))))
Formula 0 simplified : GF(!"(SR<=CwA)" & X!"(SwG>=1)")
Detected timeout of ITS tools.
[2024-05-21 14:22:55] [INFO ] Flatten gal took : 1 ms
[2024-05-21 14:22:55] [INFO ] Applying decomposition
[2024-05-21 14:22:55] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10431941085818229163.txt' '-o' '/tmp/graph10431941085818229163.bin' '-w' '/tmp/graph10431941085818229163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10431941085818229163.bin' '-l' '-1' '-v' '-w' '/tmp/graph10431941085818229163.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:22:55] [INFO ] Decomposing Gal with order
[2024-05-21 14:22:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:22:55] [INFO ] Flatten gal took : 42 ms
[2024-05-21 14:22:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 14:22:55] [INFO ] Time to serialize gal into /tmp/LTL9749321123738076402.gal : 1 ms
[2024-05-21 14:22:56] [INFO ] Time to serialize properties into /tmp/LTL14291880445449892706.ltl : 13 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9749321123738076402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14291880445449892706.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu2.SR<=gu2.CwA)")||(X("(gi0.gu1.SwG>=1)"))))))
Formula 0 simplified : GF(!"(gu2.SR<=gu2.CwA)" & X!"(gi0.gu1.SwG>=1)")
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-03 finished in 79738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 13 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 11 transition count 8
Applied a total of 23 rules in 3 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-05-21 14:23:11] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 14:23:11] [INFO ] Implicit Places using invariants in 69 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 places, 8/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2024-05-21 14:23:11] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 14:23:11] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 14:23:11] [INFO ] Invariant cache hit.
[2024-05-21 14:23:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 138 ms. Remains : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 75 ms.
Stack based approach found an accepted trace after 118 steps with 0 reset with depth 119 and stack size 119 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-04 finished in 278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(F(!p0)))) U (F(p1) U X(p2))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 14:23:11] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 14:23:11] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 14:23:11] [INFO ] Invariant cache hit.
[2024-05-21 14:23:11] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 14:23:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 393ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 395ms
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 418 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-06
Product exploration explored 100000 steps with 3668 reset in 170 ms.
Product exploration explored 100000 steps with 2890 reset in 253 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 12 factoid took 514 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 11220 steps (1 resets) in 12 ms. (863 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR p2 p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F p1), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 862 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 319 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
[2024-05-21 14:23:15] [INFO ] Invariant cache hit.
[2024-05-21 14:23:15] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 14:23:15] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-21 14:23:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:23:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 14:23:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-21 14:23:15] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 14:23:15] [INFO ] Added : 11 causal constraints over 3 iterations in 75 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 14:23:15] [INFO ] Invariant cache hit.
[2024-05-21 14:23:15] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 14:23:15] [INFO ] Invariant cache hit.
[2024-05-21 14:23:15] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 14:23:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 521ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 522ms
Finished structural reductions in LTL mode , in 1 iterations and 580 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 321 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 4907 steps (0 resets) in 7 ms. (613 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F p1), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 641 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 337 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
[2024-05-21 14:23:17] [INFO ] Invariant cache hit.
[2024-05-21 14:23:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 14:23:18] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 14:23:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:23:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 14:23:18] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 14:23:18] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 14:23:18] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 306 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1281 reset in 151 ms.
Product exploration explored 100000 steps with 1654 reset in 223 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, true, false]
Stuttering acceptance computed with spot in 326 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 19 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 19 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 13 rules in 7 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2024-05-21 14:23:19] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 19 cols
[2024-05-21 14:23:19] [INFO ] Computed 4 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
At refinement iteration 4 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 23 constraints, problems are : Problem set: 7 solved, 8 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/19 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 8/31 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/31 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 31 constraints, problems are : Problem set: 7 solved, 8 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 8/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 7 solved, 8 unsolved
Search for dead transitions found 7 dead transitions in 249ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 9/18 transitions.
Graph (complete) has 22 edges and 19 vertex of which 12 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 12 /19 variables (removed 7) and now considering 9/9 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/21 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 272 ms. Remains : 12/21 places, 9/18 transitions.
Built C files in :
/tmp/ltsmin5131842335194306770
[2024-05-21 14:23:19] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5131842335194306770
Running compilation step : cd /tmp/ltsmin5131842335194306770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin5131842335194306770;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5131842335194306770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5118979685095193583.hoa' '--buchi-type=spotba'
LTSmin run took 4116 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-06 finished in 12566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&(X(X(p1)) U ((p2&&X(X(p1)))||X(X(G(p1))))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 14:23:23] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 14:23:23] [INFO ] Implicit Places using invariants in 53 ms returned [14]
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 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-07
Product exploration explored 100000 steps with 723 reset in 137 ms.
Product exploration explored 100000 steps with 766 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 161 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
RANDOM walk for 8148 steps (1 resets) in 12 ms. (626 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 475 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 14:23:26] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 14:23:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 14:23:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 14:23:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 14:23:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:23:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 14:23:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 14:23:26] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 14:23:26] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 14:23:26] [INFO ] Added : 10 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 14:23:26] [INFO ] Invariant cache hit.
[2024-05-21 14:23:26] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 14:23:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 14:23:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 14:23:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:23:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-21 14:23:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 14:23:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-21 14:23:26] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 14:23:26] [INFO ] Added : 15 causal constraints over 3 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 14:23:26] [INFO ] Invariant cache hit.
[2024-05-21 14:23:26] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 14:23:26] [INFO ] Invariant cache hit.
[2024-05-21 14:23:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 14:23:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 359ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 362ms
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 208 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
RANDOM walk for 11566 steps (3 resets) in 10 ms. (1051 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 540 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
[2024-05-21 14:23:28] [INFO ] Invariant cache hit.
[2024-05-21 14:23:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 14:23:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 14:23:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-21 14:23:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:23:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 14:23:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 14:23:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 14:23:28] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 14:23:28] [INFO ] Added : 10 causal constraints over 2 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 14:23:28] [INFO ] Invariant cache hit.
[2024-05-21 14:23:28] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 14:23:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 14:23:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 14:23:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 14:23:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 14:23:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 8 ms returned sat
[2024-05-21 14:23:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-21 14:23:28] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 14:23:28] [INFO ] Added : 15 causal constraints over 3 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
Product exploration explored 100000 steps with 679 reset in 154 ms.
Product exploration explored 100000 steps with 717 reset in 133 ms.
Built C files in :
/tmp/ltsmin11459169271699066731
[2024-05-21 14:23:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11459169271699066731
Running compilation step : cd /tmp/ltsmin11459169271699066731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin11459169271699066731;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin11459169271699066731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9408502191112301844.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-07 finished in 5748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&X(p1)))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 14:23:29] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 14:23:29] [INFO ] Implicit Places using invariants in 31 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-09
Product exploration explored 100000 steps with 552 reset in 113 ms.
Product exploration explored 100000 steps with 550 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40090 steps (16 resets) in 14 ms. (2672 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 14:23:30] [INFO ] Computed 3 invariants in 0 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 2/38 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-21 14:23:30] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND p0 (NOT p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-09 finished in 1370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G((F(p1)&&(X(p2) U G(p2))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 14:23:31] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 14:23:31] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-10
Product exploration explored 100000 steps with 344 reset in 112 ms.
Stack based approach found an accepted trace after 90788 steps with 310 reset with depth 73 and stack size 73 in 110 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-10 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||F(p2))) U G((F(!p1) U p0))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 20 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 18 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9 place count 18 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 14 transition count 11
Applied a total of 17 rules in 4 ms. Remains 14 /24 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-21 14:23:31] [INFO ] Computed 4 invariants in 5 ms
[2024-05-21 14:23:31] [INFO ] Implicit Places using invariants in 24 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/24 places, 11/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 11 transition count 9
Applied a total of 4 rules in 1 ms. Remains 11 /13 variables (removed 2) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2024-05-21 14:23:31] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 14:23:31] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 14:23:31] [INFO ] Invariant cache hit.
[2024-05-21 14:23:31] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/24 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 11/24 places, 9/18 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-11
Product exploration explored 100000 steps with 62 reset in 99 ms.
Stack based approach found an accepted trace after 97770 steps with 58 reset with depth 911 and stack size 909 in 96 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-11 finished in 579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G((F(p1)||X((p2 U p3)))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 14:23:32] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 14:23:32] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-12
Product exploration explored 100000 steps with 691 reset in 111 ms.
Product exploration explored 100000 steps with 663 reset in 117 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p3 p2), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 7 factoid took 133 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1)]
RANDOM walk for 40059 steps (14 resets) in 13 ms. (2861 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 14:23:32] [INFO ] Computed 3 invariants in 1 ms
Problem apf4 is UNSAT
After SMT solving in domain Real declared 3/38 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 13 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 16ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p3 p2), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p0)), (G (OR p1 p2 p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 345 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 15 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 12 transition count 8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 9 transition count 7
Applied a total of 22 rules in 4 ms. Remains 9 /20 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-21 14:23:33] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 14:23:33] [INFO ] Implicit Places using invariants in 16 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/20 places, 7/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21 ms. Remains : 8/20 places, 7/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p3), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
RANDOM walk for 3515 steps (2 resets) in 4 ms. (703 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p3), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p1)), (F (NOT (OR p3 p1)))]
Knowledge based reduction with 7 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 260 reset in 65 ms.
Product exploration explored 100000 steps with 242 reset in 73 ms.
Built C files in :
/tmp/ltsmin5961672545613828975
[2024-05-21 14:23:34] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-21 14:23:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:23:34] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-21 14:23:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:23:34] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-21 14:23:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:23:34] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5961672545613828975
Running compilation step : cd /tmp/ltsmin5961672545613828975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin5961672545613828975;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5961672545613828975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9446671289451713710.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 8 cols
[2024-05-21 14:23:49] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 14:23:49] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 14:23:49] [INFO ] Invariant cache hit.
[2024-05-21 14:23:49] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-21 14:23:49] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-21 14:23:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 8/8 places, 7/7 transitions.
Built C files in :
/tmp/ltsmin11018464524945583375
[2024-05-21 14:23:49] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-21 14:23:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:23:49] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-21 14:23:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:23:49] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-21 14:23:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:23:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11018464524945583375
Running compilation step : cd /tmp/ltsmin11018464524945583375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin11018464524945583375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11018464524945583375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3494548794997569851.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 14:24:04] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:24:04] [INFO ] Flatten gal took : 0 ms
[2024-05-21 14:24:04] [INFO ] Time to serialize gal into /tmp/LTL11616871035703182694.gal : 0 ms
[2024-05-21 14:24:04] [INFO ] Time to serialize properties into /tmp/LTL10201289585132879265.prop : 0 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11616871035703182694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13167202461065163351.hoa' '-atoms' '/tmp/LTL10201289585132879265.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10201289585132879265.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13167202461065163351.hoa
Detected timeout of ITS tools.
[2024-05-21 14:24:19] [INFO ] Flatten gal took : 1 ms
[2024-05-21 14:24:19] [INFO ] Flatten gal took : 0 ms
[2024-05-21 14:24:19] [INFO ] Time to serialize gal into /tmp/LTL6287875638286316575.gal : 1 ms
[2024-05-21 14:24:19] [INFO ] Time to serialize properties into /tmp/LTL1472339839108202873.ltl : 1 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6287875638286316575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1472339839108202873.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X("(MpA<=StR)"))&&(G((F("((StR>=1)||(MpA<=StR))"))||(X(("(StR<1)")U("(CG<=StR)"))))))))
Formula 0 simplified : X(X!"(MpA<=StR)" | F(G!"((StR>=1)||(MpA<=StR))" & X(!"(StR<1)" R !"(CG<=StR)")))
Detected timeout of ITS tools.
[2024-05-21 14:24:34] [INFO ] Flatten gal took : 3 ms
[2024-05-21 14:24:34] [INFO ] Applying decomposition
[2024-05-21 14:24:34] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14277771102408776302.txt' '-o' '/tmp/graph14277771102408776302.bin' '-w' '/tmp/graph14277771102408776302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14277771102408776302.bin' '-l' '-1' '-v' '-w' '/tmp/graph14277771102408776302.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:24:34] [INFO ] Decomposing Gal with order
[2024-05-21 14:24:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:24:34] [INFO ] Flatten gal took : 1 ms
[2024-05-21 14:24:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 14:24:34] [INFO ] Time to serialize gal into /tmp/LTL8437241802381852197.gal : 1 ms
[2024-05-21 14:24:34] [INFO ] Time to serialize properties into /tmp/LTL10018738453799716060.ltl : 1 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8437241802381852197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10018738453799716060.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X("(gu1.MpA<=gu1.StR)"))&&(G((F("((gu1.StR>=1)||(gu1.MpA<=gu1.StR))"))||(X(("(gu1.StR<1)")U("(gu1.CG<=gu1.StR)"))))))))
Formula 0 simplified : X(X!"(gu1.MpA<=gu1.StR)" | F(G!"((gu1.StR>=1)||(gu1.MpA<=gu1.StR))" & X(!"(gu1.StR<1)" R !"(gu1.CG<=gu1.StR)")))
Reverse transition relation is NOT exact ! Due to transitions t2_t12_t13_t14, Intersection with reachable at each step enabled. (destroyed/reverse/interse...173
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-12 finished in 77769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(p1)))&&p0))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 14:24:49] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 14:24:49] [INFO ] Implicit Places using invariants in 41 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-13 finished in 288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
[2024-05-21 14:24:50] [INFO ] Invariant cache hit.
[2024-05-21 14:24:50] [INFO ] Implicit Places using invariants in 24 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 41 ms.
Product exploration explored 100000 steps with 50000 reset in 47 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-14 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0020P1-LTLCardinality-03
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 18 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 18 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 16 transition count 11
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 3 with 4 rules applied. Total rules applied 19 place count 14 transition count 9
Applied a total of 19 rules in 8 ms. Remains 14 /24 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 14 cols
[2024-05-21 14:24:50] [INFO ] Computed 6 invariants in 0 ms
[2024-05-21 14:24:50] [INFO ] Implicit Places using invariants in 24 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/24 places, 9/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 12 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 11 transition count 7
Applied a total of 4 rules in 1 ms. Remains 11 /13 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 11 cols
[2024-05-21 14:24:50] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 14:24:50] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 14:24:50] [INFO ] Invariant cache hit.
[2024-05-21 14:24:50] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 11/24 places, 7/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 88 ms. Remains : 11/24 places, 7/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-03
Product exploration explored 100000 steps with 5 reset in 81 ms.
Product exploration explored 100000 steps with 4 reset in 104 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 356 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40097 steps (20 resets) in 18 ms. (2110 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-05-21 14:24:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 7/18 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/11 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 640 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-21 14:24:52] [INFO ] Invariant cache hit.
[2024-05-21 14:24:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 14:24:52] [INFO ] Invariant cache hit.
[2024-05-21 14:24:52] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-21 14:24:52] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-21 14:24:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 11/11 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 362 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40160 steps (20 resets) in 16 ms. (2362 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2024-05-21 14:24:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 7/18 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/11 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 45ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 573 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6 reset in 94 ms.
Product exploration explored 100000 steps with 6 reset in 110 ms.
Built C files in :
/tmp/ltsmin5814218054949881386
[2024-05-21 14:24:53] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-21 14:24:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:24:53] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-21 14:24:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:24:53] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-21 14:24:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:24:53] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5814218054949881386
Running compilation step : cd /tmp/ltsmin5814218054949881386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin5814218054949881386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5814218054949881386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7550014796262320851.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-21 14:25:09] [INFO ] Invariant cache hit.
[2024-05-21 14:25:09] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 14:25:09] [INFO ] Invariant cache hit.
[2024-05-21 14:25:09] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-21 14:25:09] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-21 14:25:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 11/11 places, 7/7 transitions.
Built C files in :
/tmp/ltsmin5182956091871632808
[2024-05-21 14:25:09] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-21 14:25:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:25:09] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-21 14:25:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:25:09] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-21 14:25:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:25:09] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5182956091871632808
Running compilation step : cd /tmp/ltsmin5182956091871632808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin5182956091871632808;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5182956091871632808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2379938359307868350.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 14:25:24] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:25:24] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:25:24] [INFO ] Time to serialize gal into /tmp/LTL10137286368947167655.gal : 2 ms
[2024-05-21 14:25:24] [INFO ] Time to serialize properties into /tmp/LTL8309928691452882216.prop : 0 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10137286368947167655.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8986798204256554144.hoa' '-atoms' '/tmp/LTL8309928691452882216.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8309928691452882216.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8986798204256554144.hoa
Detected timeout of ITS tools.
[2024-05-21 14:25:39] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:25:39] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:25:39] [INFO ] Time to serialize gal into /tmp/LTL7952478297999094100.gal : 1 ms
[2024-05-21 14:25:39] [INFO ] Time to serialize properties into /tmp/LTL13926174275774088120.ltl : 0 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7952478297999094100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13926174275774088120.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(SR<=CwA)")||(X("(SwG>=1)"))))))
Formula 0 simplified : GF(!"(SR<=CwA)" & X!"(SwG>=1)")
Detected timeout of ITS tools.
[2024-05-21 14:25:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:25:54] [INFO ] Applying decomposition
[2024-05-21 14:25:54] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5569076287899537331.txt' '-o' '/tmp/graph5569076287899537331.bin' '-w' '/tmp/graph5569076287899537331.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5569076287899537331.bin' '-l' '-1' '-v' '-w' '/tmp/graph5569076287899537331.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:25:54] [INFO ] Decomposing Gal with order
[2024-05-21 14:25:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:25:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 14:25:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 14:25:54] [INFO ] Time to serialize gal into /tmp/LTL3829302611800929560.gal : 1 ms
[2024-05-21 14:25:54] [INFO ] Time to serialize properties into /tmp/LTL17937350679332282628.ltl : 1 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3829302611800929560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17937350679332282628.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(gu0.SR<=gu0.CwA)")||(X("(gi1.gu3.SwG>=1)"))))))
Formula 0 simplified : GF(!"(gu0.SR<=gu0.CwA)" & X!"(gi1.gu3.SwG>=1)")
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-03 finished in 79159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G((F(p1)||X((p2 U p3)))))))'
[2024-05-21 14:26:09] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5780250386131844559
[2024-05-21 14:26:09] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-21 14:26:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:26:09] [INFO ] Applying decomposition
[2024-05-21 14:26:09] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-21 14:26:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:26:09] [INFO ] Flatten gal took : 1 ms
[2024-05-21 14:26:09] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-21 14:26:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 14:26:09] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5780250386131844559
Running compilation step : cd /tmp/ltsmin5780250386131844559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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.202405141337/bin/convert-linux64' '-i' '/tmp/graph7663677088925511339.txt' '-o' '/tmp/graph7663677088925511339.bin' '-w' '/tmp/graph7663677088925511339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7663677088925511339.bin' '-l' '-1' '-v' '-w' '/tmp/graph7663677088925511339.weights' '-q' '0' '-e' '0.001'
[2024-05-21 14:26:09] [INFO ] Decomposing Gal with order
[2024-05-21 14:26:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 14:26:09] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 14:26:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 14:26:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 14:26:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality10744477635493821445.gal : 1 ms
[2024-05-21 14:26:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality7581726695734595324.ltl : 0 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10744477635493821445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7581726695734595324.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F(G(("(gu7.SR<=gu7.CwA)")||(X("(gi0.gi1.gu3.SwG>=1)"))))))
Formula 0 simplified : GF(!"(gu7.SR<=gu7.CwA)" & X!"(gi0.gi1.gu3.SwG>=1)")
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin5780250386131844559;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin5780250386131844559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)||X((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: <>([](((LTLAPp0==true)||X((LTLAPp1==true)))))
pins2lts-mc-linux64( 1/ 8), 0.001: "<>([](((LTLAPp0==true)||X((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: There are 25 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.013: State length is 25, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.013: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.013: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.013: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.013: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.027: [Blue] ~120 levels ~960 states ~1912 transitions
pins2lts-mc-linux64( 2/ 8), 0.038: [Blue] ~240 levels ~1920 states ~5568 transitions
pins2lts-mc-linux64( 7/ 8), 0.119: [Blue] ~480 levels ~3840 states ~12576 transitions
pins2lts-mc-linux64( 5/ 8), 0.206: [Blue] ~960 levels ~7680 states ~16328 transitions
pins2lts-mc-linux64( 5/ 8), 0.266: [Blue] ~1073 levels ~15360 states ~31352 transitions
pins2lts-mc-linux64( 5/ 8), 0.373: [Blue] ~1236 levels ~30720 states ~76432 transitions
pins2lts-mc-linux64( 4/ 8), 0.602: [Blue] ~1069 levels ~61440 states ~157160 transitions
pins2lts-mc-linux64( 6/ 8), 1.409: [Blue] ~4955 levels ~122880 states ~388952 transitions
pins2lts-mc-linux64( 4/ 8), 2.501: [Blue] ~1069 levels ~245760 states ~702056 transitions
pins2lts-mc-linux64( 4/ 8), 3.959: [Blue] ~1069 levels ~491520 states ~1428456 transitions
pins2lts-mc-linux64( 4/ 8), 5.656: [Blue] ~1069 levels ~983040 states ~2882288 transitions
pins2lts-mc-linux64( 4/ 8), 9.000: [Blue] ~1069 levels ~1966080 states ~6685064 transitions
pins2lts-mc-linux64( 3/ 8), 14.939: [Blue] ~461450 levels ~3932160 states ~22898840 transitions
pins2lts-mc-linux64( 4/ 8), 25.144: [Blue] ~589760 levels ~7864320 states ~35294704 transitions
pins2lts-mc-linux64( 4/ 8), 45.552: [Blue] ~1572079 levels ~15728640 states ~80051520 transitions
pins2lts-mc-linux64( 1/ 8), 95.589: [Blue] ~3924756 levels ~31457280 states ~186109824 transitions
pins2lts-mc-linux64( 1/ 8), 143.717: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 143.797:
pins2lts-mc-linux64( 0/ 8), 143.797: Explored 43033845 states 278473804 transitions, fanout: 6.471
pins2lts-mc-linux64( 0/ 8), 143.797: Total exploration time 143.710 sec (143.630 sec minimum, 143.674 sec on average)
pins2lts-mc-linux64( 0/ 8), 143.797: States per second: 299449, Transitions per second: 1937748
pins2lts-mc-linux64( 0/ 8), 143.797:
pins2lts-mc-linux64( 0/ 8), 143.797: State space has 74523445 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 143.797: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 143.797: blue states: 43033845 (57.75%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 143.797: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 143.797: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 143.797:
pins2lts-mc-linux64( 0/ 8), 143.797: Total memory used for local state coloring: 617.9MB
pins2lts-mc-linux64( 0/ 8), 143.797:
pins2lts-mc-linux64( 0/ 8), 143.797: Queue width: 8B, total height: 40494382, memory: 308.95MB
pins2lts-mc-linux64( 0/ 8), 143.797: Tree memory: 824.6MB, 11.6 B/state, compr.: 11.4%
pins2lts-mc-linux64( 0/ 8), 143.797: Tree fill ratio (roots/leafs): 55.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 143.797: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 143.797: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 143.797: Est. total memory use: 1133.5MB (~1332.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5780250386131844559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)||X((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5780250386131844559;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)||X((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-21 14:47:36] [INFO ] Flatten gal took : 11 ms
[2024-05-21 14:47:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality7718812118974245161.gal : 1 ms
[2024-05-21 14:47:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality15000329179164516579.ltl : 1 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7718812118974245161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15000329179164516579.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F(G(("(SR<=CwA)")||(X("(SwG>=1)"))))))
Formula 0 simplified : GF(!"(SR<=CwA)" & X!"(SwG>=1)")
Detected timeout of ITS tools.
[2024-05-21 15:09:02] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:09:02] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-21 15:09:02] [INFO ] Transformed 24 places.
[2024-05-21 15:09:02] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 15:09:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality987932027529796777.gal : 1 ms
[2024-05-21 15:09:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality5898306617625438425.ltl : 1 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality987932027529796777.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5898306617625438425.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("(SR<=CwA)")||(X("(SwG>=1)"))))))
Formula 0 simplified : GF(!"(SR<=CwA)" & X!"(SwG>=1)")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N0020P1, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505900451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0020P1.tgz
mv ClientsAndServers-PT-N0020P1 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;