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-171662339000635.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-1000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662339000635
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 40M
-rw-r--r-- 1 mcc users 1.4M Apr 11 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.1M Apr 11 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 430K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 16:46 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 429K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 219K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7M Apr 11 22:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13M Apr 11 22:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 11 19:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.0M Apr 11 19:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 83K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K 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 1.2M 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-1000-LTLCardinality-00
FORMULA_NAME Referendum-PT-1000-LTLCardinality-01
FORMULA_NAME Referendum-PT-1000-LTLCardinality-02
FORMULA_NAME Referendum-PT-1000-LTLCardinality-03
FORMULA_NAME Referendum-PT-1000-LTLCardinality-04
FORMULA_NAME Referendum-PT-1000-LTLCardinality-05
FORMULA_NAME Referendum-PT-1000-LTLCardinality-06
FORMULA_NAME Referendum-PT-1000-LTLCardinality-07
FORMULA_NAME Referendum-PT-1000-LTLCardinality-08
FORMULA_NAME Referendum-PT-1000-LTLCardinality-09
FORMULA_NAME Referendum-PT-1000-LTLCardinality-10
FORMULA_NAME Referendum-PT-1000-LTLCardinality-11
FORMULA_NAME Referendum-PT-1000-LTLCardinality-12
FORMULA_NAME Referendum-PT-1000-LTLCardinality-13
FORMULA_NAME Referendum-PT-1000-LTLCardinality-14
FORMULA_NAME Referendum-PT-1000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717262175379

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-1000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:16:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:16:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:16:16] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2024-06-01 17:16:16] [INFO ] Transformed 3001 places.
[2024-06-01 17:16:16] [INFO ] Transformed 2001 transitions.
[2024-06-01 17:16:16] [INFO ] Found NUPN structural information;
[2024-06-01 17:16:16] [INFO ] Parsed PT model containing 3001 places and 2001 transitions and 5001 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 89 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Referendum-PT-1000-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3001 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Applied a total of 0 rules in 35 ms. Remains 3001 /3001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 3001 cols
[2024-06-01 17:16:17] [INFO ] Computed 1000 invariants in 37 ms
[2024-06-01 17:16:18] [INFO ] Implicit Places using invariants in 878 ms returned []
[2024-06-01 17:16:18] [INFO ] Invariant cache hit.
[2024-06-01 17:16:19] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2478 ms to find 0 implicit places.
Running 2000 sub problems to find dead transitions.
[2024-06-01 17:16:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/5002 variables, and 1000 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30049 ms.
Refiners :[Domain max(s): 1000/3001 constraints, Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/3001 constraints, PredecessorRefiner: 2000/2000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
At refinement iteration 2 (OVERLAPS) 2001/3001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3001 variables, 2001/4001 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3001/5002 variables, and 4001 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30028 ms.
Refiners :[Domain max(s): 3001/3001 constraints, Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 0/3001 constraints, PredecessorRefiner: 0/2000 constraints, Known Traps: 0/0 constraints]
After SMT, in 61721ms problems are : Problem set: 0 solved, 2000 unsolved
Search for dead transitions found 0 dead transitions in 61763ms
Finished structural reductions in LTL mode , in 1 iterations and 64306 ms. Remains : 3001/3001 places, 2001/2001 transitions.
Support contains 3001 out of 3001 places after structural reductions.
[2024-06-01 17:17:21] [INFO ] Flatten gal took : 309 ms
[2024-06-01 17:17:22] [INFO ] Flatten gal took : 154 ms
[2024-06-01 17:17:22] [INFO ] Input system was already deterministic with 2001 transitions.
RANDOM walk for 17846 steps (16 resets) in 3417 ms. (5 steps per ms) remains 0/14 properties
FORMULA Referendum-PT-1000-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3001 stabilizing places and 2001 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3001 transition count 2001
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' '!(G(F(p0)))'
Support contains 1000 out of 3001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Graph (complete) has 3000 edges and 3001 vertex of which 1001 are kept as prefixes of interest. Removing 2000 places using SCC suffix rule.9 ms
Discarding 2000 places :
Also discarding 0 output transitions
Ensure Unique test removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 1001 transition count 1001
Applied a total of 1001 rules in 63 ms. Remains 1001 /3001 variables (removed 2000) and now considering 1001/2001 (removed 1000) transitions.
// Phase 1: matrix 1001 rows 1001 cols
[2024-06-01 17:17:23] [INFO ] Computed 0 invariants in 8 ms
[2024-06-01 17:17:23] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 17:17:23] [INFO ] Invariant cache hit.
[2024-06-01 17:17:24] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2024-06-01 17:17:24] [INFO ] Redundant transitions in 51 ms returned []
Running 1000 sub problems to find dead transitions.
[2024-06-01 17:17:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2001/2002 variables, and 2000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30023 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 2 (OVERLAPS) 1001/2001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2001 variables, 1000/3000 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2001/2002 variables, and 3000 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30023 ms.
Refiners :[Domain max(s): 1000/1001 constraints, State Equation: 1000/1001 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 0/0 constraints]
After SMT, in 60693ms problems are : Problem set: 0 solved, 1000 unsolved
Search for dead transitions found 0 dead transitions in 60704ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/3001 places, 1001/2001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61385 ms. Remains : 1001/3001 places, 1001/2001 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-03
Stuttering criterion allowed to conclude after 1001 steps with 0 reset in 108 ms.
FORMULA Referendum-PT-1000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLCardinality-03 finished in 61716 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||G(p2))))))'
Support contains 3000 out of 3001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Applied a total of 0 rules in 37 ms. Remains 3001 /3001 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 3001 cols
[2024-06-01 17:18:25] [INFO ] Computed 1000 invariants in 17 ms
[2024-06-01 17:18:26] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-06-01 17:18:26] [INFO ] Invariant cache hit.
[2024-06-01 17:18:27] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
[2024-06-01 17:18:27] [INFO ] Redundant transitions in 128 ms returned []
Running 2000 sub problems to find dead transitions.
[2024-06-01 17:18:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/5002 variables, and 1000 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30039 ms.
Refiners :[Domain max(s): 1000/3001 constraints, Positive P Invariants (semi-flows): 0/1000 constraints, State Equation: 0/3001 constraints, PredecessorRefiner: 2000/2000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
At refinement iteration 2 (OVERLAPS) 2001/3001 variables, 1000/2000 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3001 variables, 2001/4001 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3001/5002 variables, and 4001 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30033 ms.
Refiners :[Domain max(s): 3001/3001 constraints, Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 0/3001 constraints, PredecessorRefiner: 0/2000 constraints, Known Traps: 0/0 constraints]
After SMT, in 61351ms problems are : Problem set: 0 solved, 2000 unsolved
Search for dead transitions found 0 dead transitions in 61368ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63708 ms. Remains : 3001/3001 places, 2001/2001 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-06
Stuttering criterion allowed to conclude after 1005 steps with 2 reset in 230 ms.
FORMULA Referendum-PT-1000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLCardinality-06 finished in 64092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&G(p2))))'
Support contains 5 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1998 places and 0 transitions.
Ensure Unique test removed 998 transitions
Reduce isomorphic transitions removed 998 transitions.
Iterating post reduction 0 with 2996 rules applied. Total rules applied 2996 place count 1003 transition count 1003
Discarding 995 places :
Symmetric choice reduction at 1 with 995 rule applications. Total rules 3991 place count 8 transition count 8
Iterating global reduction 1 with 995 rules applied. Total rules applied 4986 place count 8 transition count 8
Applied a total of 4986 rules in 42 ms. Remains 8 /3001 variables (removed 2993) and now considering 8/2001 (removed 1993) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-06-01 17:19:29] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:19:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 17:19:29] [INFO ] Invariant cache hit.
[2024-06-01 17:19:29] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-06-01 17:19:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/16 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 7 unsolved in 59 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/16 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 41 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Starting structural reductions in LTL mode, iteration 1 : 8/3001 places, 8/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 8/3001 places, 8/2001 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-1000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLCardinality-08 finished in 376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(p1)&&F(G(p0)))))))'
Support contains 4 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1998 places and 0 transitions.
Ensure Unique test removed 998 transitions
Reduce isomorphic transitions removed 998 transitions.
Iterating post reduction 0 with 2996 rules applied. Total rules applied 2996 place count 1003 transition count 1003
Discarding 995 places :
Symmetric choice reduction at 1 with 995 rule applications. Total rules 3991 place count 8 transition count 8
Iterating global reduction 1 with 995 rules applied. Total rules applied 4986 place count 8 transition count 8
Applied a total of 4986 rules in 34 ms. Remains 8 /3001 variables (removed 2993) and now considering 8/2001 (removed 1993) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-06-01 17:19:29] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:19:29] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 17:19:29] [INFO ] Invariant cache hit.
[2024-06-01 17:19:29] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-06-01 17:19:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/16 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 7 unsolved in 40 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/16 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 39 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Starting structural reductions in LTL mode, iteration 1 : 8/3001 places, 8/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 8/3001 places, 8/2001 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-10
Stuttering criterion allowed to conclude after 1001 steps with 0 reset in 3 ms.
FORMULA Referendum-PT-1000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLCardinality-10 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1) U G(p2)))'
Support contains 4 out of 3001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Graph (complete) has 3000 edges and 3001 vertex of which 4 are kept as prefixes of interest. Removing 2997 places using SCC suffix rule.6 ms
Discarding 2997 places :
Also discarding 1994 output transitions
Drop transitions (Output transitions of discarded places.) removed 1994 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 4 transition count 4
Applied a total of 4 rules in 16 ms. Remains 4 /3001 variables (removed 2997) and now considering 4/2001 (removed 1997) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 17:19:30] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:19:30] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 17:19:30] [INFO ] Invariant cache hit.
[2024-06-01 17:19:30] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2024-06-01 17:19:30] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 17:19:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[Domain max(s): 4/4 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/8 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 11 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[Domain max(s): 4/4 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/3001 places, 4/2001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 4/3001 places, 4/2001 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), true, p1, (NOT p2)]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 8 steps with 2 reset in 0 ms.
FORMULA Referendum-PT-1000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-1000-LTLCardinality-13 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(G(p0)))))))'
Support contains 2 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1999 places and 0 transitions.
Ensure Unique test removed 999 transitions
Reduce isomorphic transitions removed 999 transitions.
Iterating post reduction 0 with 2998 rules applied. Total rules applied 2998 place count 1002 transition count 1002
Discarding 998 places :
Symmetric choice reduction at 1 with 998 rule applications. Total rules 3996 place count 4 transition count 4
Iterating global reduction 1 with 998 rules applied. Total rules applied 4994 place count 4 transition count 4
Applied a total of 4994 rules in 23 ms. Remains 4 /3001 variables (removed 2997) and now considering 4/2001 (removed 1997) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 17:19:30] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:19:30] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 17:19:30] [INFO ] Invariant cache hit.
[2024-06-01 17:19:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2024-06-01 17:19:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 22 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 51ms
Starting structural reductions in LTL mode, iteration 1 : 4/3001 places, 4/2001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 4/3001 places, 4/2001 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-15
Product exploration explored 100000 steps with 99 reset in 116 ms.
Product exploration explored 100000 steps with 99 reset in 105 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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 (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 17:19:31] [INFO ] Invariant cache hit.
[2024-06-01 17:19:31] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 17:19:31] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 17:19:31] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 17:19:31] [INFO ] Invariant cache hit.
[2024-06-01 17:19:31] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 17:19:31] [INFO ] Invariant cache hit.
[2024-06-01 17:19:31] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2024-06-01 17:19:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 61ms
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 4/4 places, 4/4 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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 (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 17:19:32] [INFO ] Invariant cache hit.
[2024-06-01 17:19:32] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 17:19:32] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 17:19:32] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 99 reset in 34 ms.
Product exploration explored 100000 steps with 99 reset in 45 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 6 ms. Remains 3 /4 variables (removed 1) and now considering 3/4 (removed 1) transitions.
[2024-06-01 17:19:32] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-06-01 17:19:32] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 22 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 56ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 3/4 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 3/4 places, 3/4 transitions.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 17:19:32] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:19:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 17:19:32] [INFO ] Invariant cache hit.
[2024-06-01 17:19:32] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2024-06-01 17:19:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 62ms
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 4/4 places, 4/4 transitions.
Treatment of property Referendum-PT-1000-LTLCardinality-15 finished in 2777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(G(p0)))))))'
Found a Lengthening insensitive property : Referendum-PT-1000-LTLCardinality-15
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 3001 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Graph (complete) has 3000 edges and 3001 vertex of which 3 are kept as prefixes of interest. Removing 2998 places using SCC suffix rule.6 ms
Discarding 2998 places :
Also discarding 1998 output transitions
Drop transitions (Output transitions of discarded places.) removed 1998 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 15 ms. Remains 3 /3001 variables (removed 2998) and now considering 3/2001 (removed 1998) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-06-01 17:19:33] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:19:33] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 17:19:33] [INFO ] Invariant cache hit.
[2024-06-01 17:19:33] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2024-06-01 17:19:33] [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 18 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 19 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 38ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 39ms
Starting structural reductions in LI_LTL mode, iteration 1 : 3/3001 places, 3/2001 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 87 ms. Remains : 3/3001 places, 3/2001 transitions.
Running random walk in product with property : Referendum-PT-1000-LTLCardinality-15
Product exploration explored 100000 steps with 39956 reset in 39 ms.
Product exploration explored 100000 steps with 39950 reset in 44 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 (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 17:19:34] [INFO ] Invariant cache hit.
[2024-06-01 17:19:34] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-06-01 17:19:34] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 17:19:34] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:19:34] [INFO ] Invariant cache hit.
[2024-06-01 17:19:34] [INFO ] Implicit Places using invariants in 11 ms returned []
[2024-06-01 17:19:34] [INFO ] Invariant cache hit.
[2024-06-01 17:19:34] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2024-06-01 17:19:34] [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 22 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 26 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 49ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 49ms
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 3/3 places, 3/3 transitions.
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 (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 17:19:34] [INFO ] Invariant cache hit.
[2024-06-01 17:19:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 17:19:34] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 17:19:34] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 39968 reset in 37 ms.
Product exploration explored 100000 steps with 39996 reset in 39 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:19:35] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 17:19:35] [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 18 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 18 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 38ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 39ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44 ms. Remains : 3/3 places, 3/3 transitions.
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:19:35] [INFO ] Invariant cache hit.
[2024-06-01 17:19:35] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 17:19:35] [INFO ] Invariant cache hit.
[2024-06-01 17:19:35] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2024-06-01 17:19:35] [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 22 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 19 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 43ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 43ms
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 3/3 places, 3/3 transitions.
Treatment of property Referendum-PT-1000-LTLCardinality-15 finished in 2327 ms.
[2024-06-01 17:19:35] [INFO ] Flatten gal took : 123 ms
[2024-06-01 17:19:35] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 17:19:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3001 places, 2001 transitions and 5001 arcs took 9 ms.
Total runtime 199259 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Referendum-PT-1000-LTLCardinality-15

BK_STOP 1717262390268

--------------------
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
ltl formula name Referendum-PT-1000-LTLCardinality-15
ltl formula formula --ltl=/tmp/1144/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3001 places, 2001 transitions and 5001 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.060 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1144/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1144/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1144/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1144/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1003 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3002, there are 2010 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1882
pnml2lts-mc( 0/ 4): unique transitions count: 3284393
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1888
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1888
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1888 states 3288404 transitions, fanout: 1741.739
pnml2lts-mc( 0/ 4): Total exploration time 12.880 sec (7.230 sec minimum, 9.200 sec on average)
pnml2lts-mc( 0/ 4): States per second: 147, Transitions per second: 255311
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 85.8MB, 31.5 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 8.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 2050 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 85.8MB (~256.0MB paged-in)

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-1000"
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-1000, 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-171662339000635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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