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.r520-tall-171662338900619.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 ltsminxred
Input is Referendum-PT-0200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662338900619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 119K Apr 11 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 570K Apr 11 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 85K Apr 11 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 626K Apr 11 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 125K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 417K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 206K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 195K Apr 11 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 939K Apr 11 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 233K Apr 11 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 11 17:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 52K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 228K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717261925074

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:12:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:12:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:12:06] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-01 17:12:06] [INFO ] Transformed 601 places.
[2024-06-01 17:12:06] [INFO ] Transformed 401 transitions.
[2024-06-01 17:12:06] [INFO ] Found NUPN structural information;
[2024-06-01 17:12:06] [INFO ] Parsed PT model containing 601 places and 401 transitions and 1001 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Referendum-PT-0200-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 601 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Applied a total of 0 rules in 11 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 601 cols
[2024-06-01 17:12:06] [INFO ] Computed 200 invariants in 12 ms
[2024-06-01 17:12:07] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-01 17:12:07] [INFO ] Invariant cache hit.
[2024-06-01 17:12:07] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 17:12:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 26686 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 400/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 22248 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 49092ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 49116ms
Finished structural reductions in LTL mode , in 1 iterations and 49763 ms. Remains : 601/601 places, 401/401 transitions.
Support contains 601 out of 601 places after structural reductions.
[2024-06-01 17:12:56] [INFO ] Flatten gal took : 85 ms
[2024-06-01 17:12:56] [INFO ] Flatten gal took : 33 ms
[2024-06-01 17:12:56] [INFO ] Input system was already deterministic with 401 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 5336 steps (24 resets) in 730 ms. (7 steps per ms) remains 0/19 properties
Computed a total of 601 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 601 transition count 401
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||((p1 U p2)&&(p2 U (p3&&F(!p0)))))))'
Support contains 601 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-06-01 17:12:57] [INFO ] Invariant cache hit.
[2024-06-01 17:12:57] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 17:12:57] [INFO ] Invariant cache hit.
[2024-06-01 17:12:58] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 17:12:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 25612 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 400/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21112 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 46832ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 46838ms
Finished structural reductions in LTL mode , in 1 iterations and 47279 ms. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 432 ms :[true, (NOT p2), (OR (NOT p3) p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), p0]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-0200-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-00 finished in 47793 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(((p1 U (p2 U X(X(p3))))&&p0)))'
Support contains 600 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Applied a total of 0 rules in 5 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-06-01 17:13:45] [INFO ] Invariant cache hit.
[2024-06-01 17:13:45] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 17:13:45] [INFO ] Invariant cache hit.
[2024-06-01 17:13:45] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 17:13:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 25037 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 400/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21462 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 46590ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 46595ms
Finished structural reductions in LTL mode , in 1 iterations and 46988 ms. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-02
Product exploration explored 100000 steps with 8429 reset in 4297 ms.
Product exploration explored 100000 steps with 8425 reset in 4305 ms.
Computed a total of 601 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 601 transition count 401
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X p2), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 1426 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (196 resets) in 5566 ms. (7 steps per ms) remains 5/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 721 ms. (55 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 889 ms. (44 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 679 ms. (58 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 731 ms. (54 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 783 ms. (51 steps per ms) remains 5/5 properties
[2024-06-01 17:14:46] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 600/600 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/600 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/601 variables, 200/800 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 1/801 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1402 constraints, problems are : Problem set: 3 solved, 2 unsolved in 445 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 600/600 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/600 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/601 variables, 200/800 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 1/801 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 2/1404 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1404 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1002 variables, 0/1404 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1404 constraints, problems are : Problem set: 3 solved, 2 unsolved in 4352 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 5514ms problems are : Problem set: 3 solved, 2 unsolved
Finished Parikh walk after 201 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=33 )
Parikh walk visited 2 properties in 194 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X p2), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p0) (NOT p1) p3)), (G (OR (NOT p0) p2 p1 p3)), (G (OR (NOT p0) (NOT p2) p1 p3))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p2) p1 p3))), (F (NOT (AND (OR p0 (NOT p2) p3) (OR (NOT p2) p1 p3)))), (F p0), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p1 p3))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F p3), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (F (NOT (AND p1 (NOT p3))))]
Knowledge based reduction with 38 factoid took 6334 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 428 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
[2024-06-01 17:14:58] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
[2024-06-01 17:14:59] [INFO ] Invariant cache hit.
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X p2), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p0) (NOT p1) p3)), (G (OR (NOT p0) p2 p1 p3)), (G (OR (NOT p0) (NOT p2) p1 p3))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p2) p1 p3))), (F (NOT (AND (OR p0 (NOT p2) p3) (OR (NOT p2) p1 p3)))), (F p0), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p1 p3))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F p3), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))))), (F (NOT (AND p1 (NOT p3)))), (G (NOT p0)), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 38 factoid took 6644 ms. Reduced automaton from 8 states, 21 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0200-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-02 finished in 81416 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||(p1 U p2))))'
Support contains 601 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-06-01 17:15:06] [INFO ] Invariant cache hit.
[2024-06-01 17:15:06] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 17:15:06] [INFO ] Invariant cache hit.
[2024-06-01 17:15:07] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 17:15:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 24862 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 400/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21137 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 46073ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 46077ms
Finished structural reductions in LTL mode , in 1 iterations and 46440 ms. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 2220 ms.
Product exploration explored 100000 steps with 50000 reset in 2276 ms.
Computed a total of 601 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 601 transition count 401
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 11 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0200-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-03 finished in 51218 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((F(p0) U (p1&&F(p2))))))'
Support contains 600 out of 601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Applied a total of 0 rules in 20 ms. Remains 601 /601 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-06-01 17:15:58] [INFO ] Invariant cache hit.
[2024-06-01 17:15:58] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-01 17:15:58] [INFO ] Invariant cache hit.
[2024-06-01 17:15:58] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-06-01 17:15:58] [INFO ] Redundant transitions in 21 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-01 17:15:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/1002 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 1402 constraints, problems are : Problem set: 0 solved, 400 unsolved in 25411 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 401/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 401/1002 variables, 601/1402 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 400/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/1002 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1002/1002 variables, and 1802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 21073 ms.
Refiners :[Domain max(s): 601/601 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 601/601 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 46552ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 46555ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46974 ms. Remains : 601/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-04
Product exploration explored 100000 steps with 732 reset in 5983 ms.
Product exploration explored 100000 steps with 731 reset in 6086 ms.
Computed a total of 601 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 601 transition count 401
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 156 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0200-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-04 finished in 59585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))&&F(p1)) U X(X(G(p2)))))'
Support contains 400 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 401 transition count 401
Applied a total of 200 rules in 8 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-06-01 17:16:57] [INFO ] Computed 0 invariants in 2 ms
[2024-06-01 17:16:57] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 17:16:57] [INFO ] Invariant cache hit.
[2024-06-01 17:16:57] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 17:16:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17085 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15456 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 32632ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 32635ms
Starting structural reductions in LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32867 ms. Remains : 401/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-05
Product exploration explored 100000 steps with 29647 reset in 2693 ms.
Product exploration explored 100000 steps with 29465 reset in 2771 ms.
Computed a total of 401 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 401 transition count 401
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 333 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
RANDOM walk for 40000 steps (196 resets) in 949 ms. (42 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 1/1 properties
[2024-06-01 17:17:37] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 200/802 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40 ms.
Refiners :[Domain max(s): 0/401 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 12 factoid took 1086 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Support contains 400 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-06-01 17:17:39] [INFO ] Invariant cache hit.
[2024-06-01 17:17:39] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 17:17:39] [INFO ] Invariant cache hit.
[2024-06-01 17:17:39] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 17:17:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 16984 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15627 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 32676ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 32681ms
Finished structural reductions in LTL mode , in 1 iterations and 32940 ms. Remains : 401/401 places, 401/401 transitions.
Computed a total of 401 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 401 transition count 401
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 283 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 796 steps (0 resets) in 32 ms. (24 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p2 p1))), (F p0), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 603 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 29573 reset in 2592 ms.
Product exploration explored 100000 steps with 29661 reset in 2654 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Support contains 400 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-06-01 17:18:20] [INFO ] Redundant transitions in 10 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-01 17:18:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17017 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15524 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 32605ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 32608ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32649 ms. Remains : 401/401 places, 401/401 transitions.
Support contains 400 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-06-01 17:18:52] [INFO ] Invariant cache hit.
[2024-06-01 17:18:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 17:18:52] [INFO ] Invariant cache hit.
[2024-06-01 17:18:53] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 17:18:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17242 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15817 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 33111ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 33124ms
Finished structural reductions in LTL mode , in 1 iterations and 33372 ms. Remains : 401/401 places, 401/401 transitions.
Treatment of property Referendum-PT-0200-LTLCardinality-05 finished in 148698 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((G(p0)||X(p1)))&&F(G(!p0)))))'
Support contains 201 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 401 transition count 401
Applied a total of 200 rules in 29 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
[2024-06-01 17:19:26] [INFO ] Invariant cache hit.
[2024-06-01 17:19:26] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 17:19:26] [INFO ] Invariant cache hit.
[2024-06-01 17:19:26] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 17:19:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17423 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15456 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 32933ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 32938ms
Starting structural reductions in LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33287 ms. Remains : 401/601 places, 401/401 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), p0, (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1046 steps with 12 reset in 29 ms.
FORMULA Referendum-PT-0200-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-06 finished in 33557 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((X(p1)||p0)))'
Support contains 2 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 398 places and 0 transitions.
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 203 transition count 203
Discarding 197 places :
Symmetric choice reduction at 1 with 197 rule applications. Total rules 793 place count 6 transition count 6
Iterating global reduction 1 with 197 rules applied. Total rules applied 990 place count 6 transition count 6
Applied a total of 990 rules in 16 ms. Remains 6 /601 variables (removed 595) and now considering 6/401 (removed 395) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-06-01 17:19:59] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 17:19:59] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-06-01 17:19:59] [INFO ] Invariant cache hit.
[2024-06-01 17:19:59] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 17:19:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 3/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 43 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/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 32 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 77ms
Starting structural reductions in LTL mode, iteration 1 : 6/601 places, 6/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 6/601 places, 6/401 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 206 steps with 1 reset in 1 ms.
FORMULA Referendum-PT-0200-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-08 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Graph (complete) has 600 edges and 601 vertex of which 3 are kept as prefixes of interest. Removing 598 places using SCC suffix rule.2 ms
Discarding 598 places :
Also discarding 398 output transitions
Drop transitions (Output transitions of discarded places.) removed 398 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 3 transition count 3
Applied a total of 2 rules in 13 ms. Remains 3 /601 variables (removed 598) and now considering 3/401 (removed 398) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-06-01 17:20:00] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:20:00] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-06-01 17:20:00] [INFO ] Invariant cache hit.
[2024-06-01 17:20:00] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2024-06-01 17:20:00] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 17:20:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21 ms.
Refiners :[Domain max(s): 3/3 constraints, State Equation: 3/3 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/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/6 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17 ms.
Refiners :[Domain max(s): 3/3 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 42ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/601 places, 3/401 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 3/601 places, 3/401 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 33 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0200-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLCardinality-10 finished in 360 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((F(G(p0))||G(p1))))'
Support contains 4 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 397 places and 0 transitions.
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 0 with 594 rules applied. Total rules applied 594 place count 204 transition count 204
Discarding 195 places :
Symmetric choice reduction at 1 with 195 rule applications. Total rules 789 place count 9 transition count 9
Iterating global reduction 1 with 195 rules applied. Total rules applied 984 place count 9 transition count 9
Applied a total of 984 rules in 6 ms. Remains 9 /601 variables (removed 592) and now considering 9/401 (removed 392) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-06-01 17:20:00] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 17:20:00] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 17:20:00] [INFO ] Invariant cache hit.
[2024-06-01 17:20:00] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2024-06-01 17:20:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/18 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 9 constraints, problems are : Problem set: 0 solved, 8 unsolved in 55 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 4/18 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 17 constraints, problems are : Problem set: 0 solved, 8 unsolved in 51 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Starting structural reductions in LTL mode, iteration 1 : 9/601 places, 9/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 9/601 places, 9/401 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-14
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0200-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLCardinality-14 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))&&F(p1)) U X(X(G(p2)))))'
Found a Lengthening insensitive property : Referendum-PT-0200-LTLCardinality-05
Stuttering acceptance computed with spot in 350 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
Support contains 400 out of 601 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Graph (complete) has 600 edges and 601 vertex of which 401 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.3 ms
Discarding 200 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 401 /601 variables (removed 200) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-06-01 17:20:01] [INFO ] Computed 0 invariants in 4 ms
[2024-06-01 17:20:01] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 17:20:01] [INFO ] Invariant cache hit.
[2024-06-01 17:20:01] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 17:20:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17529 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15852 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 33458ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 33466ms
Starting structural reductions in LI_LTL mode, iteration 1 : 401/601 places, 401/401 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 33737 ms. Remains : 401/601 places, 401/401 transitions.
Running random walk in product with property : Referendum-PT-0200-LTLCardinality-05
Product exploration explored 100000 steps with 29585 reset in 2697 ms.
Product exploration explored 100000 steps with 29493 reset in 2743 ms.
Computed a total of 401 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 401 transition count 401
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 352 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
RANDOM walk for 40000 steps (196 resets) in 1270 ms. (31 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 505 ms. (79 steps per ms) remains 1/1 properties
[2024-06-01 17:20:41] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 200/802 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[Domain max(s): 0/401 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 12 factoid took 1101 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Support contains 400 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 1 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-06-01 17:20:43] [INFO ] Invariant cache hit.
[2024-06-01 17:20:43] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 17:20:43] [INFO ] Invariant cache hit.
[2024-06-01 17:20:43] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 17:20:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17387 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15896 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 33361ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 33364ms
Finished structural reductions in LTL mode , in 1 iterations and 33626 ms. Remains : 401/401 places, 401/401 transitions.
Computed a total of 401 stabilizing places and 401 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 401 transition count 401
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 294 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 796 steps (0 resets) in 34 ms. (22 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p2 p1))), (F p0), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 580 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 29651 reset in 2599 ms.
Product exploration explored 100000 steps with 29451 reset in 2684 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Support contains 400 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 9 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-06-01 17:21:25] [INFO ] Redundant transitions in 18 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-01 17:21:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17135 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15687 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 32892ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 32895ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32928 ms. Remains : 401/401 places, 401/401 transitions.
Support contains 400 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-06-01 17:21:58] [INFO ] Invariant cache hit.
[2024-06-01 17:21:58] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 17:21:58] [INFO ] Invariant cache hit.
[2024-06-01 17:21:58] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-06-01 17:21:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 0/802 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 802 constraints, problems are : Problem set: 0 solved, 400 unsolved in 17142 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 401/601 variables, 200/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 201/802 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/802 variables, 201/802 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 400/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 400 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1202 constraints, problems are : Problem set: 0 solved, 400 unsolved in 15853 ms.
Refiners :[Domain max(s): 401/401 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 0/0 constraints]
After SMT, in 33059ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 33063ms
Finished structural reductions in LTL mode , in 1 iterations and 33308 ms. Remains : 401/401 places, 401/401 transitions.
Treatment of property Referendum-PT-0200-LTLCardinality-05 finished in 150799 ms.
[2024-06-01 17:22:31] [INFO ] Flatten gal took : 27 ms
[2024-06-01 17:22:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 17:22:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 601 places, 401 transitions and 1001 arcs took 16 ms.
Total runtime 625403 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

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

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-0200"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Referendum-PT-0200, 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 r520-tall-171662338900619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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