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.r311-tall-171662337500827.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 greatspnxred
Input is ResAllocation-PT-R003C050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337500827
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.9K 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 17K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 23:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 23:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 23:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 23:23 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 360K 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-R003C050-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716775209094

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 02:00:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 02:00:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 02:00:10] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-27 02:00:10] [INFO ] Transformed 300 places.
[2024-05-27 02:00:10] [INFO ] Transformed 200 transitions.
[2024-05-27 02:00:10] [INFO ] Found NUPN structural information;
[2024-05-27 02:00:10] [INFO ] Parsed PT model containing 300 places and 200 transitions and 894 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C050-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 30 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 300 cols
[2024-05-27 02:00:10] [INFO ] Computed 150 invariants in 25 ms
[2024-05-27 02:00:11] [INFO ] Implicit Places using invariants in 585 ms returned [295, 297, 299]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 617 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/300 places, 200/200 transitions.
Applied a total of 0 rules in 8 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 671 ms. Remains : 297/300 places, 200/200 transitions.
Support contains 25 out of 297 places after structural reductions.
[2024-05-27 02:00:11] [INFO ] Flatten gal took : 47 ms
[2024-05-27 02:00:11] [INFO ] Flatten gal took : 21 ms
[2024-05-27 02:00:11] [INFO ] Input system was already deterministic with 200 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (379 resets) in 1872 ms. (21 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' '!(X(X((p0&&X((p1||(p2&&G(p3))))))))'
Support contains 5 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 13 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2024-05-27 02:00:12] [INFO ] Computed 147 invariants in 7 ms
[2024-05-27 02:00:12] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-27 02:00:12] [INFO ] Invariant cache hit.
[2024-05-27 02:00:12] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 02:00:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 10 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-27 02:00:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 4 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:00:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:00:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 10 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-27 02:00:17] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:18] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-27 02:00:18] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:00:18] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:00:18] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:00:18] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:00:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:18] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-27 02:00:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:00:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:00:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-27 02:00:19] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:00:19] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:00:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:00:19] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 11080 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:27] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:00:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 17547 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 28713ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 28745ms
Finished structural reductions in LTL mode , in 1 iterations and 29265 ms. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 346 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 5688 steps with 55 reset in 75 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-02 finished in 29742 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 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 249 transition count 152
Applied a total of 96 rules in 39 ms. Remains 249 /297 variables (removed 48) and now considering 152/200 (removed 48) transitions.
// Phase 1: matrix 152 rows 249 cols
[2024-05-27 02:00:42] [INFO ] Computed 147 invariants in 1 ms
[2024-05-27 02:00:42] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-27 02:00:42] [INFO ] Invariant cache hit.
[2024-05-27 02:00:42] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-05-27 02:00:42] [INFO ] Redundant transitions in 8 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-27 02:00:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 147/396 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-27 02:00:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-27 02:00:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:00:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:00:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 152/401 variables, 249/649 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 649 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3614 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 147/396 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 152/401 variables, 249/649 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 102/751 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 751 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3546 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints]
After SMT, in 7191ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 7193ms
Starting structural reductions in SI_LTL mode, iteration 1 : 249/297 places, 152/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7699 ms. Remains : 249/297 places, 152/200 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-03
Product exploration explored 100000 steps with 983 reset in 527 ms.
Product exploration explored 100000 steps with 983 reset in 585 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 37643 steps (368 resets) in 267 ms. (140 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 152/152 transitions.
Applied a total of 0 rules in 11 ms. Remains 249 /249 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-05-27 02:00:51] [INFO ] Invariant cache hit.
[2024-05-27 02:00:51] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-27 02:00:51] [INFO ] Invariant cache hit.
[2024-05-27 02:00:51] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-27 02:00:51] [INFO ] Redundant transitions in 3 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-27 02:00:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 147/396 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-27 02:00:52] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-27 02:00:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:00:52] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-27 02:00:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 152/401 variables, 249/649 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 649 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3761 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 147/396 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 152/401 variables, 249/649 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 102/751 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 751 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3607 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints]
After SMT, in 7384ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 7386ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7759 ms. Remains : 249/249 places, 152/152 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 40000 steps (392 resets) in 316 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1344331 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :0 out of 1
Probabilistic random walk after 1344331 steps, saw 171748 distinct states, run finished after 3004 ms. (steps per millisecond=447 ) properties seen :0
[2024-05-27 02:01:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/10 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/11 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/21 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/21 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/41 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/41 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/41 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/41 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/43 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/43 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/43 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/43 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/47 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/47 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/47 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/51 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/51 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/51 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/55 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/55 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/55 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/59 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/59 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/59 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 4/63 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/63 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/63 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 4/67 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/67 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/67 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 4/71 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/71 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/71 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 4/75 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/75 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/75 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 4/79 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/79 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/79 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 4/83 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/83 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/83 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 4/87 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/87 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/87 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 4/91 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/91 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/91 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 2/93 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/93 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/93 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 2/95 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/95 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/95 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 2/97 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/97 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/97 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 2/99 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/99 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/99 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 2/101 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/101 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/101 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 2/103 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/103 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/103 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 2/105 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/105 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/105 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 2/107 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/107 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/107 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 2/109 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/109 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/109 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 2/111 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/111 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/111 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 2/113 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/113 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/113 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 2/115 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/115 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/115 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 2/117 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/117 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/117 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 2/119 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/119 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/119 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 2/121 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/121 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/121 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 2/123 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/123 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/123 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 2/125 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/125 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/125 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 2/127 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/127 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/127 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 2/129 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/129 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/129 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 102/231 variables, 98/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/231 variables, 12/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/231 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/231 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 170/401 variables, 127/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/401 variables, 127/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/401 variables, 84/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/401 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 0/401 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 645 constraints, problems are : Problem set: 0 solved, 1 unsolved in 229 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 249/249 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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/10 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/11 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/21 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/21 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/41 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/41 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/41 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/41 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/41 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/43 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/43 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/43 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/43 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/47 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/47 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/47 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/51 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/51 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/51 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/55 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/55 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/55 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 4/59 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/59 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/59 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/63 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/63 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/63 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 4/67 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/67 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/67 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 4/71 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/71 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/71 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 4/75 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/75 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/75 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/79 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/79 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/79 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 4/83 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/83 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/83 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 4/87 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/87 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/87 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 4/91 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/91 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/91 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 2/93 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/93 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/93 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 2/95 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/95 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/95 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 2/97 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/97 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/97 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 2/99 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/99 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/99 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 2/101 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/101 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/101 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 2/103 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/103 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/103 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 2/105 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/105 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/105 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 2/107 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/107 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/107 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 2/109 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/109 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/109 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 2/111 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/111 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/111 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 2/113 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/113 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/113 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 2/115 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/115 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/115 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 2/117 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/117 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/117 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 2/119 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/119 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/119 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 2/121 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/121 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/121 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 2/123 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/123 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/123 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 2/125 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/125 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/125 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 2/127 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/127 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/127 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 2/129 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/129 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/129 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 102/231 variables, 98/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/231 variables, 12/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/231 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/231 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 170/401 variables, 127/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/401 variables, 127/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/401 variables, 84/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/401 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 0/401 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 544ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 982 reset in 476 ms.
Product exploration explored 100000 steps with 981 reset in 512 ms.
Support contains 2 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 152/152 transitions.
Applied a total of 0 rules in 26 ms. Remains 249 /249 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-05-27 02:01:04] [INFO ] Invariant cache hit.
[2024-05-27 02:01:04] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-27 02:01:04] [INFO ] Invariant cache hit.
[2024-05-27 02:01:04] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-27 02:01:04] [INFO ] Redundant transitions in 3 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-27 02:01:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 147/396 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-27 02:01:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-27 02:01:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:01:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-27 02:01:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 152/401 variables, 249/649 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 649 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3668 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 147/396 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 152/401 variables, 249/649 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 102/751 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 751 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3647 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints]
After SMT, in 7334ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 7336ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7764 ms. Remains : 249/249 places, 152/152 transitions.
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-03 finished in 30040 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 U G((p1&&X((p1 U X(p1))))))))'
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 297 cols
[2024-05-27 02:01:12] [INFO ] Computed 147 invariants in 1 ms
[2024-05-27 02:01:12] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-27 02:01:12] [INFO ] Invariant cache hit.
[2024-05-27 02:01:12] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 02:01:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:13] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:15] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:15] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:01:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:17] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:17] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-27 02:01:17] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:17] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:17] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:18] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:18] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-27 02:01:18] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:18] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10118 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:29] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 17028 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 27171ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27173ms
Finished structural reductions in LTL mode , in 1 iterations and 27665 ms. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-04 finished in 28044 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&&X(G(p1))) U (p1&&F(p2)&&X(X(!p0)))))'
Support contains 6 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-27 02:01:40] [INFO ] Invariant cache hit.
[2024-05-27 02:01:40] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-27 02:01:40] [INFO ] Invariant cache hit.
[2024-05-27 02:01:40] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 02:01:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:01:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:01:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:01:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9790 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:01:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 16774 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 26589ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 26591ms
Finished structural reductions in LTL mode , in 1 iterations and 27017 ms. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 479 ms :[(OR (NOT p1) (NOT p2) p0), true, (NOT p1), (NOT p2), p0, p0, p0, (AND (NOT p1) p0), p0, (AND (NOT p2) p0), p0, p0]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-05 finished in 27524 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 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 297 /297 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-27 02:02:07] [INFO ] Invariant cache hit.
[2024-05-27 02:02:07] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-27 02:02:07] [INFO ] Invariant cache hit.
[2024-05-27 02:02:08] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-27 02:02:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 5 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:02:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:02:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:02:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 02:02:11] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:02:11] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-27 02:02:11] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:02:11] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-27 02:02:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-27 02:02:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 815 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10132 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 297/297 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 147/444 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 74/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 200/497 variables, 297/815 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 150/965 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:02:21] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-27 02:02:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 1/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 967 constraints, problems are : Problem set: 0 solved, 150 unsolved in 17918 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 76/76 constraints]
After SMT, in 28076ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 28078ms
Finished structural reductions in LTL mode , in 1 iterations and 28488 ms. Remains : 297/297 places, 200/200 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 458 ms.
Product exploration explored 100000 steps with 50000 reset in 451 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R003C050-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-11 finished in 29508 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 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 248 transition count 151
Applied a total of 98 rules in 27 ms. Remains 248 /297 variables (removed 49) and now considering 151/200 (removed 49) transitions.
// Phase 1: matrix 151 rows 248 cols
[2024-05-27 02:02:37] [INFO ] Computed 147 invariants in 1 ms
[2024-05-27 02:02:37] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-27 02:02:37] [INFO ] Invariant cache hit.
[2024-05-27 02:02:37] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-27 02:02:37] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-27 02:02:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 248/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 147/395 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 151/399 variables, 248/643 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 0/399 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 643 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2755 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 248/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 147/395 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 151/399 variables, 248/643 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 101/744 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-27 02:02:43] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/399 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/399 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 745 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6345 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints]
After SMT, in 9115ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9117ms
Starting structural reductions in SI_LTL mode, iteration 1 : 248/297 places, 151/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9515 ms. Remains : 248/297 places, 151/200 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-12
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-12 finished in 9595 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 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 248 transition count 151
Applied a total of 98 rules in 16 ms. Remains 248 /297 variables (removed 49) and now considering 151/200 (removed 49) transitions.
// Phase 1: matrix 151 rows 248 cols
[2024-05-27 02:02:46] [INFO ] Computed 147 invariants in 1 ms
[2024-05-27 02:02:47] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-27 02:02:47] [INFO ] Invariant cache hit.
[2024-05-27 02:02:47] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-27 02:02:47] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-27 02:02:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 248/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 147/395 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-27 02:02:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-27 02:02:47] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 151/399 variables, 248/645 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/399 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 645 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3689 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 248/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/248 variables, 147/395 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 151/399 variables, 248/645 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 101/746 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/399 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 746 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3698 ms.
Refiners :[Domain max(s): 248/248 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints]
After SMT, in 7403ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7405ms
Starting structural reductions in SI_LTL mode, iteration 1 : 248/297 places, 151/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7788 ms. Remains : 248/297 places, 151/200 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-14
Product exploration explored 100000 steps with 2779 reset in 567 ms.
Stack based approach found an accepted trace after 1510 steps with 37 reset with depth 45 and stack size 45 in 10 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-14 finished in 8446 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 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 200/200 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 249 transition count 152
Applied a total of 96 rules in 16 ms. Remains 249 /297 variables (removed 48) and now considering 152/200 (removed 48) transitions.
// Phase 1: matrix 152 rows 249 cols
[2024-05-27 02:02:55] [INFO ] Computed 147 invariants in 2 ms
[2024-05-27 02:02:55] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-27 02:02:55] [INFO ] Invariant cache hit.
[2024-05-27 02:02:55] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-27 02:02:55] [INFO ] Redundant transitions in 1 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-27 02:02:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 147/396 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-27 02:02:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 152/401 variables, 249/646 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 646 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3668 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 147/396 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 152/401 variables, 249/646 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 102/748 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 748 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3509 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 1/1 constraints]
After SMT, in 7192ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 7193ms
Starting structural reductions in SI_LTL mode, iteration 1 : 249/297 places, 152/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7574 ms. Remains : 249/297 places, 152/200 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C050-LTLCardinality-15
Product exploration explored 100000 steps with 984 reset in 488 ms.
Stack based approach found an accepted trace after 9885 steps with 97 reset with depth 23 and stack size 23 in 55 ms.
FORMULA ResAllocation-PT-R003C050-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C050-LTLCardinality-15 finished in 8170 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)))'
[2024-05-27 02:03:03] [INFO ] Flatten gal took : 17 ms
[2024-05-27 02:03:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-27 02:03:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 297 places, 200 transitions and 888 arcs took 6 ms.
Total runtime 173459 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ResAllocation-PT-R003C050

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 297
TRANSITIONS: 200
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1901
MODEL NAME: /home/mcc/execution/413/model
297 places, 200 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ResAllocation-PT-R003C050-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716775384637

--------------------
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-R003C050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ResAllocation-PT-R003C050, 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 r311-tall-171662337500827"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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