About the Execution of LTSMin+red for Medical-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 865.844 | 28443.00 | 47711.00 | 573.80 | FTFT?FFFTTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r233-tall-167856419300707.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Medical-PT-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419300707
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.7K Feb 25 14:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 14:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 14:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 14:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Feb 25 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 5 18:22 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 Medical-PT-16-LTLCardinality-00
FORMULA_NAME Medical-PT-16-LTLCardinality-01
FORMULA_NAME Medical-PT-16-LTLCardinality-02
FORMULA_NAME Medical-PT-16-LTLCardinality-03
FORMULA_NAME Medical-PT-16-LTLCardinality-04
FORMULA_NAME Medical-PT-16-LTLCardinality-05
FORMULA_NAME Medical-PT-16-LTLCardinality-06
FORMULA_NAME Medical-PT-16-LTLCardinality-07
FORMULA_NAME Medical-PT-16-LTLCardinality-08
FORMULA_NAME Medical-PT-16-LTLCardinality-09
FORMULA_NAME Medical-PT-16-LTLCardinality-10
FORMULA_NAME Medical-PT-16-LTLCardinality-11
FORMULA_NAME Medical-PT-16-LTLCardinality-12
FORMULA_NAME Medical-PT-16-LTLCardinality-13
FORMULA_NAME Medical-PT-16-LTLCardinality-14
FORMULA_NAME Medical-PT-16-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679584888389
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-16
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 15:21:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 15:21:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 15:21:30] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2023-03-23 15:21:30] [INFO ] Transformed 312 places.
[2023-03-23 15:21:30] [INFO ] Transformed 5431 transitions.
[2023-03-23 15:21:30] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 242 places in 20 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Medical-PT-16-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 227
Applied a total of 2 rules in 13 ms. Remains 67 /69 variables (removed 2) and now considering 227/227 (removed 0) transitions.
[2023-03-23 15:21:30] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 67 cols
[2023-03-23 15:21:30] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-23 15:21:30] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-23 15:21:30] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2023-03-23 15:21:30] [INFO ] Invariant cache hit.
[2023-03-23 15:21:31] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-23 15:21:31] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-23 15:21:31] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2023-03-23 15:21:31] [INFO ] Invariant cache hit.
[2023-03-23 15:21:31] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 227/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 543 ms. Remains : 67/69 places, 227/227 transitions.
Support contains 6 out of 67 places after structural reductions.
[2023-03-23 15:21:31] [INFO ] Flatten gal took : 53 ms
[2023-03-23 15:21:31] [INFO ] Flatten gal took : 30 ms
[2023-03-23 15:21:31] [INFO ] Input system was already deterministic with 227 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 15:21:32] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2023-03-23 15:21:32] [INFO ] Invariant cache hit.
[2023-03-23 15:21:32] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 15:21:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-23 15:21:32] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-23 15:21:32] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-23 15:21:32] [INFO ] After 29ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-23 15:21:32] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 13 ms to minimize.
[2023-03-23 15:21:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-23 15:21:32] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-23 15:21:32] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 227/227 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 67 transition count 224
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 61 transition count 222
Applied a total of 12 rules in 34 ms. Remains 61 /67 variables (removed 6) and now considering 222/227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 61/67 places, 222/227 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 495428 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 495428 steps, saw 281607 distinct states, run finished after 3002 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-23 15:21:35] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2023-03-23 15:21:35] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-23 15:21:35] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 15:21:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-23 15:21:35] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 15:21:35] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:36] [INFO ] After 22ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 15:21:36] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2023-03-23 15:21:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-23 15:21:36] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-23 15:21:36] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 8 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-23 15:21:36] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2023-03-23 15:21:36] [INFO ] Invariant cache hit.
[2023-03-23 15:21:36] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-23 15:21:36] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2023-03-23 15:21:36] [INFO ] Invariant cache hit.
[2023-03-23 15:21:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:36] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-23 15:21:36] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-23 15:21:36] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2023-03-23 15:21:36] [INFO ] Invariant cache hit.
[2023-03-23 15:21:36] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322 ms. Remains : 61/61 places, 222/222 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 61 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 61 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 60 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 59 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 56 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 56 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 55 transition count 198
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 55 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 54 transition count 221
Applied a total of 65 rules in 22 ms. Remains 54 /61 variables (removed 7) and now considering 221/222 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 221 rows 54 cols
[2023-03-23 15:21:36] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-23 15:21:36] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 15:21:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-23 15:21:36] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 15:21:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-23 15:21:36] [INFO ] After 16ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 15:21:36] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-23 15:21:36] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA Medical-PT-16-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 5 simplifications.
FORMULA Medical-PT-16-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 33 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 227/227 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 67 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 224
Applied a total of 8 rules in 10 ms. Remains 63 /67 variables (removed 4) and now considering 224/227 (removed 3) transitions.
[2023-03-23 15:21:36] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
// Phase 1: matrix 178 rows 63 cols
[2023-03-23 15:21:36] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-23 15:21:37] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-23 15:21:37] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:37] [INFO ] Invariant cache hit.
[2023-03-23 15:21:37] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:37] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-23 15:21:37] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-23 15:21:37] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:37] [INFO ] Invariant cache hit.
[2023-03-23 15:21:37] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/67 places, 224/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 63/67 places, 224/227 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Medical-PT-16-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s37 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 7 ms.
FORMULA Medical-PT-16-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Medical-PT-16-LTLCardinality-00 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 227/227 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 67 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 224
Applied a total of 8 rules in 10 ms. Remains 63 /67 variables (removed 4) and now considering 224/227 (removed 3) transitions.
[2023-03-23 15:21:37] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:37] [INFO ] Invariant cache hit.
[2023-03-23 15:21:37] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-23 15:21:37] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:37] [INFO ] Invariant cache hit.
[2023-03-23 15:21:37] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:37] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-23 15:21:37] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-23 15:21:37] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:37] [INFO ] Invariant cache hit.
[2023-03-23 15:21:37] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/67 places, 224/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 440 ms. Remains : 63/67 places, 224/227 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Medical-PT-16-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s22 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 664 reset in 354 ms.
Product exploration explored 100000 steps with 662 reset in 239 ms.
Computed a total of 6 stabilizing places and 33 stable transitions
Computed a total of 6 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10006 steps, including 47 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1254271 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :{}
Probabilistic random walk after 1254271 steps, saw 726136 distinct states, run finished after 3001 ms. (steps per millisecond=417 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 15:21:41] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:41] [INFO ] Invariant cache hit.
[2023-03-23 15:21:41] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 15:21:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-23 15:21:41] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 15:21:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:41] [INFO ] After 14ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 15:21:41] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-23 15:21:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-23 15:21:42] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-23 15:21:42] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 224/224 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 222
Applied a total of 4 rules in 9 ms. Remains 61 /63 variables (removed 2) and now considering 222/224 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 61/63 places, 222/224 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1370341 steps, run timeout after 3001 ms. (steps per millisecond=456 ) properties seen :{}
Probabilistic random walk after 1370341 steps, saw 783495 distinct states, run finished after 3003 ms. (steps per millisecond=456 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 15:21:45] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2023-03-23 15:21:45] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-23 15:21:45] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 15:21:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-23 15:21:45] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 15:21:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:45] [INFO ] After 16ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 15:21:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-23 15:21:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-23 15:21:45] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-23 15:21:45] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-23 15:21:45] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2023-03-23 15:21:45] [INFO ] Invariant cache hit.
[2023-03-23 15:21:45] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-23 15:21:45] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2023-03-23 15:21:45] [INFO ] Invariant cache hit.
[2023-03-23 15:21:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:45] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-23 15:21:45] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-23 15:21:45] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2023-03-23 15:21:45] [INFO ] Invariant cache hit.
[2023-03-23 15:21:45] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 61/61 places, 222/222 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 61 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 61 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 60 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 59 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 56 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 56 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 55 transition count 198
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 55 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 54 transition count 221
Applied a total of 65 rules in 19 ms. Remains 54 /61 variables (removed 7) and now considering 221/222 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 54 cols
[2023-03-23 15:21:45] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-23 15:21:45] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 15:21:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-23 15:21:45] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 15:21:45] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-23 15:21:45] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 15:21:45] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-23 15:21:45] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 224/224 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2023-03-23 15:21:45] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
// Phase 1: matrix 178 rows 63 cols
[2023-03-23 15:21:45] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-23 15:21:45] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-23 15:21:45] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:45] [INFO ] Invariant cache hit.
[2023-03-23 15:21:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:46] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-23 15:21:46] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-23 15:21:46] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:46] [INFO ] Invariant cache hit.
[2023-03-23 15:21:46] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 63/63 places, 224/224 transitions.
Computed a total of 6 stabilizing places and 33 stable transitions
Computed a total of 6 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10013 steps, including 56 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1266388 steps, run timeout after 3001 ms. (steps per millisecond=421 ) properties seen :{}
Probabilistic random walk after 1266388 steps, saw 731931 distinct states, run finished after 3001 ms. (steps per millisecond=421 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 15:21:49] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:49] [INFO ] Invariant cache hit.
[2023-03-23 15:21:49] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 15:21:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-23 15:21:49] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 15:21:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:49] [INFO ] After 24ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 15:21:49] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-23 15:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-23 15:21:49] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-23 15:21:49] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 224/224 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 222
Applied a total of 4 rules in 8 ms. Remains 61 /63 variables (removed 2) and now considering 222/224 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 61/63 places, 222/224 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1383661 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :{}
Probabilistic random walk after 1383661 steps, saw 791487 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 15:21:52] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2023-03-23 15:21:52] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-23 15:21:52] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 15:21:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-23 15:21:52] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 15:21:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:52] [INFO ] After 16ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 15:21:52] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-23 15:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-23 15:21:52] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-23 15:21:52] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 9 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-23 15:21:52] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2023-03-23 15:21:52] [INFO ] Invariant cache hit.
[2023-03-23 15:21:53] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-23 15:21:53] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2023-03-23 15:21:53] [INFO ] Invariant cache hit.
[2023-03-23 15:21:53] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:53] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-23 15:21:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 15:21:53] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2023-03-23 15:21:53] [INFO ] Invariant cache hit.
[2023-03-23 15:21:53] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 61/61 places, 222/222 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 61 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 61 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 60 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 59 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 56 transition count 199
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 56 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 55 transition count 198
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 55 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 54 transition count 221
Applied a total of 65 rules in 17 ms. Remains 54 /61 variables (removed 7) and now considering 221/222 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 54 cols
[2023-03-23 15:21:53] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-23 15:21:53] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 15:21:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-23 15:21:53] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 15:21:53] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-23 15:21:53] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 15:21:53] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-23 15:21:53] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 654 reset in 174 ms.
Product exploration explored 100000 steps with 642 reset in 230 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 224/224 transitions.
Applied a total of 0 rules in 13 ms. Remains 63 /63 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2023-03-23 15:21:54] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
// Phase 1: matrix 178 rows 63 cols
[2023-03-23 15:21:54] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-23 15:21:54] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-23 15:21:54] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:54] [INFO ] Invariant cache hit.
[2023-03-23 15:21:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:54] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-23 15:21:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 15:21:54] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:54] [INFO ] Invariant cache hit.
[2023-03-23 15:21:54] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 382 ms. Remains : 63/63 places, 224/224 transitions.
Treatment of property Medical-PT-16-LTLCardinality-04 finished in 17363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(!p0))))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 227/227 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 67 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 224
Applied a total of 8 rules in 12 ms. Remains 63 /67 variables (removed 4) and now considering 224/227 (removed 3) transitions.
[2023-03-23 15:21:54] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:54] [INFO ] Invariant cache hit.
[2023-03-23 15:21:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-23 15:21:54] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:54] [INFO ] Invariant cache hit.
[2023-03-23 15:21:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-23 15:21:55] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-23 15:21:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 15:21:55] [INFO ] Flow matrix only has 178 transitions (discarded 46 similar events)
[2023-03-23 15:21:55] [INFO ] Invariant cache hit.
[2023-03-23 15:21:55] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/67 places, 224/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 63/67 places, 224/227 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, p0]
Running random walk in product with property : Medical-PT-16-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s31 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2073 steps with 101 reset in 12 ms.
FORMULA Medical-PT-16-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Medical-PT-16-LTLCardinality-06 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-23 15:21:55] [INFO ] Flatten gal took : 26 ms
[2023-03-23 15:21:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-23 15:21:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 227 transitions and 1142 arcs took 3 ms.
Total runtime 25384 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/792/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Medical-PT-16-LTLCardinality-04
BK_STOP 1679584916832
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Medical-PT-16-LTLCardinality-04
ltl formula formula --ltl=/tmp/792/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 67 places, 227 transitions and 1142 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.110 real 0.040 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/792/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/792/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/792/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/792/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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="Medical-PT-16"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Medical-PT-16, 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 r233-tall-167856419300707"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Medical-PT-16.tgz
mv Medical-PT-16 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 ;