About the Execution of LTSMin+red for ProductionCell-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
558.968 | 89197.00 | 276719.00 | 172.70 | FFFFFFTFFFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447300523.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ProductionCell-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447300523
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 10:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 13 10:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 10:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 43K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-00
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-01
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-02
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-03
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-04
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-05
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-06
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-07
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-08
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-09
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-10
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-11
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-12
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-13
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-14
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717262314315
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ProductionCell-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:18:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:18:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:18:36] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-01 17:18:36] [INFO ] Transformed 176 places.
[2024-06-01 17:18:36] [INFO ] Transformed 134 transitions.
[2024-06-01 17:18:36] [INFO ] Found NUPN structural information;
[2024-06-01 17:18:36] [INFO ] Parsed PT model containing 176 places and 134 transitions and 513 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ProductionCell-PT-none-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 134/134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 173 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 173 transition count 131
Applied a total of 6 rules in 54 ms. Remains 173 /176 variables (removed 3) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 173 cols
[2024-06-01 17:18:36] [INFO ] Computed 50 invariants in 25 ms
[2024-06-01 17:18:37] [INFO ] Implicit Places using invariants in 466 ms returned [36, 62, 127, 133, 138]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 518 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/176 places, 131/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 167 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 167 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 166 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 166 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 165 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 165 transition count 127
Applied a total of 6 rules in 42 ms. Remains 165 /168 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 165 cols
[2024-06-01 17:18:37] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 17:18:37] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 17:18:37] [INFO ] Invariant cache hit.
[2024-06-01 17:18:37] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 165/176 places, 127/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1006 ms. Remains : 165/176 places, 127/134 transitions.
Support contains 27 out of 165 places after structural reductions.
[2024-06-01 17:18:37] [INFO ] Flatten gal took : 32 ms
[2024-06-01 17:18:37] [INFO ] Flatten gal took : 15 ms
[2024-06-01 17:18:37] [INFO ] Input system was already deterministic with 127 transitions.
Support contains 24 out of 165 places (down from 27) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1271 ms. (31 steps per ms) remains 1/12 properties
BEST_FIRST walk for 20592 steps (4 resets) in 160 ms. (127 steps per ms) remains 0/1 properties
FORMULA ProductionCell-PT-none-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 21 stabilizing places and 25 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((F(p2)&&p1)))))'
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 127/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 165 /165 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-06-01 17:18:38] [INFO ] Invariant cache hit.
[2024-06-01 17:18:38] [INFO ] Implicit Places using invariants in 102 ms returned [41, 130]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 107 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/165 places, 127/127 transitions.
Applied a total of 0 rules in 16 ms. Remains 163 /163 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 163/165 places, 127/127 transitions.
Stuttering acceptance computed with spot in 372 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-02
Product exploration explored 100000 steps with 172 reset in 285 ms.
Stack based approach found an accepted trace after 17680 steps with 29 reset with depth 642 and stack size 641 in 52 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-02 finished in 918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 127/127 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 165 transition count 124
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 162 transition count 124
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 6 place count 162 transition count 96
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 57 rules applied. Total rules applied 63 place count 133 transition count 96
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 83 place count 123 transition count 86
Applied a total of 83 rules in 58 ms. Remains 123 /165 variables (removed 42) and now considering 86/127 (removed 41) transitions.
// Phase 1: matrix 86 rows 123 cols
[2024-06-01 17:18:39] [INFO ] Computed 44 invariants in 3 ms
[2024-06-01 17:18:39] [INFO ] Implicit Places using invariants in 131 ms returned [20, 21, 32, 69, 71, 72, 90]
[2024-06-01 17:18:39] [INFO ] Actually due to overlaps returned [69, 72, 20, 21, 71]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 144 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/165 places, 86/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 118/165 places, 86/127 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-06
Product exploration explored 100000 steps with 8477 reset in 219 ms.
Product exploration explored 100000 steps with 8496 reset in 325 ms.
Computed a total of 15 stabilizing places and 19 stable transitions
Computed a total of 15 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 35 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 201 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 118 cols
[2024-06-01 17:18:40] [INFO ] Computed 39 invariants in 3 ms
[2024-06-01 17:18:40] [INFO ] Implicit Places using invariants in 120 ms returned [30, 85]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 122 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/118 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 116 /116 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 132 ms. Remains : 116/118 places, 86/86 transitions.
Computed a total of 15 stabilizing places and 19 stable transitions
Computed a total of 15 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 39 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8468 reset in 261 ms.
Product exploration explored 100000 steps with 8483 reset in 257 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 116 /116 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 116 cols
[2024-06-01 17:18:41] [INFO ] Computed 37 invariants in 3 ms
[2024-06-01 17:18:42] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 17:18:42] [INFO ] Invariant cache hit.
[2024-06-01 17:18:42] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-06-01 17:18:42] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2024-06-01 17:18:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-01 17:18:43] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 7 ms to minimize.
[2024-06-01 17:18:43] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 7 ms to minimize.
[2024-06-01 17:18:43] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 17:18:43] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/41 constraints. Problems are: Problem set: 1 solved, 84 unsolved
[2024-06-01 17:18:44] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-06-01 17:18:44] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 3 ms to minimize.
[2024-06-01 17:18:44] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:18:44] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 4/45 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/45 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 86/202 variables, 116/161 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/161 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/161 constraints. Problems are: Problem set: 5 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 161 constraints, problems are : Problem set: 5 solved, 80 unsolved in 3475 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 5 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 30/35 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/37 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 8/45 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/45 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 86/202 variables, 116/161 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 80/241 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/241 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/241 constraints. Problems are: Problem set: 5 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 241 constraints, problems are : Problem set: 5 solved, 80 unsolved in 5262 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 80/85 constraints, Known Traps: 8/8 constraints]
After SMT, in 8813ms problems are : Problem set: 5 solved, 80 unsolved
Search for dead transitions found 5 dead transitions in 8833ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 116/116 places, 81/86 transitions.
Ensure Unique test removed 1 places
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 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 80
Applied a total of 2 rules in 15 ms. Remains 114 /116 variables (removed 2) and now considering 80/81 (removed 1) transitions.
// Phase 1: matrix 80 rows 114 cols
[2024-06-01 17:18:51] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 17:18:51] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 17:18:51] [INFO ] Invariant cache hit.
[2024-06-01 17:18:51] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/116 places, 80/86 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9498 ms. Remains : 114/116 places, 80/86 transitions.
Treatment of property ProductionCell-PT-none-LTLCardinality-06 finished in 11984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 127/127 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 165 transition count 124
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 162 transition count 124
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 6 place count 162 transition count 96
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 57 rules applied. Total rules applied 63 place count 133 transition count 96
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 83 place count 123 transition count 86
Applied a total of 83 rules in 16 ms. Remains 123 /165 variables (removed 42) and now considering 86/127 (removed 41) transitions.
// Phase 1: matrix 86 rows 123 cols
[2024-06-01 17:18:51] [INFO ] Computed 44 invariants in 2 ms
[2024-06-01 17:18:51] [INFO ] Implicit Places using invariants in 123 ms returned [20, 21, 32, 69, 70, 71, 72, 90]
[2024-06-01 17:18:51] [INFO ] Actually due to overlaps returned [69, 72, 20, 21, 70, 71]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 139 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/165 places, 86/127 transitions.
Applied a total of 0 rules in 18 ms. Remains 117 /117 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 178 ms. Remains : 117/165 places, 86/127 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-08
Product exploration explored 100000 steps with 1 reset in 183 ms.
Product exploration explored 100000 steps with 1 reset in 267 ms.
Computed a total of 15 stabilizing places and 19 stable transitions
Computed a total of 15 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 154 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 139 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 117 cols
[2024-06-01 17:18:52] [INFO ] Computed 38 invariants in 1 ms
[2024-06-01 17:18:52] [INFO ] Implicit Places using invariants in 138 ms returned [30, 84]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 153 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/117 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 163 ms. Remains : 115/117 places, 86/86 transitions.
Computed a total of 15 stabilizing places and 19 stable transitions
Computed a total of 15 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 107 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 150 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 196 ms.
Product exploration explored 100000 steps with 8 reset in 203 ms.
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 86/86 transitions.
Applied a total of 0 rules in 16 ms. Remains 115 /115 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 115 cols
[2024-06-01 17:18:53] [INFO ] Computed 36 invariants in 0 ms
[2024-06-01 17:18:53] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 17:18:53] [INFO ] Invariant cache hit.
[2024-06-01 17:18:54] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-06-01 17:18:54] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2024-06-01 17:18:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-01 17:18:54] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:18:54] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/38 constraints. Problems are: Problem set: 1 solved, 84 unsolved
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 17:18:55] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 5/43 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/43 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 86/201 variables, 115/158 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/158 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/158 constraints. Problems are: Problem set: 5 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 158 constraints, problems are : Problem set: 5 solved, 80 unsolved in 2565 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 5 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 30/34 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 2/36 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 7/43 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/43 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 86/201 variables, 115/158 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 80/238 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/238 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/238 constraints. Problems are: Problem set: 5 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 238 constraints, problems are : Problem set: 5 solved, 80 unsolved in 3335 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 80/85 constraints, Known Traps: 7/7 constraints]
After SMT, in 5950ms problems are : Problem set: 5 solved, 80 unsolved
Search for dead transitions found 5 dead transitions in 5951ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 115/115 places, 81/86 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 6 ms. Remains 114 /115 variables (removed 1) and now considering 81/81 (removed 0) transitions.
[2024-06-01 17:19:00] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 6250 ms. Remains : 114/115 places, 81/86 transitions.
Treatment of property ProductionCell-PT-none-LTLCardinality-08 finished in 8648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 127/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 165 /165 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 165 cols
[2024-06-01 17:19:00] [INFO ] Computed 45 invariants in 3 ms
[2024-06-01 17:19:00] [INFO ] Implicit Places using invariants in 216 ms returned [41, 57, 130]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 217 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/165 places, 127/127 transitions.
Applied a total of 0 rules in 14 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 234 ms. Remains : 162/165 places, 127/127 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-09 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p1)&&p0) U X(G(!p2))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 165 /165 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-06-01 17:19:00] [INFO ] Invariant cache hit.
[2024-06-01 17:19:00] [INFO ] Implicit Places using invariants in 139 ms returned [41, 57, 130]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 151 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/165 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 162/165 places, 127/127 transitions.
Stuttering acceptance computed with spot in 185 ms :[p2, (AND p2 (NOT p1)), p2, true, (NOT p1)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-12 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 164 transition count 123
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 161 transition count 123
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 6 place count 161 transition count 96
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 60 place count 134 transition count 96
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 128 transition count 90
Applied a total of 72 rules in 13 ms. Remains 128 /165 variables (removed 37) and now considering 90/127 (removed 37) transitions.
// Phase 1: matrix 90 rows 128 cols
[2024-06-01 17:19:00] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 17:19:00] [INFO ] Implicit Places using invariants in 68 ms returned [20, 21, 32, 45, 72, 73, 77]
[2024-06-01 17:19:00] [INFO ] Actually due to overlaps returned [72, 77, 20, 21, 45, 73]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 82 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/165 places, 90/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 122/165 places, 90/127 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 131 ms.
Product exploration explored 100000 steps with 0 reset in 234 ms.
Computed a total of 15 stabilizing places and 19 stable transitions
Computed a total of 15 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
BEST_FIRST walk for 25318 steps (5 resets) in 105 ms. (238 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 7 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 122 cols
[2024-06-01 17:19:01] [INFO ] Computed 39 invariants in 0 ms
[2024-06-01 17:19:01] [INFO ] Implicit Places using invariants in 70 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/122 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 121/122 places, 90/90 transitions.
Computed a total of 15 stabilizing places and 19 stable transitions
Computed a total of 15 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 17527 steps (3 resets) in 25 ms. (674 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 163 ms.
Support contains 7 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 121 cols
[2024-06-01 17:19:02] [INFO ] Computed 38 invariants in 0 ms
[2024-06-01 17:19:02] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 17:19:02] [INFO ] Invariant cache hit.
[2024-06-01 17:19:02] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-06-01 17:19:02] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2024-06-01 17:19:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 17:19:03] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 17:19:03] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-06-01 17:19:03] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
[2024-06-01 17:19:03] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2024-06-01 17:19:03] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:19:03] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 6/34 constraints. Problems are: Problem set: 5 solved, 82 unsolved
[2024-06-01 17:19:03] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/35 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 1/121 variables, 10/45 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/45 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 90/211 variables, 121/166 constraints. Problems are: Problem set: 5 solved, 82 unsolved
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 1/167 constraints. Problems are: Problem set: 5 solved, 82 unsolved
[2024-06-01 17:19:05] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 1/168 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/168 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/211 variables, 0/168 constraints. Problems are: Problem set: 5 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 168 constraints, problems are : Problem set: 5 solved, 82 unsolved in 3194 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 5 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 19/19 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 7/26 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/33 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/33 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 2/120 variables, 11/44 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/45 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/45 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 1/121 variables, 1/46 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/47 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/47 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 90/211 variables, 121/168 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 82/250 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 0/250 constraints. Problems are: Problem set: 5 solved, 82 unsolved
At refinement iteration 13 (OVERLAPS) 0/211 variables, 0/250 constraints. Problems are: Problem set: 5 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 250 constraints, problems are : Problem set: 5 solved, 82 unsolved in 2963 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 82/87 constraints, Known Traps: 9/9 constraints]
After SMT, in 6245ms problems are : Problem set: 5 solved, 82 unsolved
Search for dead transitions found 5 dead transitions in 6246ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 121/121 places, 85/90 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 8 ms. Remains 120 /121 variables (removed 1) and now considering 85/85 (removed 0) transitions.
[2024-06-01 17:19:09] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 6576 ms. Remains : 120/121 places, 85/90 transitions.
Treatment of property ProductionCell-PT-none-LTLCardinality-15 finished in 8320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 17:19:09] [INFO ] Flatten gal took : 10 ms
[2024-06-01 17:19:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 17:19:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 165 places, 127 transitions and 476 arcs took 2 ms.
Total runtime 33620 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ProductionCell-PT-none-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ProductionCell-PT-none-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ProductionCell-PT-none-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717262403512
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ProductionCell-PT-none-LTLCardinality-06
ltl formula formula --ltl=/tmp/1037/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 165 places, 127 transitions and 476 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1037/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1037/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1037/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1037/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 166 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 166, there are 151 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~30 levels ~10000 states ~28268 transitions
pnml2lts-mc( 0/ 4): ~32 levels ~20000 states ~55460 transitions
pnml2lts-mc( 0/ 4): ~32 levels ~40000 states ~112124 transitions
pnml2lts-mc( 0/ 4): ~32 levels ~80000 states ~245996 transitions
pnml2lts-mc( 0/ 4): ~32 levels ~160000 states ~531008 transitions
pnml2lts-mc( 0/ 4): ~32 levels ~320000 states ~1107108 transitions
pnml2lts-mc( 0/ 4): ~32 levels ~640000 states ~2428712 transitions
pnml2lts-mc( 0/ 4): ~32 levels ~1280000 states ~5032484 transitions
pnml2lts-mc( 0/ 4): ~33 levels ~2560000 states ~10225004 transitions
pnml2lts-mc( 2/ 4): ~34 levels ~5120000 states ~21836052 transitions
pnml2lts-mc( 2/ 4): ~34 levels ~10240000 states ~47059584 transitions
pnml2lts-mc( 2/ 4): ~34 levels ~20480000 states ~102233816 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16803913
pnml2lts-mc( 0/ 4): unique states count: 16803913
pnml2lts-mc( 0/ 4): unique transitions count: 83902324
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 67099645
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 16804347
pnml2lts-mc( 0/ 4): - cum. max stack depth: 134
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16804347 states 83907009 transitions, fanout: 4.993
pnml2lts-mc( 0/ 4): Total exploration time 48.410 sec (48.410 sec minimum, 48.410 sec on average)
pnml2lts-mc( 0/ 4): States per second: 347126, Transitions per second: 1733258
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 134.9MB, 8.4 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 50.0%/10.0%
pnml2lts-mc( 0/ 4): Stored 127 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 134.9MB (~256.0MB paged-in)
ltl formula name ProductionCell-PT-none-LTLCardinality-08
ltl formula formula --ltl=/tmp/1037/ltl_1_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 165 places, 127 transitions and 476 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1037/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1037/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1037/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1037/ltl_1_
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): There are 167 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 166, there are 136 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~69!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 70
pnml2lts-mc( 0/ 4): unique states count: 229
pnml2lts-mc( 0/ 4): unique transitions count: 964
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 235
pnml2lts-mc( 0/ 4): - cum. max stack depth: 165
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 235 states 1005 transitions, fanout: 4.277
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 19.6 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 127 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ProductionCell-PT-none-LTLCardinality-15
ltl formula formula --ltl=/tmp/1037/ltl_2_
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
pnml2lts-mc( 0/ 4): Petri net has 165 places, 127 transitions and 476 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1037/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1037/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1037/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1037/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 166 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 166, there are 225 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1529 levels ~10000 states ~167180 transitions
pnml2lts-mc( 1/ 4): ~2474 levels ~20000 states ~320972 transitions
pnml2lts-mc( 1/ 4): ~4452 levels ~40000 states ~641540 transitions
pnml2lts-mc( 1/ 4): ~6430 levels ~80000 states ~1265648 transitions
pnml2lts-mc( 1/ 4): ~8409 levels ~160000 states ~2626916 transitions
pnml2lts-mc( 1/ 4): ~12041 levels ~320000 states ~5595704 transitions
pnml2lts-mc( 3/ 4): ~110652 levels ~640000 states ~5064876 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~177287!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 715179
pnml2lts-mc( 0/ 4): unique transitions count: 10562928
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 8317282
pnml2lts-mc( 0/ 4): - claim success count: 715185
pnml2lts-mc( 0/ 4): - cum. max stack depth: 220065
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 715185 states 10563004 transitions, fanout: 14.770
pnml2lts-mc( 0/ 4): Total exploration time 4.150 sec (4.130 sec minimum, 4.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 172334, Transitions per second: 2545302
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 9.9MB, 8.9 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 3.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 127 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 9.9MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ProductionCell-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ProductionCell-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447300523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ProductionCell-PT-none.tgz
mv ProductionCell-PT-none execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;