Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r267-smll-171654405500012.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ParamProductionCell-PT-0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405500012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 4.0K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 20:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 149K 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 ParamProductionCell-PT-0-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716648690966

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-0
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:51:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 14:51:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:51:34] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2024-05-25 14:51:34] [INFO ] Transformed 198 places.
[2024-05-25 14:51:34] [INFO ] Transformed 176 transitions.
[2024-05-25 14:51:34] [INFO ] Found NUPN structural information;
[2024-05-25 14:51:34] [INFO ] Parsed PT model containing 198 places and 176 transitions and 730 arcs in 581 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-0-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 176/176 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 193 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 193 transition count 171
Applied a total of 10 rules in 97 ms. Remains 193 /198 variables (removed 5) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 193 cols
[2024-05-25 14:51:34] [INFO ] Computed 49 invariants in 45 ms
[2024-05-25 14:51:35] [INFO ] Implicit Places using invariants in 751 ms returned [15, 16, 18, 24, 31, 35, 42, 47, 59, 64, 65, 79, 99, 118, 119, 165, 166]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 845 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 176/198 places, 171/176 transitions.
Applied a total of 0 rules in 44 ms. Remains 176 /176 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1041 ms. Remains : 176/198 places, 171/176 transitions.
Support contains 56 out of 176 places after structural reductions.
[2024-05-25 14:51:36] [INFO ] Flatten gal took : 87 ms
[2024-05-25 14:51:36] [INFO ] Flatten gal took : 48 ms
[2024-05-25 14:51:36] [INFO ] Input system was already deterministic with 171 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (8 resets) in 1655 ms. (24 steps per ms) remains 1/29 properties
BEST_FIRST walk for 40003 steps (8 resets) in 526 ms. (75 steps per ms) remains 1/1 properties
// Phase 1: matrix 171 rows 176 cols
[2024-05-25 14:51:36] [INFO ] Computed 32 invariants in 6 ms
[2024-05-25 14:51:36] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/136 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 14:51:37] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 12 ms to minimize.
[2024-05-25 14:51:37] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/156 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/158 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 153/311 variables, 158/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 35/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/317 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/317 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/317 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 16/333 variables, 24/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/333 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 14/347 variables, 14/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/347 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/347 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/347 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 176/176 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/136 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/156 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/158 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 153/311 variables, 158/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 35/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/311 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/317 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/317 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/317 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 16/333 variables, 24/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/333 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 14/347 variables, 14/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/347 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 14:51:38] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 3 ms to minimize.
[2024-05-25 14:51:38] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 3 ms to minimize.
[2024-05-25 14:51:38] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 2 ms to minimize.
[2024-05-25 14:51:38] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-25 14:51:38] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/347 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/347 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/347 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 176/176 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1865ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 176 transition count 157
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 162 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 161 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 30 place count 161 transition count 144
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 54 place count 149 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 148 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 148 transition count 143
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 100 place count 125 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 100 place count 125 transition count 121
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 123 transition count 121
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 3 with 2 rules applied. Total rules applied 105 place count 122 transition count 120
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 122 transition count 116
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 113 place count 118 transition count 116
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 118 transition count 116
Applied a total of 115 rules in 115 ms. Remains 118 /176 variables (removed 58) and now considering 116/171 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 118/176 places, 116/171 transitions.
RANDOM walk for 37313 steps (8 resets) in 1411 ms. (26 steps per ms) remains 0/1 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))&&X(X((X(F(p1))&&p2)))))'
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 7 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-25 14:51:39] [INFO ] Computed 32 invariants in 3 ms
[2024-05-25 14:51:40] [INFO ] Implicit Places using invariants in 240 ms returned [16, 35, 39, 62, 67, 88, 100, 101, 103, 144, 145, 147]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 241 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 170/171 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 253 ms. Remains : 163/176 places, 170/171 transitions.
Stuttering acceptance computed with spot in 485 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND p0 (NOT p1))), (OR (NOT p2) (AND p0 (NOT p1))), true]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1521 steps with 1 reset in 17 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-00 finished in 842 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)||G(p1))))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 176 transition count 158
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 163 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 161 transition count 156
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 30 place count 161 transition count 146
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 50 place count 151 transition count 146
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 98 place count 126 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 98 place count 126 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 124 transition count 122
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 3 with 2 rules applied. Total rules applied 103 place count 123 transition count 121
Applied a total of 103 rules in 28 ms. Remains 123 /176 variables (removed 53) and now considering 121/171 (removed 50) transitions.
// Phase 1: matrix 121 rows 123 cols
[2024-05-25 14:51:40] [INFO ] Computed 29 invariants in 2 ms
[2024-05-25 14:51:40] [INFO ] Implicit Places using invariants in 154 ms returned [0, 9, 17, 20, 38, 41, 52, 64, 65, 67, 101, 102, 104]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 156 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/176 places, 121/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 110 transition count 117
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 106 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 105 transition count 116
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 105 transition count 113
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 102 transition count 113
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 50 place count 85 transition count 96
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 3 with 2 rules applied. Total rules applied 52 place count 84 transition count 95
Applied a total of 52 rules in 18 ms. Remains 84 /110 variables (removed 26) and now considering 95/121 (removed 26) transitions.
// Phase 1: matrix 95 rows 84 cols
[2024-05-25 14:51:40] [INFO ] Computed 16 invariants in 1 ms
[2024-05-25 14:51:40] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-25 14:51:40] [INFO ] Invariant cache hit.
[2024-05-25 14:51:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-25 14:51:41] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/176 places, 95/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 631 ms. Remains : 84/176 places, 95/171 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 523 ms.
Stack based approach found an accepted trace after 1887 steps with 0 reset with depth 1888 and stack size 839 in 11 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-01 finished in 1249 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))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 176 transition count 154
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 159 transition count 154
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 34 place count 159 transition count 144
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 54 place count 149 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 148 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 148 transition count 143
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 118 place count 116 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 118 place count 116 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 114 transition count 112
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 2 with 2 rules applied. Total rules applied 123 place count 113 transition count 111
Applied a total of 123 rules in 27 ms. Remains 113 /176 variables (removed 63) and now considering 111/171 (removed 60) transitions.
// Phase 1: matrix 111 rows 113 cols
[2024-05-25 14:51:41] [INFO ] Computed 29 invariants in 1 ms
[2024-05-25 14:51:42] [INFO ] Implicit Places using invariants in 166 ms returned [0, 9, 17, 20, 23, 36, 39, 50, 52, 62, 63, 65, 92, 93, 95]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 167 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/176 places, 111/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 98 transition count 105
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 92 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 92 transition count 101
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 88 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 86 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 86 transition count 99
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 62 place count 67 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 66 transition count 79
Applied a total of 64 rules in 16 ms. Remains 66 /98 variables (removed 32) and now considering 79/111 (removed 32) transitions.
// Phase 1: matrix 79 rows 66 cols
[2024-05-25 14:51:42] [INFO ] Computed 14 invariants in 1 ms
[2024-05-25 14:51:42] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-25 14:51:42] [INFO ] Invariant cache hit.
[2024-05-25 14:51:42] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-25 14:51:42] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/176 places, 79/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 438 ms. Remains : 66/176 places, 79/171 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-02
Product exploration explored 100000 steps with 158 reset in 408 ms.
Stack based approach found an accepted trace after 118 steps with 0 reset with depth 119 and stack size 119 in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-02 finished in 913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p1 U p2)&&p0))))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 11 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-25 14:51:42] [INFO ] Computed 32 invariants in 3 ms
[2024-05-25 14:51:43] [INFO ] Implicit Places using invariants in 320 ms returned [16, 30, 35, 39, 62, 67, 86, 88, 100, 101, 103, 145, 147]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 323 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 32 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2024-05-25 14:51:43] [INFO ] Computed 19 invariants in 3 ms
[2024-05-25 14:51:43] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-25 14:51:43] [INFO ] Invariant cache hit.
[2024-05-25 14:51:43] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-25 14:51:43] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 914 ms. Remains : 160/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-03 finished in 1148 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(F((p1||G(p2))))&&p0)))'
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 11 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-25 14:51:44] [INFO ] Computed 32 invariants in 2 ms
[2024-05-25 14:51:44] [INFO ] Implicit Places using invariants in 263 ms returned [30, 35, 39, 62, 67, 86, 100, 101, 103, 144, 145, 147]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 264 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 170/171 transitions.
Applied a total of 0 rules in 8 ms. Remains 163 /163 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 284 ms. Remains : 163/176 places, 170/171 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-04 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 176 transition count 154
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 159 transition count 154
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 34 place count 159 transition count 144
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 54 place count 149 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 148 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 148 transition count 143
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 120 place count 115 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 120 place count 115 transition count 111
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 113 transition count 111
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 2 with 2 rules applied. Total rules applied 125 place count 112 transition count 110
Applied a total of 125 rules in 40 ms. Remains 112 /176 variables (removed 64) and now considering 110/171 (removed 61) transitions.
// Phase 1: matrix 110 rows 112 cols
[2024-05-25 14:51:44] [INFO ] Computed 29 invariants in 2 ms
[2024-05-25 14:51:44] [INFO ] Implicit Places using invariants in 242 ms returned [0, 9, 17, 20, 23, 36, 39, 50, 51, 61, 62, 64, 91, 92, 94]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 244 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/176 places, 110/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 97 transition count 105
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 92 transition count 105
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 92 transition count 100
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 87 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 85 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 85 transition count 98
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 60 place count 67 transition count 80
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 2 with 2 rules applied. Total rules applied 62 place count 66 transition count 79
Applied a total of 62 rules in 17 ms. Remains 66 /97 variables (removed 31) and now considering 79/110 (removed 31) transitions.
// Phase 1: matrix 79 rows 66 cols
[2024-05-25 14:51:44] [INFO ] Computed 14 invariants in 1 ms
[2024-05-25 14:51:44] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-25 14:51:44] [INFO ] Invariant cache hit.
[2024-05-25 14:51:45] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-25 14:51:45] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/176 places, 79/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 618 ms. Remains : 66/176 places, 79/171 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 309 ms.
Stack based approach found an accepted trace after 95 steps with 0 reset with depth 96 and stack size 96 in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-05 finished in 984 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 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 7 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-25 14:51:45] [INFO ] Computed 32 invariants in 3 ms
[2024-05-25 14:51:45] [INFO ] Implicit Places using invariants in 309 ms returned [16, 30, 35, 39, 62, 67, 88, 100, 101, 103, 144, 145, 147]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 310 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 320 ms. Remains : 162/176 places, 170/171 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-06
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-06 finished in 447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 5 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 3 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
[2024-05-25 14:51:45] [INFO ] Invariant cache hit.
[2024-05-25 14:51:46] [INFO ] Implicit Places using invariants in 186 ms returned [16, 30, 35, 39, 62, 67, 86, 88, 100, 101, 144, 145, 147]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 186 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 2 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2024-05-25 14:51:46] [INFO ] Computed 19 invariants in 2 ms
[2024-05-25 14:51:46] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-25 14:51:46] [INFO ] Invariant cache hit.
[2024-05-25 14:51:46] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-25 14:51:46] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 667 ms. Remains : 160/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 538 ms.
Product exploration explored 100000 steps with 33333 reset in 254 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-09 finished in 1662 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)||G((F(p1)&&F(G(p2)))))))'
Support contains 5 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 176 transition count 154
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 159 transition count 154
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 34 place count 159 transition count 145
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 52 place count 150 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 149 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 149 transition count 144
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 116 place count 117 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 116 place count 117 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 115 transition count 113
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 2 with 2 rules applied. Total rules applied 121 place count 114 transition count 112
Applied a total of 121 rules in 19 ms. Remains 114 /176 variables (removed 62) and now considering 112/171 (removed 59) transitions.
// Phase 1: matrix 112 rows 114 cols
[2024-05-25 14:51:47] [INFO ] Computed 29 invariants in 1 ms
[2024-05-25 14:51:47] [INFO ] Implicit Places using invariants in 143 ms returned [0, 9, 17, 20, 23, 36, 39, 50, 51, 61, 62, 64, 91]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 144 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/176 places, 112/171 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 101 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 98 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 98 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 93 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 91 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 91 transition count 102
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 46 place count 78 transition count 89
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 2 with 2 rules applied. Total rules applied 48 place count 77 transition count 88
Applied a total of 48 rules in 8 ms. Remains 77 /101 variables (removed 24) and now considering 88/112 (removed 24) transitions.
// Phase 1: matrix 88 rows 77 cols
[2024-05-25 14:51:47] [INFO ] Computed 16 invariants in 1 ms
[2024-05-25 14:51:47] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-25 14:51:47] [INFO ] Invariant cache hit.
[2024-05-25 14:51:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-25 14:51:48] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/176 places, 88/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 77/176 places, 88/171 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-10
Product exploration explored 100000 steps with 2247 reset in 131 ms.
Product exploration explored 100000 steps with 2250 reset in 253 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 155 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
[2024-05-25 14:51:48] [INFO ] Invariant cache hit.
[2024-05-25 14:51:48] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/56 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 57/113 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/144 variables, 58/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 21/165 variables, 21/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 8/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/165 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 51/165 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 5/15 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/77 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 214ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p2))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 20 factoid took 679 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-25 14:51:50] [INFO ] Invariant cache hit.
[2024-05-25 14:51:50] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-25 14:51:50] [INFO ] Invariant cache hit.
[2024-05-25 14:51:50] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-25 14:51:50] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-25 14:51:50] [INFO ] Redundant transitions in 3 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-25 14:51:50] [INFO ] Invariant cache hit.
[2024-05-25 14:51:50] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-25 14:51:51] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 3 ms to minimize.
[2024-05-25 14:51:51] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-25 14:51:51] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
[2024-05-25 14:51:51] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-25 14:51:51] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-25 14:51:51] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-25 14:51:51] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-25 14:51:51] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-25 14:51:51] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-25 14:51:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-25 14:51:51] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-05-25 14:51:51] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 2 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 4 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-25 14:51:52] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
[2024-05-25 14:51:53] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-25 14:51:53] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-25 14:51:53] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/165 variables, 77/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 58/183 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 183 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5836 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/165 variables, 77/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 58/183 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 87/270 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-25 14:51:57] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 2 ms to minimize.
[2024-05-25 14:51:57] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-25 14:51:58] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
[2024-05-25 14:51:58] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
[2024-05-25 14:51:58] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 275 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4443 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 37/37 constraints]
After SMT, in 10334ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 10338ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10769 ms. Remains : 77/77 places, 88/88 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 150 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
[2024-05-25 14:52:01] [INFO ] Invariant cache hit.
[2024-05-25 14:52:01] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/51 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/56 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 57/113 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/144 variables, 58/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 21/165 variables, 21/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 8/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/165 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 51/165 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 5/15 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/77 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p2))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 20 factoid took 600 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 2247 reset in 207 ms.
Product exploration explored 100000 steps with 2247 reset in 334 ms.
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-25 14:52:03] [INFO ] Invariant cache hit.
[2024-05-25 14:52:03] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-25 14:52:03] [INFO ] Invariant cache hit.
[2024-05-25 14:52:03] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-25 14:52:03] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-05-25 14:52:03] [INFO ] Redundant transitions in 3 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-25 14:52:03] [INFO ] Invariant cache hit.
[2024-05-25 14:52:03] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 14 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-25 14:52:04] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 2 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2024-05-25 14:52:05] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-25 14:52:06] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/165 variables, 77/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 58/183 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 183 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5646 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/165 variables, 77/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 58/183 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 87/270 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-25 14:52:10] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-25 14:52:10] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-25 14:52:11] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-25 14:52:11] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-25 14:52:11] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 275 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4842 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 37/37 constraints]
After SMT, in 10528ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 10531ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10962 ms. Remains : 77/77 places, 88/88 transitions.
Treatment of property ParamProductionCell-PT-0-LTLFireability-10 finished in 26593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (F(p1) U p2))&&X(X(G(!p1)))))'
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 5 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-25 14:52:14] [INFO ] Computed 32 invariants in 2 ms
[2024-05-25 14:52:14] [INFO ] Implicit Places using invariants in 265 ms returned [16, 30, 39, 67, 86, 88, 101, 103, 144, 145, 147]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 274 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 162 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 162 transition count 168
Applied a total of 4 rules in 5 ms. Remains 162 /164 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 162 cols
[2024-05-25 14:52:14] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 14:52:14] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-25 14:52:14] [INFO ] Invariant cache hit.
[2024-05-25 14:52:14] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-25 14:52:15] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 808 ms. Remains : 162/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p2) p1), (NOT p1), (NOT p2), p1, (AND (NOT p1) (NOT p0)), (NOT p2), p1, true]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-11
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-11 finished in 1134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)&&F(p2)&&p0))))'
Support contains 5 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 6 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-25 14:52:15] [INFO ] Computed 32 invariants in 1 ms
[2024-05-25 14:52:15] [INFO ] Implicit Places using invariants in 298 ms returned [16, 30, 35, 39, 62, 67, 86, 88, 100, 103, 144, 145, 147]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 299 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 4 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2024-05-25 14:52:15] [INFO ] Computed 19 invariants in 1 ms
[2024-05-25 14:52:15] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-25 14:52:15] [INFO ] Invariant cache hit.
[2024-05-25 14:52:16] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-25 14:52:16] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 952 ms. Remains : 160/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-12 finished in 1266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p1 U (G(!p1)||(!p1&&(F(!p0)||(!p2&&X(p1))))))))'
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 176 transition count 155
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 160 transition count 155
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 32 place count 160 transition count 144
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 54 place count 149 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 148 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 148 transition count 143
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 112 place count 119 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 112 place count 119 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 117 transition count 115
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 2 with 2 rules applied. Total rules applied 117 place count 116 transition count 114
Applied a total of 117 rules in 26 ms. Remains 116 /176 variables (removed 60) and now considering 114/171 (removed 57) transitions.
// Phase 1: matrix 114 rows 116 cols
[2024-05-25 14:52:16] [INFO ] Computed 29 invariants in 1 ms
[2024-05-25 14:52:16] [INFO ] Implicit Places using invariants in 258 ms returned [0, 9, 17, 20, 23, 36, 39, 52, 63, 64, 93, 94, 96]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 260 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/176 places, 114/171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 103 transition count 110
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 99 transition count 110
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 99 transition count 106
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 95 transition count 106
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 48 place count 79 transition count 90
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 2 with 2 rules applied. Total rules applied 50 place count 78 transition count 89
Applied a total of 50 rules in 16 ms. Remains 78 /103 variables (removed 25) and now considering 89/114 (removed 25) transitions.
// Phase 1: matrix 89 rows 78 cols
[2024-05-25 14:52:16] [INFO ] Computed 16 invariants in 1 ms
[2024-05-25 14:52:17] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-25 14:52:17] [INFO ] Invariant cache hit.
[2024-05-25 14:52:17] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-25 14:52:17] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/176 places, 89/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 683 ms. Remains : 78/176 places, 89/171 transitions.
Stuttering acceptance computed with spot in 272 ms :[true, p0, (AND p0 p1), p0, false, (AND p0 p1)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-14
Product exploration explored 100000 steps with 4344 reset in 347 ms.
Product exploration explored 100000 steps with 4351 reset in 457 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 156 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter insensitive) to 10 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 481 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
[2024-05-25 14:52:19] [INFO ] Invariant cache hit.
[2024-05-25 14:52:19] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 60/167 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 7/14 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/78 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p2) p1))), (F p2), (F (NOT (OR p0 p2 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 15 factoid took 723 ms. Reduced automaton from 10 states, 26 edges and 3 AP (stutter insensitive) to 12 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 663 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 662 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false, false, false]
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 89/89 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2024-05-25 14:52:21] [INFO ] Invariant cache hit.
[2024-05-25 14:52:21] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-25 14:52:21] [INFO ] Invariant cache hit.
[2024-05-25 14:52:21] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-25 14:52:21] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-05-25 14:52:21] [INFO ] Redundant transitions in 3 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-25 14:52:21] [INFO ] Invariant cache hit.
[2024-05-25 14:52:21] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:22] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-25 14:52:22] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 2 ms to minimize.
[2024-05-25 14:52:22] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-25 14:52:22] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-05-25 14:52:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-25 14:52:22] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-25 14:52:22] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-25 14:52:22] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-25 14:52:22] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-25 14:52:22] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-25 14:52:23] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-25 14:52:24] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:25] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:25] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:26] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 89/167 variables, 78/136 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 58/194 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/167 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 194 constraints, problems are : Problem set: 0 solved, 88 unsolved in 7676 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:29] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/167 variables, 78/137 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 58/195 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 88/283 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:32] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 284 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5840 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 44/44 constraints]
After SMT, in 13551ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 13555ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13965 ms. Remains : 78/78 places, 89/89 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 204 ms. Reduced automaton from 12 states, 32 edges and 3 AP (stutter insensitive) to 12 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 653 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 289 ms. (137 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
[2024-05-25 14:52:36] [INFO ] Invariant cache hit.
[2024-05-25 14:52:36] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 60/167 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 7/14 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/78 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F p2), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 25 factoid took 709 ms. Reduced automaton from 12 states, 32 edges and 3 AP (stutter insensitive) to 12 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 641 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 648 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 760 ms :[p0, false, false, (AND p0 p1), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 4344 reset in 253 ms.
Product exploration explored 100000 steps with 4336 reset in 282 ms.
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 89/89 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2024-05-25 14:52:39] [INFO ] Invariant cache hit.
[2024-05-25 14:52:40] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-25 14:52:40] [INFO ] Invariant cache hit.
[2024-05-25 14:52:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-25 14:52:40] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-05-25 14:52:40] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-25 14:52:40] [INFO ] Invariant cache hit.
[2024-05-25 14:52:40] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:40] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-25 14:52:40] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
[2024-05-25 14:52:40] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-25 14:52:40] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-25 14:52:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-25 14:52:40] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
[2024-05-25 14:52:40] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-25 14:52:40] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-25 14:52:40] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-25 14:52:40] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 3 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-25 14:52:41] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-25 14:52:42] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:43] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:43] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 89/167 variables, 78/136 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 58/194 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/167 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 194 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5978 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:46] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/167 variables, 78/137 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 58/195 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 88/283 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-25 14:52:48] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 284 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3953 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 44/44 constraints]
After SMT, in 9950ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 9952ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10222 ms. Remains : 78/78 places, 89/89 transitions.
Treatment of property ParamProductionCell-PT-0-LTLFireability-14 finished in 33567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (F(G(!p1))||G((X(p3)&&p2)))))'
Support contains 7 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 3 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-25 14:52:50] [INFO ] Computed 32 invariants in 1 ms
[2024-05-25 14:52:50] [INFO ] Implicit Places using invariants in 163 ms returned [16, 30, 35, 39, 62, 86, 88, 100, 101, 103, 144, 145]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 165 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 3 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2024-05-25 14:52:50] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 14:52:50] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-25 14:52:50] [INFO ] Invariant cache hit.
[2024-05-25 14:52:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-25 14:52:50] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 750 ms. Remains : 161/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND (NOT p0) p1), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p3))), p1, (OR (AND p0 p1 (NOT p2)) (AND p0 p1 (NOT p3)))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 182 ms.
Stack based approach found an accepted trace after 1758 steps with 0 reset with depth 1759 and stack size 1247 in 5 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-15 finished in 1229 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)||G((F(p1)&&F(G(p2)))))))'
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)||(!p1 U (G(!p1)||(!p1&&(F(!p0)||(!p2&&X(p1))))))))'
[2024-05-25 14:52:52] [INFO ] Flatten gal took : 26 ms
[2024-05-25 14:52:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-25 14:52:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 176 places, 171 transitions and 637 arcs took 16 ms.
Total runtime 78520 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ParamProductionCell-PT-0

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 2074
MODEL NAME: /home/mcc/execution/416/model
176 places, 171 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ParamProductionCell-PT-0-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ParamProductionCell-PT-0-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716648917731

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ParamProductionCell-PT-0"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ParamProductionCell-PT-0, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-171654405500012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-0.tgz
mv ParamProductionCell-PT-0 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;