About the Execution of LTSMin+red for HospitalTriage-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 435.867 | 43255.00 | 67647.00 | 369.60 | TFFFFTFFTFFTTFFF | normal |
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.r500-smll-171649587500139.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is HospitalTriage-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587500139
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 14:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 11 14:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 78K May 18 16:42 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 HospitalTriage-PT-none-LTLCardinality-00
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-01
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-02
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-03
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-04
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-05
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-06
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-07
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-08
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-09
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-10
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-11
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-12
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-13
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-14
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717257637256
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HospitalTriage-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:00:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:00:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:00:39] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-06-01 16:00:39] [INFO ] Transformed 245 places.
[2024-06-01 16:00:39] [INFO ] Transformed 228 transitions.
[2024-06-01 16:00:39] [INFO ] Parsed PT model containing 245 places and 228 transitions and 680 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 80 transitions.
FORMULA HospitalTriage-PT-none-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 154 transition count 141
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 154 transition count 141
Applied a total of 14 rules in 51 ms. Remains 154 /161 variables (removed 7) and now considering 141/148 (removed 7) transitions.
// Phase 1: matrix 141 rows 154 cols
[2024-06-01 16:00:39] [INFO ] Computed 33 invariants in 24 ms
[2024-06-01 16:00:40] [INFO ] Implicit Places using invariants in 356 ms returned [35, 43, 51, 57, 78, 133, 136]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 409 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/161 places, 141/148 transitions.
Applied a total of 0 rules in 11 ms. Remains 147 /147 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 497 ms. Remains : 147/161 places, 141/148 transitions.
Support contains 24 out of 147 places after structural reductions.
[2024-06-01 16:00:40] [INFO ] Flatten gal took : 55 ms
[2024-06-01 16:00:40] [INFO ] Flatten gal took : 22 ms
[2024-06-01 16:00:40] [INFO ] Input system was already deterministic with 141 transitions.
RANDOM walk for 40000 steps (8 resets) in 1810 ms. (22 steps per ms) remains 9/22 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
// Phase 1: matrix 141 rows 147 cols
[2024-06-01 16:00:41] [INFO ] Computed 26 invariants in 5 ms
Problem AtomicPropp18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 106/288 variables, and 13 constraints, problems are : Problem set: 9 solved, 0 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 13/26 constraints, State Equation: 0/147 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA HospitalTriage-PT-none-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA HospitalTriage-PT-none-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(!p0 U p1))))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 141/141 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 147 transition count 80
Reduce places removed 65 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 77 rules applied. Total rules applied 138 place count 82 transition count 68
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 41 edges and 69 vertex of which 6 / 69 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 2 with 37 rules applied. Total rules applied 175 place count 66 transition count 45
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 26 rules applied. Total rules applied 201 place count 47 transition count 38
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 204 place count 46 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 206 place count 44 transition count 36
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 206 place count 44 transition count 19
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 43 rules applied. Total rules applied 249 place count 18 transition count 19
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 6 with 7 rules applied. Total rules applied 256 place count 18 transition count 12
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 277 place count 4 transition count 5
Applied a total of 277 rules in 43 ms. Remains 4 /147 variables (removed 143) and now considering 5/141 (removed 136) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-06-01 16:00:42] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 16:00:42] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 16:00:42] [INFO ] Invariant cache hit.
[2024-06-01 16:00:42] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 16:00:42] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 16:00:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/147 places, 5/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 4/147 places, 5/141 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HospitalTriage-PT-none-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HospitalTriage-PT-none-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLCardinality-01 finished in 608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 141/141 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 147 transition count 81
Reduce places removed 61 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 69 rules applied. Total rules applied 129 place count 86 transition count 73
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 31 edges and 77 vertex of which 8 / 77 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 2 with 33 rules applied. Total rules applied 162 place count 73 transition count 50
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 29 rules applied. Total rules applied 191 place count 53 transition count 41
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 194 place count 52 transition count 39
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 198 place count 48 transition count 39
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 198 place count 48 transition count 20
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 45 rules applied. Total rules applied 243 place count 22 transition count 20
Discarding 1 places :
Implicit places reduction removed 1 places
Graph (trivial) has 10 edges and 21 vertex of which 6 / 21 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 246 place count 18 transition count 19
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 256 place count 14 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 9 rules applied. Total rules applied 265 place count 8 transition count 10
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 267 place count 8 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 268 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 268 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 271 place count 6 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 273 place count 5 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 274 place count 4 transition count 5
Applied a total of 274 rules in 31 ms. Remains 4 /147 variables (removed 143) and now considering 5/141 (removed 136) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-06-01 16:00:42] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 16:00:42] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 16:00:42] [INFO ] Invariant cache hit.
[2024-06-01 16:00:42] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 16:00:42] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 16:00:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/147 places, 5/141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 4/147 places, 5/141 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Running random walk in product with property : HospitalTriage-PT-none-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HospitalTriage-PT-none-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLCardinality-02 finished in 240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1))))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 141/141 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 146 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 146 transition count 140
Applied a total of 2 rules in 8 ms. Remains 146 /147 variables (removed 1) and now considering 140/141 (removed 1) transitions.
// Phase 1: matrix 140 rows 146 cols
[2024-06-01 16:00:42] [INFO ] Computed 26 invariants in 7 ms
[2024-06-01 16:00:43] [INFO ] Implicit Places using invariants in 148 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/147 places, 140/141 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 145/147 places, 140/141 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : HospitalTriage-PT-none-LTLCardinality-03
Product exploration explored 100000 steps with 27356 reset in 486 ms.
Product exploration explored 100000 steps with 27390 reset in 293 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 42 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 145 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 145 cols
[2024-06-01 16:00:44] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 16:00:44] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 16:00:44] [INFO ] Invariant cache hit.
[2024-06-01 16:00:45] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-06-01 16:00:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 12/145 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 140/285 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 170 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4207 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 12/145 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 140/285 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 128/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 298 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5107 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 9425ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 9436ms
Finished structural reductions in LTL mode , in 1 iterations and 9812 ms. Remains : 145/145 places, 140/140 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 : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 135 steps (0 resets) in 4 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 30047 reset in 179 ms.
Product exploration explored 100000 steps with 29766 reset in 200 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 145 transition count 140
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 59 place count 145 transition count 148
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 78 place count 145 transition count 148
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 93 place count 130 transition count 133
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 108 place count 130 transition count 133
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 117 place count 121 transition count 124
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 126 place count 121 transition count 124
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 134 place count 121 transition count 124
Deduced a syphon composed of 65 places in 0 ms
Applied a total of 134 rules in 31 ms. Remains 121 /145 variables (removed 24) and now considering 124/140 (removed 16) transitions.
[2024-06-01 16:00:55] [INFO ] Redundant transitions in 3 ms returned []
Running 115 sub problems to find dead transitions.
// Phase 1: matrix 124 rows 121 cols
[2024-06-01 16:00:55] [INFO ] Computed 22 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 1 places in 30 ms of which 7 ms to minimize.
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 1 places in 28 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 1 places in 26 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD89 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 4/9 constraints. Problems are: Problem set: 12 solved, 103 unsolved
[2024-06-01 16:00:56] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/10 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 9/121 variables, 17/27 constraints. Problems are: Problem set: 12 solved, 103 unsolved
[2024-06-01 16:00:57] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 16:00:57] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 5 ms to minimize.
[2024-06-01 16:00:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2024-06-01 16:00:57] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 16:00:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
[2024-06-01 16:00:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 17/44 constraints. Problems are: Problem set: 42 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/44 constraints. Problems are: Problem set: 42 solved, 73 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
At refinement iteration 7 (OVERLAPS) 123/244 variables, 121/165 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/165 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/244 variables, 0/165 constraints. Problems are: Problem set: 73 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/245 variables, and 165 constraints, problems are : Problem set: 73 solved, 42 unsolved in 3711 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 73 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 71/118 variables, 21/26 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 16/42 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/42 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 3/121 variables, 1/43 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/44 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/44 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 123/244 variables, 121/165 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 42/207 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/207 constraints. Problems are: Problem set: 73 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/244 variables, 0/207 constraints. Problems are: Problem set: 73 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/245 variables, and 207 constraints, problems are : Problem set: 73 solved, 42 unsolved in 1446 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 42/115 constraints, Known Traps: 22/22 constraints]
After SMT, in 5221ms problems are : Problem set: 73 solved, 42 unsolved
Search for dead transitions found 73 dead transitions in 5224ms
Found 73 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 73 transitions
Dead transitions reduction (with SMT) removed 73 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 121/145 places, 51/140 transitions.
Graph (complete) has 183 edges and 121 vertex of which 56 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.1 ms
Discarding 65 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 51 transition count 51
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 51 transition count 43
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 18 place count 51 transition count 51
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 51 transition count 51
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 34 rules in 16 ms. Remains 51 /121 variables (removed 70) and now considering 51/51 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/145 places, 51/140 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5285 ms. Remains : 51/145 places, 51/140 transitions.
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 145 cols
[2024-06-01 16:01:01] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 16:01:01] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 16:01:01] [INFO ] Invariant cache hit.
[2024-06-01 16:01:01] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-06-01 16:01:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 12/145 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 140/285 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 170 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3829 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 12/145 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 140/285 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 128/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 298 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5034 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 8901ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 8903ms
Finished structural reductions in LTL mode , in 1 iterations and 9168 ms. Remains : 145/145 places, 140/140 transitions.
Treatment of property HospitalTriage-PT-none-LTLCardinality-03 finished in 27548 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 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 141/141 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 147 transition count 78
Reduce places removed 66 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 70 rules applied. Total rules applied 133 place count 81 transition count 74
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 137 place count 77 transition count 74
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 137 place count 77 transition count 46
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 69 rules applied. Total rules applied 206 place count 36 transition count 46
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 209 place count 36 transition count 43
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 209 place count 36 transition count 35
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 225 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 226 place count 27 transition count 34
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 27 transition count 34
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 243 place count 19 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 251 place count 19 transition count 18
Applied a total of 251 rules in 12 ms. Remains 19 /147 variables (removed 128) and now considering 18/141 (removed 123) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-06-01 16:01:10] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 16:01:10] [INFO ] Implicit Places using invariants in 35 ms returned [3, 4, 8, 12]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/147 places, 18/141 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 13 transition count 16
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 13 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 13 transition count 14
Applied a total of 6 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 14/18 (removed 4) transitions.
// Phase 1: matrix 14 rows 13 cols
[2024-06-01 16:01:10] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 16:01:10] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 16:01:10] [INFO ] Invariant cache hit.
[2024-06-01 16:01:10] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/147 places, 14/141 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 109 ms. Remains : 13/147 places, 14/141 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : HospitalTriage-PT-none-LTLCardinality-04
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 2 ms.
FORMULA HospitalTriage-PT-none-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLCardinality-04 finished in 166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 141/141 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 147 cols
[2024-06-01 16:01:10] [INFO ] Computed 26 invariants in 1 ms
[2024-06-01 16:01:10] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 16:01:10] [INFO ] Invariant cache hit.
[2024-06-01 16:01:10] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-06-01 16:01:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 12/147 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 141/288 variables, 147/173 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 173 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4019 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 12/147 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 141/288 variables, 147/173 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 129/302 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 302 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4448 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 8508ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 8510ms
Finished structural reductions in LTL mode , in 1 iterations and 8790 ms. Remains : 147/147 places, 141/141 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HospitalTriage-PT-none-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HospitalTriage-PT-none-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HospitalTriage-PT-none-LTLCardinality-11 finished in 9225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 141/141 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 146 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 146 transition count 140
Applied a total of 2 rules in 6 ms. Remains 146 /147 variables (removed 1) and now considering 140/141 (removed 1) transitions.
// Phase 1: matrix 140 rows 146 cols
[2024-06-01 16:01:19] [INFO ] Computed 26 invariants in 1 ms
[2024-06-01 16:01:19] [INFO ] Implicit Places using invariants in 93 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/147 places, 140/141 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 145/147 places, 140/141 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HospitalTriage-PT-none-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 484 steps with 0 reset in 2 ms.
FORMULA HospitalTriage-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLCardinality-13 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1))))'
[2024-06-01 16:01:20] [INFO ] Flatten gal took : 13 ms
[2024-06-01 16:01:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 16:01:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 147 places, 141 transitions and 396 arcs took 7 ms.
Total runtime 41266 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA HospitalTriage-PT-none-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717257680511
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name HospitalTriage-PT-none-LTLCardinality-03
ltl formula formula --ltl=/tmp/900/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 147 places, 141 transitions and 396 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/900/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/900/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/900/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/900/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 149 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 148, there are 149 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~24!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 112
pnml2lts-mc( 0/ 4): unique states count: 208
pnml2lts-mc( 0/ 4): unique transitions count: 1360
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 67
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 227
pnml2lts-mc( 0/ 4): - cum. max stack depth: 102
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 227 states 1485 transitions, fanout: 6.542
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 11350, Transitions per second: 74250
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 28.2 B/state, compr.: 4.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 141 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HospitalTriage-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HospitalTriage-PT-none, 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 r500-smll-171649587500139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HospitalTriage-PT-none.tgz
mv HospitalTriage-PT-none 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 '
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 ;