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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 11 23:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 23:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K 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 ResAllocation-PT-R003C020-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717264777159

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:59:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:59:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:59:38] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-01 17:59:38] [INFO ] Transformed 120 places.
[2024-06-01 17:59:38] [INFO ] Transformed 80 transitions.
[2024-06-01 17:59:38] [INFO ] Found NUPN structural information;
[2024-06-01 17:59:38] [INFO ] Parsed PT model containing 120 places and 80 transitions and 354 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ResAllocation-PT-R003C020-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C020-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C020-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C020-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C020-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C020-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 13 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 120 cols
[2024-06-01 17:59:38] [INFO ] Computed 60 invariants in 5 ms
[2024-06-01 17:59:38] [INFO ] Implicit Places using invariants in 241 ms returned [115, 117, 119]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 270 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/120 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 302 ms. Remains : 117/120 places, 80/80 transitions.
Support contains 20 out of 117 places after structural reductions.
[2024-06-01 17:59:39] [INFO ] Flatten gal took : 31 ms
[2024-06-01 17:59:39] [INFO ] Flatten gal took : 12 ms
[2024-06-01 17:59:39] [INFO ] Input system was already deterministic with 80 transitions.
RANDOM walk for 11270 steps (255 resets) in 376 ms. (29 steps per ms) remains 0/13 properties
Computed a total of 0 stabilizing places and 0 stable transitions
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)||X(X((F(p1)&&F(p2))))))'
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 117 cols
[2024-06-01 17:59:39] [INFO ] Computed 57 invariants in 8 ms
[2024-06-01 17:59:39] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 17:59:39] [INFO ] Invariant cache hit.
[2024-06-01 17:59:39] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 17:59:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 57/174 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 7 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 9 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:59:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:59:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:59:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:59:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:59:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:59:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:59:41] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 17:59:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 80/197 variables, 117/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 319 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2440 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 57/174 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 28/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 80/197 variables, 117/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 60/379 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 380 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1763 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 29/29 constraints]
After SMT, in 4250ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4261ms
Finished structural reductions in LTL mode , in 1 iterations and 4515 ms. Remains : 117/117 places, 80/80 transitions.
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ResAllocation-PT-R003C020-LTLCardinality-01
Stuttering criterion allowed to conclude after 1059 steps with 23 reset in 25 ms.
FORMULA ResAllocation-PT-R003C020-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-LTLCardinality-01 finished in 5009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-06-01 17:59:44] [INFO ] Invariant cache hit.
[2024-06-01 17:59:44] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 17:59:44] [INFO ] Invariant cache hit.
[2024-06-01 17:59:44] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 17:59:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 57/174 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:59:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:59:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:59:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 3 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:59:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 80/197 variables, 117/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 319 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1916 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 57/174 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 28/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 80/197 variables, 117/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 60/379 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 380 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1832 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 29/29 constraints]
After SMT, in 3772ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3773ms
Finished structural reductions in LTL mode , in 1 iterations and 4019 ms. Remains : 117/117 places, 80/80 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C020-LTLCardinality-03
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C020-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-LTLCardinality-03 finished in 4113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U (p0||F(G(p1))))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 80/80 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-06-01 17:59:48] [INFO ] Invariant cache hit.
[2024-06-01 17:59:48] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 17:59:48] [INFO ] Invariant cache hit.
[2024-06-01 17:59:48] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 17:59:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 57/174 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:48] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:59:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:59:49] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 80/197 variables, 117/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 319 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2018 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 57/174 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 28/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 80/197 variables, 117/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 60/379 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 380 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1757 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 29/29 constraints]
After SMT, in 3786ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3788ms
Finished structural reductions in LTL mode , in 1 iterations and 3979 ms. Remains : 117/117 places, 80/80 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C020-LTLCardinality-07
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-LTLCardinality-07 finished in 4159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-06-01 17:59:52] [INFO ] Invariant cache hit.
[2024-06-01 17:59:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 17:59:52] [INFO ] Invariant cache hit.
[2024-06-01 17:59:52] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 17:59:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 57/174 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 17:59:53] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:59:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 80/197 variables, 117/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 319 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1952 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 57/174 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 28/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 80/197 variables, 117/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 60/379 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 380 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1746 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 29/29 constraints]
After SMT, in 3708ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3709ms
Finished structural reductions in LTL mode , in 1 iterations and 3900 ms. Remains : 117/117 places, 80/80 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ResAllocation-PT-R003C020-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 302 ms.
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R003C020-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R003C020-LTLCardinality-08 finished in 4681 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||G(p1)))))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 80/80 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 98 transition count 61
Applied a total of 38 rules in 22 ms. Remains 98 /117 variables (removed 19) and now considering 61/80 (removed 19) transitions.
// Phase 1: matrix 61 rows 98 cols
[2024-06-01 17:59:57] [INFO ] Computed 57 invariants in 0 ms
[2024-06-01 17:59:57] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 17:59:57] [INFO ] Invariant cache hit.
[2024-06-01 17:59:57] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-01 17:59:57] [INFO ] Redundant transitions in 0 ms returned []
Running 41 sub problems to find dead transitions.
[2024-06-01 17:59:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 57/155 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 61/159 variables, 98/253 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 0/159 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 253 constraints, problems are : Problem set: 0 solved, 41 unsolved in 525 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 57/155 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 61/159 variables, 98/253 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 41/294 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/159 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 294 constraints, problems are : Problem set: 0 solved, 41 unsolved in 580 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 1115ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/117 places, 61/80 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1309 ms. Remains : 98/117 places, 61/80 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R003C020-LTLCardinality-10
Product exploration explored 100000 steps with 5335 reset in 394 ms.
Stack based approach found an accepted trace after 1389 steps with 77 reset with depth 8 and stack size 8 in 6 ms.
FORMULA ResAllocation-PT-R003C020-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C020-LTLCardinality-10 finished in 1804 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&&X(p1)))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 117 cols
[2024-06-01 17:59:59] [INFO ] Computed 57 invariants in 1 ms
[2024-06-01 17:59:59] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 17:59:59] [INFO ] Invariant cache hit.
[2024-06-01 17:59:59] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 17:59:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 57/174 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:59:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 2 ms to minimize.
[2024-06-01 18:00:00] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 80/197 variables, 117/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 319 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1942 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 57/174 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 28/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 80/197 variables, 117/319 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 60/379 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 18:00:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 380 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1823 ms.
Refiners :[Domain max(s): 117/117 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 29/29 constraints]
After SMT, in 3775ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3776ms
Finished structural reductions in LTL mode , in 1 iterations and 3979 ms. Remains : 117/117 places, 80/80 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C020-LTLCardinality-11
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C020-LTLCardinality-11 finished in 4121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 80/80 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 99 transition count 62
Applied a total of 36 rules in 13 ms. Remains 99 /117 variables (removed 18) and now considering 62/80 (removed 18) transitions.
// Phase 1: matrix 62 rows 99 cols
[2024-06-01 18:00:03] [INFO ] Computed 57 invariants in 1 ms
[2024-06-01 18:00:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 18:00:03] [INFO ] Invariant cache hit.
[2024-06-01 18:00:03] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-06-01 18:00:03] [INFO ] Redundant transitions in 7 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-01 18:00:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 57/156 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 18:00:03] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 62/161 variables, 99/256 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/161 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 256 constraints, problems are : Problem set: 0 solved, 42 unsolved in 729 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 57/156 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 62/161 variables, 99/256 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 42/298 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 298 constraints, problems are : Problem set: 0 solved, 42 unsolved in 655 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints]
After SMT, in 1392ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1393ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/117 places, 62/80 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1583 ms. Remains : 99/117 places, 62/80 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C020-LTLCardinality-12
Product exploration explored 100000 steps with 2377 reset in 276 ms.
Stack based approach found an accepted trace after 763 steps with 17 reset with depth 41 and stack size 41 in 3 ms.
FORMULA ResAllocation-PT-R003C020-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C020-LTLCardinality-12 finished in 1924 ms.
All properties solved by simple procedures.
Total runtime 26922 ms.
ITS solved all properties within timeout

BK_STOP 1717264805285

--------------------
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="ResAllocation-PT-R003C020"
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 ResAllocation-PT-R003C020, 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-171662339400819"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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