Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 208K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 203K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 463K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 534K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 57K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748977217009

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-03 19:00:19] [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]
[2025-06-03 19:00:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 19:00:19] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2025-06-03 19:00:19] [INFO ] Transformed 151 places.
[2025-06-03 19:00:19] [INFO ] Transformed 101 transitions.
[2025-06-03 19:00:19] [INFO ] Found NUPN structural information;
[2025-06-03 19:00:19] [INFO ] Parsed PT model containing 151 places and 101 transitions and 251 arcs in 339 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0050-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 151 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 11 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 151 cols
[2025-06-03 19:00:20] [INFO ] Computed 50 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:00:20] [INFO ] Implicit Places using invariants in 334 ms returned []
[2025-06-03 19:00:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:00:20] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-03 19:00:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 151/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 352 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6948 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 151/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 100/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 452 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5627 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12661ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 12681ms
Finished structural reductions in LTL mode , in 1 iterations and 13382 ms. Remains : 151/151 places, 101/101 transitions.
Support contains 151 out of 151 places after structural reductions.
[2025-06-03 19:00:33] [INFO ] Flatten gal took : 64 ms
[2025-06-03 19:00:33] [INFO ] Flatten gal took : 27 ms
[2025-06-03 19:00:33] [INFO ] Input system was already deterministic with 101 transitions.
RANDOM walk for 440 steps (6 resets) in 106 ms. (4 steps per ms) remains 0/14 properties
Computed a total of 151 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 151 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(p0))||G(p1))))))'
Support contains 100 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-06-03 19:00:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:00:34] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-03 19:00:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:00:34] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-03 19:00:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 151/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 352 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6657 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 151/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 100/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 452 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5929 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12653ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 12657ms
Finished structural reductions in LTL mode , in 1 iterations and 13031 ms. Remains : 151/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 664 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 9 steps with 1 reset in 2 ms.
FORMULA Referendum-PT-0050-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-00 finished in 13820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p0) U X((G(p1)||(p1&&F(p2)))))))))'
Support contains 150 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-06-03 19:00:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:00:48] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-03 19:00:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:00:48] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-03 19:00:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 151/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 352 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5676 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 151/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 100/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 452 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5643 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11345ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 11346ms
Finished structural reductions in LTL mode , in 1 iterations and 11670 ms. Remains : 151/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 572 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-01
Stuttering criterion allowed to conclude after 60 steps with 1 reset in 6 ms.
FORMULA Referendum-PT-0050-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-01 finished in 12286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 100 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-06-03 19:01:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:00] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-03 19:01:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:00] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-03 19:01:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 151/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 352 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6666 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 151/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 100/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 452 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6572 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13264ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 13265ms
Finished structural reductions in LTL mode , in 1 iterations and 13584 ms. Remains : 151/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-02 finished in 13731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Graph (complete) has 150 edges and 151 vertex of which 101 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.3 ms
Discarding 50 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 101 /151 variables (removed 50) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 101 cols
[2025-06-03 19:01:14] [INFO ] Computed 0 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:14] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-03 19:01:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:14] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:01:14] [INFO ] Redundant transitions in 5 ms returned []
Running 100 sub problems to find dead transitions.
[2025-06-03 19:01:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 51/202 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 51/202 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 202 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5443 ms.
Refiners :[Domain max(s): 101/101 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 51/202 variables, 51/151 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 51/202 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 100/302 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 302 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5401 ms.
Refiners :[Domain max(s): 101/101 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10868ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 10870ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/151 places, 101/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11117 ms. Remains : 101/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-04
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 3 ms.
FORMULA Referendum-PT-0050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-04 finished in 11199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0)&&(G((p1||G(p2)))||(F((p3&&F(!p0)))&&(p1||G(p2))))))'
Support contains 151 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 151 cols
[2025-06-03 19:01:25] [INFO ] Computed 50 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:25] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-03 19:01:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:25] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-03 19:01:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 151/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 352 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6793 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 151/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 100/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 452 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6450 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13266ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 13267ms
Finished structural reductions in LTL mode , in 1 iterations and 13575 ms. Remains : 151/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 537 ms :[(OR p0 (AND (NOT p1) (NOT p2))), true, p0, (NOT p2), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND p0 (NOT p2) (NOT p1)), (OR (NOT p3) p0), p0, (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 1097 ms.
Product exploration explored 100000 steps with 50000 reset in 750 ms.
Computed a total of 151 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 151 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 (NOT p2) p3 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p3 p0))), (X (NOT p3)), (X (NOT (AND (NOT p1) p2 p3 p0))), (X (NOT (AND p1 p3 p0))), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p2), (X (NOT p0)), (X (NOT (AND p1 (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) p3 p0)))), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p2 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p3 p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p3 p0)))), (X (X p2)), (X (X (NOT p1))), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p3))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 32 factoid took 48 ms. Reduced automaton from 10 states, 26 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0050-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLCardinality-05 finished in 16209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(G(p1))) U X(X(!p2))))'
Support contains 101 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-06-03 19:01:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:41] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-03 19:01:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:42] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-03 19:01:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 151/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 352 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6280 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/151 variables, 50/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/252 variables, 151/352 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 100/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 452 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6492 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12795ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 12796ms
Finished structural reductions in LTL mode , in 1 iterations and 13122 ms. Remains : 151/151 places, 101/101 transitions.
Stuttering acceptance computed with spot in 723 ms :[p2, (AND p2 (NOT p1)), p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), true, (AND p2 (NOT p1)), p2, (AND (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p0) p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-07 finished in 13890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Graph (complete) has 150 edges and 151 vertex of which 5 are kept as prefixes of interest. Removing 146 places using SCC suffix rule.1 ms
Discarding 146 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Applied a total of 2 rules in 16 ms. Remains 5 /151 variables (removed 146) and now considering 5/101 (removed 96) transitions.
// Phase 1: matrix 5 rows 5 cols
[2025-06-03 19:01:55] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 19:01:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:55] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:01:55] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 19:01:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 3/10 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 63 ms.
Refiners :[Domain max(s): 5/5 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 3/10 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/10 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 72 ms.
Refiners :[Domain max(s): 5/5 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 139ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/151 places, 5/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 5/151 places, 5/101 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-09
Product exploration explored 100000 steps with 36231 reset in 255 ms.
Product exploration explored 100000 steps with 36405 reset in 254 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 23 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0050-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLCardinality-09 finished in 952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 52 transition count 52
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 196 place count 4 transition count 4
Iterating global reduction 1 with 48 rules applied. Total rules applied 244 place count 4 transition count 4
Applied a total of 244 rules in 15 ms. Remains 4 /151 variables (removed 147) and now considering 4/101 (removed 97) transitions.
// Phase 1: matrix 4 rows 4 cols
[2025-06-03 19:01:56] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 19:01:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:56] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2025-06-03 19:01:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 81 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 85 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 168ms
Starting structural reductions in LTL mode, iteration 1 : 4/151 places, 4/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 4/151 places, 4/101 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-10
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0050-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-10 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Graph (complete) has 150 edges and 151 vertex of which 6 are kept as prefixes of interest. Removing 145 places using SCC suffix rule.1 ms
Discarding 145 places :
Also discarding 94 output transitions
Drop transitions (Output transitions of discarded places.) removed 94 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 6
Applied a total of 3 rules in 4 ms. Remains 6 /151 variables (removed 145) and now considering 6/101 (removed 95) transitions.
// Phase 1: matrix 6 rows 6 cols
[2025-06-03 19:01:57] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 19:01:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:57] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:01:57] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-03 19:01:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 6/9 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 135 ms.
Refiners :[Domain max(s): 6/6 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 6/9 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/12 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/12 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/12 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 108 ms.
Refiners :[Domain max(s): 6/6 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 246ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/151 places, 6/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 6/151 places, 6/101 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-14 finished in 377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 52 transition count 52
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 194 place count 6 transition count 6
Iterating global reduction 1 with 46 rules applied. Total rules applied 240 place count 6 transition count 6
Applied a total of 240 rules in 2 ms. Remains 6 /151 variables (removed 145) and now considering 6/101 (removed 95) transitions.
// Phase 1: matrix 6 rows 6 cols
[2025-06-03 19:01:57] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:57] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-03 19:01:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:01:57] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2025-06-03 19:01:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/12 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 103 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/12 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 116 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 223ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 224ms
Starting structural reductions in LTL mode, iteration 1 : 6/151 places, 6/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 6/151 places, 6/101 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0050-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLCardinality-15 finished in 508 ms.
All properties solved by simple procedures.
Total runtime 98588 ms.

BK_STOP 1748977318249

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="Referendum-PT-0050"
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-5832"
echo " Executing tool itstools"
echo " Input is Referendum-PT-0050, 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 r170-smll-174889233500203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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