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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 14K Apr 11 16:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 16:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K Apr 11 16:21 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 8.8K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 61K Apr 11 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 398K Apr 11 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 11 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 230K Apr 11 16:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Apr 23 07:46 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 18K 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-0015-LTLCardinality-00
FORMULA_NAME Referendum-PT-0015-LTLCardinality-01
FORMULA_NAME Referendum-PT-0015-LTLCardinality-02
FORMULA_NAME Referendum-PT-0015-LTLCardinality-03
FORMULA_NAME Referendum-PT-0015-LTLCardinality-04
FORMULA_NAME Referendum-PT-0015-LTLCardinality-05
FORMULA_NAME Referendum-PT-0015-LTLCardinality-06
FORMULA_NAME Referendum-PT-0015-LTLCardinality-07
FORMULA_NAME Referendum-PT-0015-LTLCardinality-08
FORMULA_NAME Referendum-PT-0015-LTLCardinality-09
FORMULA_NAME Referendum-PT-0015-LTLCardinality-10
FORMULA_NAME Referendum-PT-0015-LTLCardinality-11
FORMULA_NAME Referendum-PT-0015-LTLCardinality-12
FORMULA_NAME Referendum-PT-0015-LTLCardinality-13
FORMULA_NAME Referendum-PT-0015-LTLCardinality-14
FORMULA_NAME Referendum-PT-0015-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717261808165

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-0015
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:10:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:10:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:10:09] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-06-01 17:10:09] [INFO ] Transformed 46 places.
[2024-06-01 17:10:09] [INFO ] Transformed 31 transitions.
[2024-06-01 17:10:09] [INFO ] Found NUPN structural information;
[2024-06-01 17:10:09] [INFO ] Parsed PT model containing 46 places and 31 transitions and 76 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-PT-0015-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2024-06-01 17:10:09] [INFO ] Computed 15 invariants in 7 ms
[2024-06-01 17:10:09] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 17:10:09] [INFO ] Invariant cache hit.
[2024-06-01 17:10:09] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-06-01 17:10:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 31/46 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 31/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 31/77 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 107 constraints, problems are : Problem set: 0 solved, 30 unsolved in 420 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 31/46 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 31/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 31/77 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 30/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/77 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 137 constraints, problems are : Problem set: 0 solved, 30 unsolved in 257 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 719ms
Finished structural reductions in LTL mode , in 1 iterations and 972 ms. Remains : 46/46 places, 31/31 transitions.
Support contains 46 out of 46 places after structural reductions.
[2024-06-01 17:10:10] [INFO ] Flatten gal took : 15 ms
[2024-06-01 17:10:10] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:10:10] [INFO ] Input system was already deterministic with 31 transitions.
RANDOM walk for 294 steps (16 resets) in 24 ms. (11 steps per ms) remains 0/15 properties
FORMULA Referendum-PT-0015-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Referendum-PT-0015-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 31
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' '!(F(G(p0)))'
Support contains 15 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 16 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 16 transition count 16
Applied a total of 16 rules in 27 ms. Remains 16 /46 variables (removed 30) and now considering 16/31 (removed 15) transitions.
// Phase 1: matrix 16 rows 16 cols
[2024-06-01 17:10:10] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 17:10:11] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 17:10:11] [INFO ] Invariant cache hit.
[2024-06-01 17:10:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 17:10:11] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 17:10:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 16/31 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 32 constraints, problems are : Problem set: 0 solved, 15 unsolved in 124 ms.
Refiners :[Domain max(s): 16/16 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 16/31 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 15/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/32 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 47 constraints, problems are : Problem set: 0 solved, 15 unsolved in 112 ms.
Refiners :[Domain max(s): 16/16 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 242ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 242ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/46 places, 16/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 16/46 places, 16/31 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-00
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0015-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-00 finished in 513 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)))'
Support contains 30 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 31 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 31 cols
[2024-06-01 17:10:11] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 17:10:11] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 17:10:11] [INFO ] Invariant cache hit.
[2024-06-01 17:10:11] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 17:10:11] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-06-01 17:10:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 31/46 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 16/62 variables, 16/46 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 62 constraints, problems are : Problem set: 0 solved, 30 unsolved in 266 ms.
Refiners :[Domain max(s): 31/31 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 31/46 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 16/62 variables, 16/46 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 30/92 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 92 constraints, problems are : Problem set: 0 solved, 30 unsolved in 225 ms.
Refiners :[Domain max(s): 31/31 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 501ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/46 places, 31/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 564 ms. Remains : 31/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-03
Stuttering criterion allowed to conclude after 18 steps with 1 reset in 1 ms.
FORMULA Referendum-PT-0015-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-03 finished in 663 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||X(G(p1)))))'
Support contains 45 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2024-06-01 17:10:12] [INFO ] Computed 15 invariants in 4 ms
[2024-06-01 17:10:12] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 17:10:12] [INFO ] Invariant cache hit.
[2024-06-01 17:10:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-06-01 17:10:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 31/46 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 31/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 31/77 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 107 constraints, problems are : Problem set: 0 solved, 30 unsolved in 284 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 31/46 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 31/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 31/77 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 30/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/77 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 137 constraints, problems are : Problem set: 0 solved, 30 unsolved in 244 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 535ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 536ms
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 46/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Computed a total of 46 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 31
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 p0 (NOT p1)), (X p0), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0015-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0015-LTLCardinality-04 finished in 1329 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)&&F(p1)))'
Support contains 45 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2024-06-01 17:10:13] [INFO ] Invariant cache hit.
[2024-06-01 17:10:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 17:10:13] [INFO ] Invariant cache hit.
[2024-06-01 17:10:13] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-01 17:10:13] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2024-06-01 17:10:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 31/46 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 31/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 31/77 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 107 constraints, problems are : Problem set: 0 solved, 30 unsolved in 285 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 31/46 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 31/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 31/77 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 30/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/77 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 137 constraints, problems are : Problem set: 0 solved, 30 unsolved in 220 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 512ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 513ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 611 ms. Remains : 46/46 places, 31/31 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-06
Stuttering criterion allowed to conclude after 49 steps with 5 reset in 1 ms.
FORMULA Referendum-PT-0015-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-06 finished in 758 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)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 3 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.0 ms
Discarding 43 places :
Also discarding 28 output transitions
Drop transitions (Output transitions of discarded places.) removed 28 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 5 ms. Remains 3 /46 variables (removed 43) and now considering 3/31 (removed 28) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-06-01 17:10:14] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:10:14] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 17:10:14] [INFO ] Invariant cache hit.
[2024-06-01 17:10:14] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 17:10:14] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 17:10:14] [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 17 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 21 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 40ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 41ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/46 places, 3/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 3/46 places, 3/31 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0015-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-09 finished in 207 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 X(G(p0))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 18 transition count 18
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 6 transition count 6
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 6 transition count 6
Applied a total of 65 rules in 12 ms. Remains 6 /46 variables (removed 40) and now considering 6/31 (removed 25) transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-06-01 17:10:14] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:10:14] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 17:10:14] [INFO ] Invariant cache hit.
[2024-06-01 17:10:14] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 17:10:14] [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 46 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 44 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Starting structural reductions in LTL mode, iteration 1 : 6/46 places, 6/31 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 6/46 places, 6/31 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 23 steps with 1 reset in 1 ms.
FORMULA Referendum-PT-0015-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-10 finished in 249 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(p0)||F(p1)))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 7 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.0 ms
Discarding 39 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 7 transition count 7
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 7 transition count 7
Applied a total of 4 rules in 4 ms. Remains 7 /46 variables (removed 39) and now considering 7/31 (removed 24) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-06-01 17:10:14] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 17:10:14] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 17:10:14] [INFO ] Invariant cache hit.
[2024-06-01 17:10:14] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-06-01 17:10:14] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 17:10:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/14 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 42 ms.
Refiners :[Domain max(s): 7/7 constraints, State Equation: 7/7 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/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/14 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 19 constraints, problems are : Problem set: 0 solved, 5 unsolved in 39 ms.
Refiners :[Domain max(s): 7/7 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/46 places, 7/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 7/46 places, 7/31 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
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)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0015-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0015-LTLCardinality-13 finished in 505 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||G(!p1))))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 19 transition count 19
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 8 transition count 8
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 8 transition count 8
Applied a total of 61 rules in 1 ms. Remains 8 /46 variables (removed 38) and now considering 8/31 (removed 23) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-06-01 17:10:15] [INFO ] Computed 0 invariants in 2 ms
[2024-06-01 17:10:15] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 17:10:15] [INFO ] Invariant cache hit.
[2024-06-01 17:10:15] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-06-01 17:10:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 4/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 171 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 6/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 53 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 228ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 228ms
Starting structural reductions in LTL mode, iteration 1 : 8/46 places, 8/31 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 8/46 places, 8/31 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (OR (NOT p0) (AND p1 p2)), (AND p2 p1), (OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : Referendum-PT-0015-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0015-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLCardinality-15 finished in 450 ms.
All properties solved by simple procedures.
Total runtime 6365 ms.
ITS solved all properties within timeout

BK_STOP 1717261815962

--------------------
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

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

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