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.r508-tall-171654351200236.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MultiwaySync-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351200236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 18:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 111K 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 MultiwaySync-PT-none-LTLFireability-00
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-01
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-02
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-03
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-04
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-05
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-06
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-07
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-08
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-09
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-10
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-11
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-12
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-13
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-14
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717235208085

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiwaySync-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:46:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:46:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:46:49] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-01 09:46:49] [INFO ] Transformed 222 places.
[2024-06-01 09:46:49] [INFO ] Transformed 472 transitions.
[2024-06-01 09:46:49] [INFO ] Found NUPN structural information;
[2024-06-01 09:46:49] [INFO ] Parsed PT model containing 222 places and 472 transitions and 1496 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 83 transitions
Reduce redundant transitions removed 83 transitions.
FORMULA MultiwaySync-PT-none-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 389/389 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 378
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 211 transition count 372
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 208 transition count 363
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 208 transition count 363
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 208 transition count 361
Applied a total of 36 rules in 54 ms. Remains 208 /222 variables (removed 14) and now considering 361/389 (removed 28) transitions.
[2024-06-01 09:46:49] [INFO ] Flow matrix only has 356 transitions (discarded 5 similar events)
// Phase 1: matrix 356 rows 208 cols
[2024-06-01 09:46:49] [INFO ] Computed 25 invariants in 20 ms
[2024-06-01 09:46:50] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-01 09:46:50] [INFO ] Flow matrix only has 356 transitions (discarded 5 similar events)
[2024-06-01 09:46:50] [INFO ] Invariant cache hit.
[2024-06-01 09:46:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:46:50] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-06-01 09:46:50] [INFO ] Flow matrix only has 356 transitions (discarded 5 similar events)
[2024-06-01 09:46:50] [INFO ] Invariant cache hit.
[2024-06-01 09:46:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-01 09:46:54] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 9 ms to minimize.
[2024-06-01 09:46:54] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-06-01 09:46:54] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:46:54] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:46:54] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:46:55] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:46:55] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:46:55] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 356/564 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/564 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 242 constraints, problems are : Problem set: 0 solved, 360 unsolved in 14866 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 208/208 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 356/564 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 360/602 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-01 09:47:13] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:47:14] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (OVERLAPS) 0/564 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 604 constraints, problems are : Problem set: 0 solved, 360 unsolved in 26525 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 208/208 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 10/10 constraints]
After SMT, in 41980ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 42112ms
Starting structural reductions in LTL mode, iteration 1 : 208/222 places, 361/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42648 ms. Remains : 208/222 places, 361/389 transitions.
Support contains 38 out of 208 places after structural reductions.
[2024-06-01 09:47:32] [INFO ] Flatten gal took : 57 ms
[2024-06-01 09:47:32] [INFO ] Flatten gal took : 26 ms
[2024-06-01 09:47:32] [INFO ] Input system was already deterministic with 361 transitions.
Support contains 37 out of 208 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1381 ms. (28 steps per ms) remains 2/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/2 properties
BEST_FIRST walk for 9979 steps (2 resets) in 20 ms. (475 steps per ms) remains 0/1 properties
FORMULA MultiwaySync-PT-none-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 11 stabilizing places and 17 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' '!(X((p0&&X((p1 U (G(p1)||(F(!p1)&&p2)))))))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 349
Applied a total of 10 rules in 21 ms. Remains 204 /208 variables (removed 4) and now considering 349/361 (removed 12) transitions.
[2024-06-01 09:47:33] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-06-01 09:47:33] [INFO ] Computed 25 invariants in 6 ms
[2024-06-01 09:47:33] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 09:47:33] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:47:33] [INFO ] Invariant cache hit.
[2024-06-01 09:47:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:47:34] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 09:47:34] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:47:34] [INFO ] Invariant cache hit.
[2024-06-01 09:47:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:47:36] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:47:36] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:47:37] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:47:37] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:47:37] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:47:37] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:47:37] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:47:37] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12719 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:47:54] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:47:54] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25641 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 38717ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 38721ms
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38999 ms. Remains : 204/208 places, 349/361 transitions.
Stuttering acceptance computed with spot in 301 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-00 finished in 39383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 207 transition count 359
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 206 transition count 359
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 203 transition count 352
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 203 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 203 transition count 351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 202 transition count 348
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 202 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 202 transition count 347
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 60 place count 178 transition count 323
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 177 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 177 transition count 318
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 80 place count 171 transition count 312
Applied a total of 80 rules in 66 ms. Remains 171 /208 variables (removed 37) and now considering 312/361 (removed 49) transitions.
[2024-06-01 09:48:13] [INFO ] Flow matrix only has 307 transitions (discarded 5 similar events)
// Phase 1: matrix 307 rows 171 cols
[2024-06-01 09:48:13] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 09:48:13] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 09:48:13] [INFO ] Flow matrix only has 307 transitions (discarded 5 similar events)
[2024-06-01 09:48:13] [INFO ] Invariant cache hit.
[2024-06-01 09:48:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:48:13] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-06-01 09:48:13] [INFO ] Redundant transitions in 14 ms returned []
Running 285 sub problems to find dead transitions.
[2024-06-01 09:48:13] [INFO ] Flow matrix only has 307 transitions (discarded 5 similar events)
[2024-06-01 09:48:13] [INFO ] Invariant cache hit.
[2024-06-01 09:48:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-01 09:48:14] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:48:14] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:48:14] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:48:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:48:15] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:48:15] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:48:15] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:48:15] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 1/171 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 307/478 variables, 171/204 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 0/478 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 205 constraints, problems are : Problem set: 0 solved, 285 unsolved in 9897 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 171/171 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 1/171 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 307/478 variables, 171/204 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 285/490 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-06-01 09:48:28] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (OVERLAPS) 0/478 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 491 constraints, problems are : Problem set: 0 solved, 285 unsolved in 17229 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 171/171 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 9/9 constraints]
After SMT, in 27479ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 27482ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/208 places, 312/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27776 ms. Remains : 171/208 places, 312/361 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 484 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-01 finished in 28415 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(p1)&&p0))&&X(p2)))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 206 transition count 357
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 206 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 206 transition count 356
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 205 transition count 353
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Applied a total of 7 rules in 9 ms. Remains 205 /208 variables (removed 3) and now considering 353/361 (removed 8) transitions.
[2024-06-01 09:48:41] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
// Phase 1: matrix 348 rows 205 cols
[2024-06-01 09:48:41] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 09:48:41] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 09:48:41] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2024-06-01 09:48:41] [INFO ] Invariant cache hit.
[2024-06-01 09:48:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:48:41] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 352 sub problems to find dead transitions.
[2024-06-01 09:48:41] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2024-06-01 09:48:41] [INFO ] Invariant cache hit.
[2024-06-01 09:48:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-06-01 09:48:44] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:48:44] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:48:45] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
[2024-06-01 09:48:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:48:45] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:48:45] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
[2024-06-01 09:48:45] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:48:45] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (OVERLAPS) 0/553 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 239 constraints, problems are : Problem set: 0 solved, 352 unsolved in 12745 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 352/591 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-06-01 09:49:01] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-06-01 09:49:07] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 10 (OVERLAPS) 0/553 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 593 constraints, problems are : Problem set: 0 solved, 352 unsolved in 27853 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 10/10 constraints]
After SMT, in 40896ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 40907ms
Starting structural reductions in LTL mode, iteration 1 : 205/208 places, 353/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41245 ms. Remains : 205/208 places, 353/361 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-02 finished in 41455 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(F((X(p1)||p0))))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 349
Applied a total of 10 rules in 14 ms. Remains 204 /208 variables (removed 4) and now considering 349/361 (removed 12) transitions.
[2024-06-01 09:49:22] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-06-01 09:49:22] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 09:49:23] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 09:49:23] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:49:23] [INFO ] Invariant cache hit.
[2024-06-01 09:49:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:49:23] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 09:49:23] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:49:23] [INFO ] Invariant cache hit.
[2024-06-01 09:49:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:49:25] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:49:26] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:49:26] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:49:26] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:49:26] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:49:26] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:49:26] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:49:27] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12178 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:49:42] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:49:43] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25158 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 37644ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 37647ms
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37898 ms. Remains : 204/208 places, 349/361 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-04
Product exploration explored 100000 steps with 3493 reset in 333 ms.
Stack based approach found an accepted trace after 547 steps with 17 reset with depth 22 and stack size 22 in 3 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-04 finished in 38443 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 p1)||X((p2&&F(p3)&&X(G(p4))))))'
Support contains 7 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 349
Applied a total of 10 rules in 12 ms. Remains 204 /208 variables (removed 4) and now considering 349/361 (removed 12) transitions.
[2024-06-01 09:50:01] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:50:01] [INFO ] Invariant cache hit.
[2024-06-01 09:50:01] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 09:50:01] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:50:01] [INFO ] Invariant cache hit.
[2024-06-01 09:50:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:50:01] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 09:50:01] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:50:01] [INFO ] Invariant cache hit.
[2024-06-01 09:50:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:50:04] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:50:05] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:50:05] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:50:05] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:50:05] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12417 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:50:21] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
[2024-06-01 09:50:22] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25796 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 38543ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 38547ms
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38798 ms. Remains : 204/208 places, 349/361 transitions.
Stuttering acceptance computed with spot in 527 ms :[true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4))), (OR (NOT p4) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (NOT p4) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p4), (AND (NOT p4) (NOT p0)), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-06 finished in 39357 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 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 207 transition count 358
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 204 transition count 358
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 205 edges and 204 vertex of which 108 / 204 are part of one of the 32 SCC in 2 ms
Free SCC test removed 76 places
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 80 rules applied. Total rules applied 85 place count 128 transition count 279
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 1 with 144 rules applied. Total rules applied 229 place count 97 transition count 166
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 244 place count 82 transition count 135
Iterating global reduction 2 with 15 rules applied. Total rules applied 259 place count 82 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 260 place count 82 transition count 134
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 267 place count 75 transition count 112
Iterating global reduction 3 with 7 rules applied. Total rules applied 274 place count 75 transition count 112
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 281 place count 75 transition count 105
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 303 place count 64 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 305 place count 63 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 317 place count 63 transition count 82
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 329 place count 57 transition count 76
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 334 place count 52 transition count 62
Iterating global reduction 4 with 5 rules applied. Total rules applied 339 place count 52 transition count 62
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 344 place count 52 transition count 57
Applied a total of 344 rules in 36 ms. Remains 52 /208 variables (removed 156) and now considering 57/361 (removed 304) transitions.
// Phase 1: matrix 57 rows 52 cols
[2024-06-01 09:50:40] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 09:50:40] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 09:50:40] [INFO ] Invariant cache hit.
[2024-06-01 09:50:40] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-06-01 09:50:40] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-01 09:50:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 56/106 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 2/108 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/109 variables, and 62 constraints, problems are : Problem set: 0 solved, 43 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 56/106 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 2/108 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/108 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/109 variables, and 105 constraints, problems are : Problem set: 0 solved, 43 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1488ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1492ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/208 places, 57/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1644 ms. Remains : 52/208 places, 57/361 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-07 finished in 1689 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))||G(p2))))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 207 transition count 358
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 204 transition count 358
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 201 edges and 204 vertex of which 102 / 204 are part of one of the 30 SCC in 1 ms
Free SCC test removed 72 places
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 80 rules applied. Total rules applied 85 place count 132 transition count 279
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 1 with 136 rules applied. Total rules applied 221 place count 103 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 221 place count 103 transition count 170
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 225 place count 101 transition count 170
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 240 place count 86 transition count 139
Iterating global reduction 2 with 15 rules applied. Total rules applied 255 place count 86 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 86 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 262 place count 80 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 268 place count 80 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 274 place count 80 transition count 112
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 296 place count 69 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 298 place count 68 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 310 place count 68 transition count 89
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 322 place count 62 transition count 83
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 328 place count 56 transition count 63
Iterating global reduction 4 with 6 rules applied. Total rules applied 334 place count 56 transition count 63
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 340 place count 56 transition count 57
Applied a total of 340 rules in 46 ms. Remains 56 /208 variables (removed 152) and now considering 57/361 (removed 304) transitions.
// Phase 1: matrix 57 rows 56 cols
[2024-06-01 09:50:42] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 09:50:42] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 09:50:42] [INFO ] Invariant cache hit.
[2024-06-01 09:50:42] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-01 09:50:42] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-06-01 09:50:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 7/54 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 56/110 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 2/112 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/113 variables, and 68 constraints, problems are : Problem set: 0 solved, 41 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 7/54 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 56/110 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 41/107 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 2/112 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/112 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/113 variables, and 109 constraints, problems are : Problem set: 0 solved, 41 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 1157ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1158ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/208 places, 57/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1303 ms. Remains : 56/208 places, 57/361 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-08 finished in 1440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G((p1||F(p2)))))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 349
Applied a total of 10 rules in 14 ms. Remains 204 /208 variables (removed 4) and now considering 349/361 (removed 12) transitions.
[2024-06-01 09:50:43] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-06-01 09:50:43] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 09:50:44] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 09:50:44] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:50:44] [INFO ] Invariant cache hit.
[2024-06-01 09:50:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:50:44] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 09:50:44] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:50:44] [INFO ] Invariant cache hit.
[2024-06-01 09:50:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:50:47] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:50:47] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:50:47] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:50:47] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:50:48] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
[2024-06-01 09:50:48] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:50:48] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:50:48] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12386 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:51:03] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:51:04] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 23834 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 36619ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 36622ms
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37202 ms. Remains : 204/208 places, 349/361 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 307 ms.
Product exploration explored 100000 steps with 0 reset in 404 ms.
Computed a total of 11 stabilizing places and 17 stable transitions
Computed a total of 11 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 428 ms. (93 steps per ms) remains 1/3 properties
BEST_FIRST walk for 10850 steps (1 resets) in 14 ms. (723 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 5 factoid took 371 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 2 out of 204 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 349/349 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 203 transition count 346
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 200 transition count 346
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 197 edges and 200 vertex of which 103 / 200 are part of one of the 31 SCC in 0 ms
Free SCC test removed 72 places
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 80 rules applied. Total rules applied 85 place count 128 transition count 267
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 139 rules applied. Total rules applied 224 place count 97 transition count 159
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 227 place count 95 transition count 158
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 238 place count 84 transition count 136
Iterating global reduction 3 with 11 rules applied. Total rules applied 249 place count 84 transition count 136
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 79 transition count 123
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 79 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 263 place count 79 transition count 119
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 285 place count 68 transition count 108
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 4 with 2 rules applied. Total rules applied 287 place count 67 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 300 place count 67 transition count 96
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 312 place count 61 transition count 90
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 318 place count 55 transition count 70
Iterating global reduction 4 with 6 rules applied. Total rules applied 324 place count 55 transition count 70
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 329 place count 55 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 330 place count 55 transition count 64
Applied a total of 330 rules in 20 ms. Remains 55 /204 variables (removed 149) and now considering 64/349 (removed 285) transitions.
// Phase 1: matrix 64 rows 55 cols
[2024-06-01 09:51:23] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 09:51:23] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 09:51:23] [INFO ] Invariant cache hit.
[2024-06-01 09:51:23] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-06-01 09:51:23] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 09:51:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 5/53 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 09:51:23] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 63/116 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 2/118 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/118 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/119 variables, and 66 constraints, problems are : Problem set: 0 solved, 48 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 5/53 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 63/116 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 2/118 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/119 variables, and 114 constraints, problems are : Problem set: 0 solved, 48 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
After SMT, in 1584ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1585ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/204 places, 64/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1764 ms. Remains : 55/204 places, 64/349 transitions.
Computed a total of 8 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 511 steps (16 resets) in 13 ms. (36 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 218 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 50 ms.
Product exploration explored 100000 steps with 0 reset in 51 ms.
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 64/64 transitions.
Graph (trivial) has 11 edges and 55 vertex of which 2 / 55 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 53 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 52 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 52 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 52 transition count 53
Applied a total of 7 rules in 4 ms. Remains 52 /55 variables (removed 3) and now considering 53/64 (removed 11) transitions.
// Phase 1: matrix 53 rows 52 cols
[2024-06-01 09:51:25] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 09:51:25] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 09:51:25] [INFO ] Invariant cache hit.
[2024-06-01 09:51:25] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-06-01 09:51:25] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-06-01 09:51:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 52/102 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 2/104 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/105 variables, and 62 constraints, problems are : Problem set: 0 solved, 38 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 52/102 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 38/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 2/104 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/105 variables, and 100 constraints, problems are : Problem set: 0 solved, 38 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 1156ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1156ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/55 places, 53/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1324 ms. Remains : 52/55 places, 53/64 transitions.
Treatment of property MultiwaySync-PT-none-LTLFireability-09 finished in 43110 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((X(G(p0))||(p0 U (p1||G(p0))))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 206 transition count 357
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 206 transition count 357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 205 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Applied a total of 7 rules in 7 ms. Remains 205 /208 variables (removed 3) and now considering 353/361 (removed 8) transitions.
[2024-06-01 09:51:27] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
// Phase 1: matrix 348 rows 205 cols
[2024-06-01 09:51:27] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 09:51:27] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 09:51:27] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2024-06-01 09:51:27] [INFO ] Invariant cache hit.
[2024-06-01 09:51:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:51:27] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 352 sub problems to find dead transitions.
[2024-06-01 09:51:27] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2024-06-01 09:51:27] [INFO ] Invariant cache hit.
[2024-06-01 09:51:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-06-01 09:51:30] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:51:30] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:51:30] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:51:30] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:51:30] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:51:30] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:51:31] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:51:31] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (OVERLAPS) 0/553 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 239 constraints, problems are : Problem set: 0 solved, 352 unsolved in 12319 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 352/591 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-06-01 09:51:47] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 9 (OVERLAPS) 0/553 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 592 constraints, problems are : Problem set: 0 solved, 352 unsolved in 23092 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 9/9 constraints]
After SMT, in 35717ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 35721ms
Starting structural reductions in LTL mode, iteration 1 : 205/208 places, 353/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35969 ms. Remains : 205/208 places, 353/361 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-10
Entered a terminal (fully accepting) state of product in 298 steps with 0 reset in 2 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-10 finished in 36156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 207 transition count 359
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 359
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 207 edges and 205 vertex of which 108 / 205 are part of one of the 32 SCC in 0 ms
Free SCC test removed 76 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 81 rules applied. Total rules applied 84 place count 129 transition count 279
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 1 with 145 rules applied. Total rules applied 229 place count 97 transition count 166
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 243 place count 83 transition count 136
Iterating global reduction 2 with 14 rules applied. Total rules applied 257 place count 83 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 258 place count 83 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 264 place count 77 transition count 115
Iterating global reduction 3 with 6 rules applied. Total rules applied 270 place count 77 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 276 place count 77 transition count 109
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 300 place count 65 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 302 place count 64 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 314 place count 64 transition count 85
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 326 place count 58 transition count 79
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 332 place count 52 transition count 58
Iterating global reduction 4 with 6 rules applied. Total rules applied 338 place count 52 transition count 58
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 344 place count 52 transition count 52
Applied a total of 344 rules in 17 ms. Remains 52 /208 variables (removed 156) and now considering 52/361 (removed 309) transitions.
// Phase 1: matrix 52 rows 52 cols
[2024-06-01 09:52:03] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 09:52:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 09:52:03] [INFO ] Invariant cache hit.
[2024-06-01 09:52:03] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-01 09:52:03] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 09:52:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 51/101 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 2/103 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 62 constraints, problems are : Problem set: 0 solved, 39 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 51/101 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 39/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 2/103 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 101 constraints, problems are : Problem set: 0 solved, 39 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 1087ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1087ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/208 places, 52/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1198 ms. Remains : 52/208 places, 52/361 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-11 finished in 1262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F(G(F(p0)))))'
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 349
Applied a total of 10 rules in 9 ms. Remains 204 /208 variables (removed 4) and now considering 349/361 (removed 12) transitions.
[2024-06-01 09:52:04] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-06-01 09:52:04] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 09:52:04] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 09:52:04] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:52:04] [INFO ] Invariant cache hit.
[2024-06-01 09:52:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:52:04] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 09:52:04] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:52:04] [INFO ] Invariant cache hit.
[2024-06-01 09:52:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:52:07] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:52:07] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:52:07] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:52:07] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:52:08] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:52:08] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:52:08] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:52:08] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12364 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:52:24] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:52:24] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25112 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 37742ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 37745ms
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37982 ms. Remains : 204/208 places, 349/361 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-12 finished in 38248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 349
Applied a total of 10 rules in 11 ms. Remains 204 /208 variables (removed 4) and now considering 349/361 (removed 12) transitions.
[2024-06-01 09:52:42] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:52:42] [INFO ] Invariant cache hit.
[2024-06-01 09:52:42] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 09:52:42] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:52:42] [INFO ] Invariant cache hit.
[2024-06-01 09:52:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:52:42] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 09:52:42] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:52:42] [INFO ] Invariant cache hit.
[2024-06-01 09:52:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:52:45] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:52:45] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:52:46] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:52:46] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:52:46] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:52:46] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:52:46] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:52:46] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12959 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:53:03] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:53:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25640 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 38857ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 38860ms
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39105 ms. Remains : 204/208 places, 349/361 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-15
Entered a terminal (fully accepting) state of product in 84 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-15 finished in 39278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G((p1||F(p2)))))))'
[2024-06-01 09:53:22] [INFO ] Flatten gal took : 23 ms
[2024-06-01 09:53:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 09:53:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 208 places, 361 transitions and 1192 arcs took 4 ms.
Total runtime 392814 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MultiwaySync-PT-none-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717235786577

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name MultiwaySync-PT-none-LTLFireability-09
ltl formula formula --ltl=/tmp/1398/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 208 places, 361 transitions and 1192 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1398/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1398/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1398/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1398/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 210 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 209, there are 381 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~139800 transitions
pnml2lts-mc( 1/ 4): ~4994 levels ~20000 states ~251488 transitions
pnml2lts-mc( 1/ 4): ~9977 levels ~40000 states ~477036 transitions
pnml2lts-mc( 1/ 4): ~19930 levels ~80000 states ~943036 transitions
pnml2lts-mc( 1/ 4): ~39798 levels ~160000 states ~1899156 transitions
pnml2lts-mc( 1/ 4): ~79604 levels ~320000 states ~3881352 transitions
pnml2lts-mc( 1/ 4): ~159052 levels ~640000 states ~7888816 transitions
pnml2lts-mc( 1/ 4): ~317836 levels ~1280000 states ~16116208 transitions
pnml2lts-mc( 0/ 4): ~639934 levels ~2560000 states ~35606468 transitions
pnml2lts-mc( 0/ 4): ~1279706 levels ~5120000 states ~71156244 transitions
pnml2lts-mc( 0/ 4): ~2558097 levels ~10240000 states ~143138236 transitions
pnml2lts-mc( 1/ 4): ~5051322 levels ~20480000 states ~287087736 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 22326460
pnml2lts-mc( 0/ 4): unique transitions count: 312654206
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 165847001
pnml2lts-mc( 0/ 4): - claim success count: 22326466
pnml2lts-mc( 0/ 4): - cum. max stack depth: 22170309
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22326466 states 312654293 transitions, fanout: 14.004
pnml2lts-mc( 0/ 4): Total exploration time 183.620 sec (183.600 sec minimum, 183.610 sec on average)
pnml2lts-mc( 0/ 4): States per second: 121591, Transitions per second: 1702725
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 271.3MB, 8.5 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/23.0%
pnml2lts-mc( 0/ 4): Stored 364 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 271.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MultiwaySync-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654351200236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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