fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075406500133
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for HospitalTriage-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
840.063 46137.00 61105.00 728.00 FFTFFFTFFTFFTFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406500133.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HospitalTriage-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406500133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 21:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 21:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 78K May 5 16:51 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-00
FORMULA_NAME HospitalTriage-PT-none-01
FORMULA_NAME HospitalTriage-PT-none-02
FORMULA_NAME HospitalTriage-PT-none-03
FORMULA_NAME HospitalTriage-PT-none-04
FORMULA_NAME HospitalTriage-PT-none-05
FORMULA_NAME HospitalTriage-PT-none-06
FORMULA_NAME HospitalTriage-PT-none-07
FORMULA_NAME HospitalTriage-PT-none-08
FORMULA_NAME HospitalTriage-PT-none-09
FORMULA_NAME HospitalTriage-PT-none-10
FORMULA_NAME HospitalTriage-PT-none-11
FORMULA_NAME HospitalTriage-PT-none-12
FORMULA_NAME HospitalTriage-PT-none-13
FORMULA_NAME HospitalTriage-PT-none-14
FORMULA_NAME HospitalTriage-PT-none-15

=== Now, execution of the tool begins

BK_START 1620794001189

Running Version 0
[2021-05-12 04:33:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 04:33:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 04:33:23] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-12 04:33:23] [INFO ] Transformed 245 places.
[2021-05-12 04:33:23] [INFO ] Transformed 228 transitions.
[2021-05-12 04:33:23] [INFO ] Parsed PT model containing 245 places and 228 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 04:33:23] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 80 transitions.
FORMULA HospitalTriage-PT-none-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 161 places. Attempting structural reductions.
Starting structural reductions, 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 29 ms. Remains 154 /161 variables (removed 7) and now considering 141/148 (removed 7) transitions.
// Phase 1: matrix 141 rows 154 cols
[2021-05-12 04:33:23] [INFO ] Computed 33 place invariants in 17 ms
[2021-05-12 04:33:23] [INFO ] Implicit Places using invariants in 199 ms returned [43, 51, 57, 78, 111, 133]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 228 ms to find 6 implicit places.
// Phase 1: matrix 141 rows 148 cols
[2021-05-12 04:33:23] [INFO ] Computed 27 place invariants in 3 ms
[2021-05-12 04:33:23] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Starting structural reductions, iteration 1 : 148/161 places, 141/148 transitions.
Applied a total of 0 rules in 11 ms. Remains 148 /148 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 148 cols
[2021-05-12 04:33:23] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-12 04:33:24] [INFO ] Dead Transitions using invariants and state equation in 220 ms returned []
Finished structural reductions, in 2 iterations. Remains : 148/161 places, 141/148 transitions.
[2021-05-12 04:33:24] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-12 04:33:24] [INFO ] Flatten gal took : 54 ms
FORMULA HospitalTriage-PT-none-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 04:33:24] [INFO ] Flatten gal took : 14 ms
[2021-05-12 04:33:24] [INFO ] Input system was already deterministic with 141 transitions.
Finished random walk after 1836 steps, including 0 resets, run visited all 12 properties in 28 ms. (steps per millisecond=65 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 148/148 places, 141/141 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 140
Applied a total of 2 rules in 9 ms. Remains 147 /148 variables (removed 1) and now considering 140/141 (removed 1) transitions.
// Phase 1: matrix 140 rows 147 cols
[2021-05-12 04:33:24] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-12 04:33:24] [INFO ] Implicit Places using invariants in 64 ms returned [35, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
// Phase 1: matrix 140 rows 145 cols
[2021-05-12 04:33:24] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-12 04:33:24] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Starting structural reductions, iteration 1 : 145/148 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.
// Phase 1: matrix 140 rows 145 cols
[2021-05-12 04:33:24] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-12 04:33:24] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 2 iterations. Remains : 145/148 places, 140/141 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : HospitalTriage-PT-none-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s18 1) (LT s33 1) (LT s106 1)), p1:(OR (LT s70 1) (LT s74 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 387 ms.
Product exploration explored 100000 steps with 0 reset in 454 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 284 ms.
Product exploration explored 100000 steps with 0 reset in 297 ms.
Applying partial POR strategy [true, true, true]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 5 out of 145 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 145/145 places, 140/140 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 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 29 place count 145 transition count 147
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 48 place count 145 transition count 147
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 61 place count 132 transition count 134
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 74 place count 132 transition count 134
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 82 place count 132 transition count 134
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 132 transition count 134
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 124 transition count 126
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 124 transition count 126
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 102 rules in 31 ms. Remains 124 /145 variables (removed 21) and now considering 126/140 (removed 14) transitions.
[2021-05-12 04:33:26] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 126 rows 124 cols
[2021-05-12 04:33:26] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-12 04:33:26] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 124/145 places, 126/140 transitions.
Product exploration explored 100000 steps with 0 reset in 451 ms.
Stack based approach found an accepted trace after 2630 steps with 0 reset with depth 2631 and stack size 2602 in 12 ms.
FORMULA HospitalTriage-PT-none-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-00 finished in 2884 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 148/148 places, 141/141 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 148 transition count 101
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 45 rules applied. Total rules applied 85 place count 107 transition count 97
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 89 place count 103 transition count 97
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 89 place count 103 transition count 85
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 113 place count 91 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 90 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 90 transition count 84
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 3 with 16 rules applied. Total rules applied 131 place count 82 transition count 76
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 145 place count 75 transition count 69
Applied a total of 145 rules in 71 ms. Remains 75 /148 variables (removed 73) and now considering 69/141 (removed 72) transitions.
// Phase 1: matrix 69 rows 75 cols
[2021-05-12 04:33:27] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-12 04:33:27] [INFO ] Implicit Places using invariants in 62 ms returned [15, 16, 18, 26, 52]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 71 ms to find 5 implicit places.
[2021-05-12 04:33:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 69 rows 70 cols
[2021-05-12 04:33:27] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-12 04:33:27] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 70/148 places, 69/141 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 70 transition count 61
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 62 transition count 61
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 60 transition count 59
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 60 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 60 transition count 57
Applied a total of 22 rules in 8 ms. Remains 60 /70 variables (removed 10) and now considering 57/69 (removed 12) transitions.
// Phase 1: matrix 57 rows 60 cols
[2021-05-12 04:33:27] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-12 04:33:27] [INFO ] Implicit Places using invariants in 29 ms returned [3, 9, 24, 25, 31, 39, 40]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 30 ms to find 7 implicit places.
Starting structural reductions, iteration 2 : 53/148 places, 57/141 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2021-05-12 04:33:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 57 rows 53 cols
[2021-05-12 04:33:27] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-12 04:33:27] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 3 iterations. Remains : 53/148 places, 57/141 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HospitalTriage-PT-none-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s12 1) (LT s23 1) (LT s43 1)) (OR (LT s10 1) (LT s25 1))), p0:(OR (LT s10 1) (LT s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4799 reset in 338 ms.
Stack based approach found an accepted trace after 3804 steps with 177 reset with depth 10 and stack size 10 in 10 ms.
FORMULA HospitalTriage-PT-none-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-01 finished in 670 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X((G(p1) U (G(p1)&&p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 148/148 places, 141/141 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 140
Applied a total of 2 rules in 5 ms. Remains 147 /148 variables (removed 1) and now considering 140/141 (removed 1) transitions.
// Phase 1: matrix 140 rows 147 cols
[2021-05-12 04:33:27] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-12 04:33:28] [INFO ] Implicit Places using invariants in 70 ms returned [35, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
// Phase 1: matrix 140 rows 145 cols
[2021-05-12 04:33:28] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-12 04:33:28] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Starting structural reductions, iteration 1 : 145/148 places, 140/141 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
[2021-05-12 04:33:28] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-12 04:33:28] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 2 iterations. Remains : 145/148 places, 140/141 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HospitalTriage-PT-none-03 automaton TGBA [mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s114 1) (GEQ s140 1)), p1:(AND (GEQ s86 1) (GEQ s140 1)), p2:(AND (GEQ s114 1) (GEQ s140 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 302 ms.
Stack based approach found an accepted trace after 65893 steps with 0 reset with depth 65894 and stack size 65894 in 225 ms.
FORMULA HospitalTriage-PT-none-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-03 finished in 884 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U p1))], workingDir=/home/mcc/execution]
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 148/148 places, 141/141 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 148 transition count 86
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 91 transition count 86
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 112 place count 91 transition count 54
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 190 place count 45 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 193 place count 45 transition count 51
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 193 place count 45 transition count 47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 201 place count 41 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 40 transition count 46
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 40 transition count 46
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 3 with 16 rules applied. Total rules applied 219 place count 32 transition count 38
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 223 place count 32 transition count 34
Applied a total of 223 rules in 11 ms. Remains 32 /148 variables (removed 116) and now considering 34/141 (removed 107) transitions.
// Phase 1: matrix 34 rows 32 cols
[2021-05-12 04:33:28] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-12 04:33:28] [INFO ] Implicit Places using invariants in 17 ms returned [5, 6, 16, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 17 ms to find 4 implicit places.
[2021-05-12 04:33:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 34 rows 28 cols
[2021-05-12 04:33:28] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 04:33:28] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 28/148 places, 34/141 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 25 transition count 31
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 25 transition count 31
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 22 transition count 28
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 22 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 22 transition count 25
Applied a total of 15 rules in 2 ms. Remains 22 /28 variables (removed 6) and now considering 25/34 (removed 9) transitions.
// Phase 1: matrix 25 rows 22 cols
[2021-05-12 04:33:28] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 04:33:28] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 25 rows 22 cols
[2021-05-12 04:33:28] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 04:33:28] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 22/148 places, 25/141 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : HospitalTriage-PT-none-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s13 1) (GEQ s20 1)), p0:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HospitalTriage-PT-none-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-04 finished in 154 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 148/148 places, 141/141 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 140
Applied a total of 2 rules in 4 ms. Remains 147 /148 variables (removed 1) and now considering 140/141 (removed 1) transitions.
// Phase 1: matrix 140 rows 147 cols
[2021-05-12 04:33:29] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-12 04:33:29] [INFO ] Implicit Places using invariants in 48 ms returned [35, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
// Phase 1: matrix 140 rows 145 cols
[2021-05-12 04:33:29] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-12 04:33:29] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Starting structural reductions, iteration 1 : 145/148 places, 140/141 transitions.
Applied a total of 0 rules in 12 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 145 cols
[2021-05-12 04:33:29] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-12 04:33:29] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 2 iterations. Remains : 145/148 places, 140/141 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HospitalTriage-PT-none-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s33 1) (GEQ s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HospitalTriage-PT-none-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-08 finished in 298 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 148/148 places, 141/141 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 140
Applied a total of 2 rules in 2 ms. Remains 147 /148 variables (removed 1) and now considering 140/141 (removed 1) transitions.
// Phase 1: matrix 140 rows 147 cols
[2021-05-12 04:33:29] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-12 04:33:29] [INFO ] Implicit Places using invariants in 43 ms returned [35, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
// Phase 1: matrix 140 rows 145 cols
[2021-05-12 04:33:29] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-12 04:33:29] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 145/148 places, 140/141 transitions.
Applied a total of 0 rules in 1 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 145 cols
[2021-05-12 04:33:29] [INFO ] Computed 25 place invariants in 1 ms
[2021-05-12 04:33:29] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 2 iterations. Remains : 145/148 places, 140/141 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HospitalTriage-PT-none-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 190 ms.
Product exploration explored 100000 steps with 33333 reset in 201 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 182 ms.
Product exploration explored 100000 steps with 33333 reset in 204 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 145 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 145/145 places, 140/140 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 145 transition count 140
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 54 place count 145 transition count 148
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 75 place count 145 transition count 148
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 92 place count 128 transition count 131
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 109 place count 128 transition count 131
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 118 place count 119 transition count 122
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 127 place count 119 transition count 122
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 135 place count 119 transition count 122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 119 transition count 122
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 147 place count 111 transition count 114
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 155 place count 111 transition count 114
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 155 rules in 23 ms. Remains 111 /145 variables (removed 34) and now considering 114/140 (removed 26) transitions.
[2021-05-12 04:33:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 114 rows 111 cols
[2021-05-12 04:33:30] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-12 04:33:30] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 111/145 places, 114/140 transitions.
Product exploration explored 100000 steps with 33333 reset in 633 ms.
Product exploration explored 100000 steps with 33333 reset in 602 ms.
[2021-05-12 04:33:31] [INFO ] Flatten gal took : 23 ms
[2021-05-12 04:33:31] [INFO ] Flatten gal took : 16 ms
[2021-05-12 04:33:31] [INFO ] Time to serialize gal into /tmp/LTL9795799293217657150.gal : 12 ms
[2021-05-12 04:33:32] [INFO ] Time to serialize properties into /tmp/LTL15666364665715819798.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9795799293217657150.gal, -t, CGAL, -LTL, /tmp/LTL15666364665715819798.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9795799293217657150.gal -t CGAL -LTL /tmp/LTL15666364665715819798.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((P1<1)||(P39<1))")))))
Formula 0 simplified : !XXF"((P1<1)||(P39<1))"
Detected timeout of ITS tools.
[2021-05-12 04:33:47] [INFO ] Flatten gal took : 8 ms
[2021-05-12 04:33:47] [INFO ] Applying decomposition
[2021-05-12 04:33:47] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9543183093538907086.txt, -o, /tmp/graph9543183093538907086.bin, -w, /tmp/graph9543183093538907086.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9543183093538907086.bin, -l, -1, -v, -w, /tmp/graph9543183093538907086.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 04:33:47] [INFO ] Decomposing Gal with order
[2021-05-12 04:33:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 04:33:47] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-12 04:33:47] [INFO ] Flatten gal took : 55 ms
[2021-05-12 04:33:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-12 04:33:47] [INFO ] Time to serialize gal into /tmp/LTL17353978270867264432.gal : 66 ms
[2021-05-12 04:33:47] [INFO ] Time to serialize properties into /tmp/LTL12935235061193467818.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17353978270867264432.gal, -t, CGAL, -LTL, /tmp/LTL12935235061193467818.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17353978270867264432.gal -t CGAL -LTL /tmp/LTL12935235061193467818.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i1.u4.P1<1)||(i3.u7.P39<1))")))))
Formula 0 simplified : !XXF"((i1.u4.P1<1)||(i3.u7.P39<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3351505401105573916
[2021-05-12 04:34:02] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3351505401105573916
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3351505401105573916]
Compilation finished in 593 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3351505401105573916]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3351505401105573916]
LTSmin run took 762 ms.
FORMULA HospitalTriage-PT-none-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HospitalTriage-PT-none-09 finished in 34494 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((!p0&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 148/148 places, 141/141 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 140
Applied a total of 2 rules in 5 ms. Remains 147 /148 variables (removed 1) and now considering 140/141 (removed 1) transitions.
// Phase 1: matrix 140 rows 147 cols
[2021-05-12 04:34:03] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-12 04:34:03] [INFO ] Implicit Places using invariants in 54 ms returned [35, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
// Phase 1: matrix 140 rows 145 cols
[2021-05-12 04:34:03] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-12 04:34:03] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Starting structural reductions, iteration 1 : 145/148 places, 140/141 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
[2021-05-12 04:34:03] [INFO ] Computed 25 place invariants in 2 ms
[2021-05-12 04:34:03] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 2 iterations. Remains : 145/148 places, 140/141 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : HospitalTriage-PT-none-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s33 1) (GEQ s133 1)), p1:(AND (OR (LT s34 1) (LT s118 1)) (OR (LT s33 1) (LT s133 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 311 ms.
Product exploration explored 100000 steps with 0 reset in 429 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 301 ms.
Product exploration explored 100000 steps with 0 reset in 345 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Support contains 4 out of 145 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 145/145 places, 140/140 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 145 transition count 140
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 47 place count 145 transition count 148
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 67 place count 145 transition count 148
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 83 place count 129 transition count 132
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 99 place count 129 transition count 132
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 108 place count 120 transition count 123
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 117 place count 120 transition count 123
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 125 place count 120 transition count 123
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 129 place count 120 transition count 123
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 137 place count 112 transition count 115
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 145 place count 112 transition count 115
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 145 rules in 20 ms. Remains 112 /145 variables (removed 33) and now considering 115/140 (removed 25) transitions.
[2021-05-12 04:34:05] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 115 rows 112 cols
[2021-05-12 04:34:05] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-12 04:34:05] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 1 iterations. Remains : 112/145 places, 115/140 transitions.
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA HospitalTriage-PT-none-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-10 finished in 2032 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 148/148 places, 141/141 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 140
Applied a total of 2 rules in 4 ms. Remains 147 /148 variables (removed 1) and now considering 140/141 (removed 1) transitions.
// Phase 1: matrix 140 rows 147 cols
[2021-05-12 04:34:05] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-12 04:34:05] [INFO ] Implicit Places using invariants in 46 ms returned [35, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
// Phase 1: matrix 140 rows 145 cols
[2021-05-12 04:34:05] [INFO ] Computed 25 place invariants in 0 ms
[2021-05-12 04:34:05] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 145/148 places, 140/141 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
[2021-05-12 04:34:05] [INFO ] Computed 25 place invariants in 3 ms
[2021-05-12 04:34:06] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 2 iterations. Remains : 145/148 places, 140/141 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HospitalTriage-PT-none-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HospitalTriage-PT-none-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-13 finished in 288 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620794047326

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is HospitalTriage-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075406500133"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;