Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r263-smll-167863537600004.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r263-smll-167863537600004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.4K Feb 25 22:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 22:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 22:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 22:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 111K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1678706263959

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiwaySync-PT-none
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 11:17:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 11:17:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:17:47] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-13 11:17:48] [INFO ] Transformed 222 places.
[2023-03-13 11:17:48] [INFO ] Transformed 472 transitions.
[2023-03-13 11:17:48] [INFO ] Found NUPN structural information;
[2023-03-13 11:17:48] [INFO ] Parsed PT model containing 222 places and 472 transitions and 1496 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 83 transitions
Reduce redundant transitions removed 83 transitions.
FORMULA MultiwaySync-PT-none-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 389/389 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 210 transition count 377
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 210 transition count 377
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 210 transition count 371
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 208 transition count 365
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 208 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 208 transition count 364
Applied a total of 35 rules in 66 ms. Remains 208 /222 variables (removed 14) and now considering 364/389 (removed 25) transitions.
[2023-03-13 11:17:48] [INFO ] Flow matrix only has 359 transitions (discarded 5 similar events)
// Phase 1: matrix 359 rows 208 cols
[2023-03-13 11:17:48] [INFO ] Computed 25 place invariants in 25 ms
[2023-03-13 11:17:48] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-13 11:17:48] [INFO ] Flow matrix only has 359 transitions (discarded 5 similar events)
[2023-03-13 11:17:48] [INFO ] Invariant cache hit.
[2023-03-13 11:17:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:17:49] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
[2023-03-13 11:17:49] [INFO ] Flow matrix only has 359 transitions (discarded 5 similar events)
[2023-03-13 11:17:49] [INFO ] Invariant cache hit.
[2023-03-13 11:17:49] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/222 places, 364/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1469 ms. Remains : 208/222 places, 364/389 transitions.
Support contains 39 out of 208 places after structural reductions.
[2023-03-13 11:17:50] [INFO ] Flatten gal took : 126 ms
[2023-03-13 11:17:50] [INFO ] Flatten gal took : 64 ms
[2023-03-13 11:17:50] [INFO ] Input system was already deterministic with 364 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 933 ms. (steps per millisecond=10 ) properties (out of 35) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-13 11:17:51] [INFO ] Flow matrix only has 359 transitions (discarded 5 similar events)
[2023-03-13 11:17:51] [INFO ] Invariant cache hit.
[2023-03-13 11:17:51] [INFO ] [Real]Absence check using 25 positive place invariants in 9 ms returned sat
[2023-03-13 11:17:52] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-13 11:17:52] [INFO ] [Nat]Absence check using 25 positive place invariants in 14 ms returned sat
[2023-03-13 11:17:53] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-13 11:17:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:17:53] [INFO ] After 222ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-13 11:17:53] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 9 ms to minimize.
[2023-03-13 11:17:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-13 11:17:53] [INFO ] After 655ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 222 ms.
[2023-03-13 11:17:53] [INFO ] After 1520ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 10 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 364/364 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 208 transition count 363
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 207 transition count 363
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 204 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 204 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 204 transition count 352
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 1 with 50 rules applied. Total rules applied 60 place count 179 transition count 327
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 175 transition count 355
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 101 place count 175 transition count 322
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 107 place count 172 transition count 319
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 118 place count 172 transition count 308
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 129 place count 161 transition count 308
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 146 place count 161 transition count 308
Applied a total of 146 rules in 120 ms. Remains 161 /208 variables (removed 47) and now considering 308/364 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 161/208 places, 308/364 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 11:17:54] [INFO ] Flow matrix only has 289 transitions (discarded 19 similar events)
// Phase 1: matrix 289 rows 161 cols
[2023-03-13 11:17:54] [INFO ] Computed 25 place invariants in 5 ms
[2023-03-13 11:17:54] [INFO ] [Real]Absence check using 25 positive place invariants in 14 ms returned sat
[2023-03-13 11:17:55] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 11:17:55] [INFO ] [Nat]Absence check using 25 positive place invariants in 13 ms returned sat
[2023-03-13 11:17:55] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 11:17:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:17:55] [INFO ] After 146ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 11:17:55] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-13 11:17:56] [INFO ] After 957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 22 ms.
Support contains 9 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 308/308 transitions.
Applied a total of 0 rules in 18 ms. Remains 161 /161 variables (removed 0) and now considering 308/308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 161/161 places, 308/308 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 264294 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{0=1}
Probabilistic random walk after 264294 steps, saw 138910 distinct states, run finished after 3003 ms. (steps per millisecond=88 ) properties seen :1
Running SMT prover for 4 properties.
[2023-03-13 11:17:59] [INFO ] Flow matrix only has 289 transitions (discarded 19 similar events)
[2023-03-13 11:17:59] [INFO ] Invariant cache hit.
[2023-03-13 11:17:59] [INFO ] [Real]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-13 11:18:00] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 11:18:00] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-13 11:18:00] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 11:18:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:00] [INFO ] After 90ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 11:18:00] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-13 11:18:00] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 30 ms.
Support contains 8 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 308/308 transitions.
Applied a total of 0 rules in 14 ms. Remains 161 /161 variables (removed 0) and now considering 308/308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 161/161 places, 308/308 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 11:18:01] [INFO ] Flow matrix only has 289 transitions (discarded 19 similar events)
[2023-03-13 11:18:01] [INFO ] Invariant cache hit.
[2023-03-13 11:18:01] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2023-03-13 11:18:01] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 11:18:01] [INFO ] [Nat]Absence check using 25 positive place invariants in 16 ms returned sat
[2023-03-13 11:18:01] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 11:18:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:01] [INFO ] After 98ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 11:18:01] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-13 11:18:02] [INFO ] After 648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 7 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 308/308 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 160 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 160 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 160 transition count 304
Applied a total of 3 rules in 33 ms. Remains 160 /161 variables (removed 1) and now considering 304/308 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 160/161 places, 304/308 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 11:18:02] [INFO ] Flow matrix only has 285 transitions (discarded 19 similar events)
// Phase 1: matrix 285 rows 160 cols
[2023-03-13 11:18:02] [INFO ] Computed 25 place invariants in 4 ms
[2023-03-13 11:18:02] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-13 11:18:02] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 11:18:02] [INFO ] [Nat]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-13 11:18:02] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:02] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:02] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-13 11:18:02] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 304/304 transitions.
Applied a total of 0 rules in 17 ms. Remains 160 /160 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 160/160 places, 304/304 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 990718 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 990718 steps, saw 428452 distinct states, run finished after 3004 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 11:18:06] [INFO ] Flow matrix only has 285 transitions (discarded 19 similar events)
[2023-03-13 11:18:06] [INFO ] Invariant cache hit.
[2023-03-13 11:18:06] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2023-03-13 11:18:06] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 11:18:06] [INFO ] [Nat]Absence check using 25 positive place invariants in 10 ms returned sat
[2023-03-13 11:18:06] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:06] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:06] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-13 11:18:06] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 304/304 transitions.
Applied a total of 0 rules in 18 ms. Remains 160 /160 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 160/160 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 304/304 transitions.
Applied a total of 0 rules in 15 ms. Remains 160 /160 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2023-03-13 11:18:06] [INFO ] Flow matrix only has 285 transitions (discarded 19 similar events)
[2023-03-13 11:18:06] [INFO ] Invariant cache hit.
[2023-03-13 11:18:06] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-13 11:18:06] [INFO ] Flow matrix only has 285 transitions (discarded 19 similar events)
[2023-03-13 11:18:06] [INFO ] Invariant cache hit.
[2023-03-13 11:18:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:07] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2023-03-13 11:18:07] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-13 11:18:07] [INFO ] Flow matrix only has 285 transitions (discarded 19 similar events)
[2023-03-13 11:18:07] [INFO ] Invariant cache hit.
[2023-03-13 11:18:07] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1026 ms. Remains : 160/160 places, 304/304 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 160 transition count 285
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 1 with 12 rules applied. Total rules applied 31 place count 154 transition count 279
Applied a total of 31 rules in 26 ms. Remains 154 /160 variables (removed 6) and now considering 279/304 (removed 25) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 279 rows 154 cols
[2023-03-13 11:18:07] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-13 11:18:07] [INFO ] [Real]Absence check using 25 positive place invariants in 13 ms returned sat
[2023-03-13 11:18:08] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 11:18:08] [INFO ] [Nat]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-13 11:18:08] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:08] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2023-03-13 11:18:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-13 11:18:08] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-13 11:18:08] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((!p1&&F(p2))))))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 364/364 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 204 transition count 352
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 204 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 204 transition count 349
Applied a total of 11 rules in 14 ms. Remains 204 /208 variables (removed 4) and now considering 349/364 (removed 15) transitions.
[2023-03-13 11:18:09] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2023-03-13 11:18:09] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-13 11:18:09] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-13 11:18:09] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2023-03-13 11:18:09] [INFO ] Invariant cache hit.
[2023-03-13 11:18:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:09] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-13 11:18:09] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2023-03-13 11:18:09] [INFO ] Invariant cache hit.
[2023-03-13 11:18:09] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 900 ms. Remains : 204/208 places, 349/364 transitions.
Stuttering acceptance computed with spot in 511 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s95 1) (EQ s202 1)) (EQ s48 1)), p0:(AND (EQ s68 1) (EQ s202 1)), p2:(EQ s146 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-00 finished in 1512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 364/364 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 361
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 361
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 3 ms
Free SCC test removed 76 places
Drop transitions 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 86 place count 128 transition count 281
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 231 place count 96 transition count 168
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 247 place count 80 transition count 132
Iterating global reduction 2 with 16 rules applied. Total rules applied 263 place count 80 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 266 place count 80 transition count 129
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 271 place count 75 transition count 116
Iterating global reduction 3 with 5 rules applied. Total rules applied 276 place count 75 transition count 116
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 281 place count 75 transition count 111
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 303 place count 64 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 305 place count 63 transition count 101
Drop 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 89
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 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 83
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 335 place count 51 transition count 63
Iterating global reduction 4 with 6 rules applied. Total rules applied 341 place count 51 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 347 place count 51 transition count 57
Applied a total of 347 rules in 48 ms. Remains 51 /208 variables (removed 157) and now considering 57/364 (removed 307) transitions.
// Phase 1: matrix 57 rows 51 cols
[2023-03-13 11:18:10] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-13 11:18:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-13 11:18:10] [INFO ] Invariant cache hit.
[2023-03-13 11:18:10] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-13 11:18:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-13 11:18:10] [INFO ] Invariant cache hit.
[2023-03-13 11:18:10] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/208 places, 57/364 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 51/208 places, 57/364 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s37 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-01 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U p2)||(!p3 U (G(!p3)||(!p3&&G(!p4))))||p0)))'
Support contains 7 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 364/364 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 206 transition count 358
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 206 transition count 358
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 357
Applied a total of 5 rules in 12 ms. Remains 206 /208 variables (removed 2) and now considering 357/364 (removed 7) transitions.
[2023-03-13 11:18:10] [INFO ] Flow matrix only has 352 transitions (discarded 5 similar events)
// Phase 1: matrix 352 rows 206 cols
[2023-03-13 11:18:10] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-13 11:18:11] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-13 11:18:11] [INFO ] Flow matrix only has 352 transitions (discarded 5 similar events)
[2023-03-13 11:18:11] [INFO ] Invariant cache hit.
[2023-03-13 11:18:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:11] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-13 11:18:11] [INFO ] Flow matrix only has 352 transitions (discarded 5 similar events)
[2023-03-13 11:18:11] [INFO ] Invariant cache hit.
[2023-03-13 11:18:11] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/208 places, 357/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 802 ms. Remains : 206/208 places, 357/364 transitions.
Stuttering acceptance computed with spot in 552 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2) p3), p3, (AND (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (AND p3 p4), (AND (NOT p2) p3 p4), p4, (AND (NOT p2) p4)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=p3, acceptance={} source=3 dest: 0}, { cond=(AND p4 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p4 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p4 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p4) (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p4 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1 p4 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p4) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND p4 p3), acceptance={} source=6 dest: 0}, { cond=(AND p4 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p4) p3), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) p4 p3), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) p1 p4 p3), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p4 (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 p4 (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p4) (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p4) p3), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p2) p1 (NOT p4) p3), acceptance={} source=7 dest: 9}], [{ cond=p4, acceptance={} source=8 dest: 0}, { cond=(NOT p4), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) p4), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p2) p1 p4), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=9 dest: 9}]], initial=2, aps=[p2:(AND (EQ s28 1) (EQ s46 1)), p1:(EQ s168 1), p3:(AND (EQ s4 1) (EQ s10 1)), p4:(AND (EQ s44 1) (EQ s204 1)), p0:(OR (AND (EQ s44 1) (EQ s204 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 827 ms.
Product exploration explored 100000 steps with 0 reset in 601 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 (NOT p2) (NOT p1) (NOT p3) (NOT p4) (NOT p0)), (X (AND (NOT p0) (NOT p2) (NOT p1) (NOT p4) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p4 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 p4 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p1 p4 (NOT p3))))), (X (X (NOT (AND p4 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p4 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p4 p3)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND p4 p3)))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p4 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 1410 ms. Reduced automaton from 10 states, 37 edges and 5 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (AND p4 p3), p4, p3, (AND p4 p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-13 11:18:15] [INFO ] Flow matrix only has 352 transitions (discarded 5 similar events)
[2023-03-13 11:18:15] [INFO ] Invariant cache hit.
[2023-03-13 11:18:15] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-13 11:18:16] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 11:18:16] [INFO ] [Nat]Absence check using 25 positive place invariants in 13 ms returned sat
[2023-03-13 11:18:16] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:16] [INFO ] After 43ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:16] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-13 11:18:16] [INFO ] After 463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 357/357 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 206 transition count 356
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 205 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 204 transition count 353
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 204 transition count 353
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 204 transition count 352
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 1 with 50 rules applied. Total rules applied 55 place count 179 transition count 327
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 175 transition count 356
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 1 with 34 rules applied. Total rules applied 97 place count 175 transition count 322
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 103 place count 172 transition count 319
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 115 place count 172 transition count 307
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 127 place count 160 transition count 307
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 144 place count 160 transition count 307
Applied a total of 144 rules in 95 ms. Remains 160 /206 variables (removed 46) and now considering 307/357 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 160/206 places, 307/357 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1211570 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :{}
Probabilistic random walk after 1211570 steps, saw 397725 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 11:18:19] [INFO ] Flow matrix only has 288 transitions (discarded 19 similar events)
// Phase 1: matrix 288 rows 160 cols
[2023-03-13 11:18:19] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-13 11:18:19] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-13 11:18:19] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 11:18:20] [INFO ] [Nat]Absence check using 25 positive place invariants in 12 ms returned sat
[2023-03-13 11:18:20] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:20] [INFO ] After 31ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:20] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2023-03-13 11:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-13 11:18:20] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-13 11:18:20] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 307/307 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 160/160 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 307/307 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2023-03-13 11:18:20] [INFO ] Flow matrix only has 288 transitions (discarded 19 similar events)
[2023-03-13 11:18:20] [INFO ] Invariant cache hit.
[2023-03-13 11:18:20] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-13 11:18:20] [INFO ] Flow matrix only has 288 transitions (discarded 19 similar events)
[2023-03-13 11:18:20] [INFO ] Invariant cache hit.
[2023-03-13 11:18:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:20] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-13 11:18:20] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-13 11:18:20] [INFO ] Flow matrix only has 288 transitions (discarded 19 similar events)
[2023-03-13 11:18:20] [INFO ] Invariant cache hit.
[2023-03-13 11:18:21] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 815 ms. Remains : 160/160 places, 307/307 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 160 transition count 288
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 1 with 12 rules applied. Total rules applied 31 place count 154 transition count 282
Applied a total of 31 rules in 18 ms. Remains 154 /160 variables (removed 6) and now considering 282/307 (removed 25) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 282 rows 154 cols
[2023-03-13 11:18:21] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-13 11:18:21] [INFO ] [Real]Absence check using 25 positive place invariants in 13 ms returned sat
[2023-03-13 11:18:21] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 11:18:21] [INFO ] [Nat]Absence check using 25 positive place invariants in 15 ms returned sat
[2023-03-13 11:18:21] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:21] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-13 11:18:21] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3) (NOT p4) (NOT p0)), (X (AND (NOT p0) (NOT p2) (NOT p1) (NOT p4) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p4 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 p4 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p1 p4 (NOT p3))))), (X (X (NOT (AND p4 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p4 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p4 p3)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND p4 p3)))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p4 p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) (NOT p4)))), (F (AND p3 (NOT p4))), (F p4), (F (AND (NOT p3) p4)), (F p3)]
Knowledge based reduction with 25 factoid took 1335 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[true, (AND p4 p3), p4, p3, (AND p4 p3)]
Stuttering acceptance computed with spot in 226 ms :[true, (AND p4 p3), p4, p3, (AND p4 p3)]
Support contains 4 out of 206 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 357/357 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 357/357 (removed 0) transitions.
[2023-03-13 11:18:23] [INFO ] Flow matrix only has 352 transitions (discarded 5 similar events)
// Phase 1: matrix 352 rows 206 cols
[2023-03-13 11:18:23] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-13 11:18:23] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-13 11:18:23] [INFO ] Flow matrix only has 352 transitions (discarded 5 similar events)
[2023-03-13 11:18:23] [INFO ] Invariant cache hit.
[2023-03-13 11:18:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:24] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2023-03-13 11:18:24] [INFO ] Flow matrix only has 352 transitions (discarded 5 similar events)
[2023-03-13 11:18:24] [INFO ] Invariant cache hit.
[2023-03-13 11:18:24] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1086 ms. Remains : 206/206 places, 357/357 transitions.
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 (NOT p4) (NOT p3)), (X (NOT (AND (NOT p3) p4))), (X (AND (NOT p3) (NOT p4))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 p4))), true, (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p3) p4)))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 p4))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 646 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[true, (AND p4 p3), p4, p3, (AND p4 p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 11:18:26] [INFO ] Flow matrix only has 352 transitions (discarded 5 similar events)
[2023-03-13 11:18:26] [INFO ] Invariant cache hit.
[2023-03-13 11:18:26] [INFO ] [Real]Absence check using 25 positive place invariants in 14 ms returned sat
[2023-03-13 11:18:26] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 11:18:26] [INFO ] [Nat]Absence check using 25 positive place invariants in 13 ms returned sat
[2023-03-13 11:18:26] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:26] [INFO ] After 41ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:26] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-13 11:18:26] [INFO ] After 438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 357/357 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 206 transition count 356
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 205 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 204 transition count 353
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 204 transition count 353
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 204 transition count 352
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 1 with 50 rules applied. Total rules applied 55 place count 179 transition count 327
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 63 place count 175 transition count 356
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 1 with 34 rules applied. Total rules applied 97 place count 175 transition count 322
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 103 place count 172 transition count 319
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 115 place count 172 transition count 307
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 127 place count 160 transition count 307
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 144 place count 160 transition count 307
Applied a total of 144 rules in 55 ms. Remains 160 /206 variables (removed 46) and now considering 307/357 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 160/206 places, 307/357 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1266937 steps, run timeout after 3001 ms. (steps per millisecond=422 ) properties seen :{}
Probabilistic random walk after 1266937 steps, saw 401144 distinct states, run finished after 3002 ms. (steps per millisecond=422 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 11:18:30] [INFO ] Flow matrix only has 288 transitions (discarded 19 similar events)
// Phase 1: matrix 288 rows 160 cols
[2023-03-13 11:18:30] [INFO ] Computed 25 place invariants in 4 ms
[2023-03-13 11:18:30] [INFO ] [Real]Absence check using 25 positive place invariants in 15 ms returned sat
[2023-03-13 11:18:30] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 11:18:30] [INFO ] [Nat]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-13 11:18:30] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:30] [INFO ] After 38ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:30] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2023-03-13 11:18:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-13 11:18:30] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-13 11:18:30] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 307/307 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 160/160 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 307/307 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2023-03-13 11:18:30] [INFO ] Flow matrix only has 288 transitions (discarded 19 similar events)
[2023-03-13 11:18:30] [INFO ] Invariant cache hit.
[2023-03-13 11:18:30] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-13 11:18:30] [INFO ] Flow matrix only has 288 transitions (discarded 19 similar events)
[2023-03-13 11:18:30] [INFO ] Invariant cache hit.
[2023-03-13 11:18:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:31] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2023-03-13 11:18:31] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-13 11:18:31] [INFO ] Flow matrix only has 288 transitions (discarded 19 similar events)
[2023-03-13 11:18:31] [INFO ] Invariant cache hit.
[2023-03-13 11:18:31] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 969 ms. Remains : 160/160 places, 307/307 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 160 transition count 288
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 1 with 12 rules applied. Total rules applied 31 place count 154 transition count 282
Applied a total of 31 rules in 14 ms. Remains 154 /160 variables (removed 6) and now considering 282/307 (removed 25) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 282 rows 154 cols
[2023-03-13 11:18:31] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-13 11:18:31] [INFO ] [Real]Absence check using 25 positive place invariants in 14 ms returned sat
[2023-03-13 11:18:32] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 11:18:32] [INFO ] [Nat]Absence check using 25 positive place invariants in 12 ms returned sat
[2023-03-13 11:18:32] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 11:18:32] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-13 11:18:32] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p4) (NOT p3)), (X (NOT (AND (NOT p3) p4))), (X (AND (NOT p3) (NOT p4))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 p4))), true, (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p3) p4)))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 p4))))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) (NOT p4)))), (F (AND p3 (NOT p4))), (F p4), (F (AND (NOT p3) p4)), (F p3)]
Knowledge based reduction with 12 factoid took 897 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[true, (AND p4 p3), p4, p3, (AND p4 p3)]
Stuttering acceptance computed with spot in 230 ms :[true, (AND p4 p3), p4, p3, (AND p4 p3)]
Stuttering acceptance computed with spot in 338 ms :[true, (AND p4 p3), p4, p3, (AND p4 p3)]
Product exploration explored 100000 steps with 0 reset in 716 ms.
Product exploration explored 100000 steps with 0 reset in 456 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 213 ms :[true, (AND p4 p3), p4, p3, (AND p4 p3)]
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 357/357 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 206 transition count 357
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 205 transition count 354
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 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 4 place count 205 transition count 353
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 29 place count 205 transition count 353
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 205 transition count 390
Deduced a syphon composed of 30 places in 0 ms
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 1 with 37 rules applied. Total rules applied 70 place count 205 transition count 353
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 205 transition count 353
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 73 rules in 84 ms. Remains 205 /206 variables (removed 1) and now considering 353/357 (removed 4) transitions.
[2023-03-13 11:18:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-13 11:18:35] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
// Phase 1: matrix 348 rows 205 cols
[2023-03-13 11:18:35] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-13 11:18:36] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/206 places, 353/357 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 536 ms. Remains : 205/206 places, 353/357 transitions.
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 357/357 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 205 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 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 3 place count 205 transition count 353
Applied a total of 3 rules in 11 ms. Remains 205 /206 variables (removed 1) and now considering 353/357 (removed 4) transitions.
[2023-03-13 11:18:36] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
// Phase 1: matrix 348 rows 205 cols
[2023-03-13 11:18:36] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-13 11:18:36] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-13 11:18:36] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2023-03-13 11:18:36] [INFO ] Invariant cache hit.
[2023-03-13 11:18:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:36] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-13 11:18:36] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2023-03-13 11:18:36] [INFO ] Invariant cache hit.
[2023-03-13 11:18:37] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/206 places, 353/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 750 ms. Remains : 205/206 places, 353/357 transitions.
Treatment of property MultiwaySync-PT-none-LTLFireability-02 finished in 26343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 364/364 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 204 transition count 352
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 204 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 204 transition count 349
Applied a total of 11 rules in 6 ms. Remains 204 /208 variables (removed 4) and now considering 349/364 (removed 15) transitions.
[2023-03-13 11:18:37] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2023-03-13 11:18:37] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-13 11:18:37] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-13 11:18:37] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2023-03-13 11:18:37] [INFO ] Invariant cache hit.
[2023-03-13 11:18:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:37] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-13 11:18:37] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2023-03-13 11:18:37] [INFO ] Invariant cache hit.
[2023-03-13 11:18:38] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 789 ms. Remains : 204/208 places, 349/364 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s101 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-03 finished in 987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(p1)) U p2)))'
Support contains 6 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 364/364 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 355
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 205 transition count 352
Applied a total of 9 rules in 6 ms. Remains 205 /208 variables (removed 3) and now considering 352/364 (removed 12) transitions.
[2023-03-13 11:18:38] [INFO ] Flow matrix only has 347 transitions (discarded 5 similar events)
// Phase 1: matrix 347 rows 205 cols
[2023-03-13 11:18:38] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-13 11:18:38] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-13 11:18:38] [INFO ] Flow matrix only has 347 transitions (discarded 5 similar events)
[2023-03-13 11:18:38] [INFO ] Invariant cache hit.
[2023-03-13 11:18:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:38] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2023-03-13 11:18:38] [INFO ] Flow matrix only has 347 transitions (discarded 5 similar events)
[2023-03-13 11:18:38] [INFO ] Invariant cache hit.
[2023-03-13 11:18:39] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/208 places, 352/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 996 ms. Remains : 205/208 places, 352/364 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(AND (EQ s56 1) (NEQ s90 1)), p0:(AND (EQ s50 1) (EQ s65 1)), p1:(OR (EQ s56 1) (AND (EQ s80 1) (EQ s99 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-04 finished in 1250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 364/364 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 362
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 206 transition count 362
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 202 transition count 350
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 202 transition count 350
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 202 transition count 347
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 1 with 50 rules applied. Total rules applied 63 place count 177 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 176 transition count 323
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 176 transition count 317
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 1 with 12 rules applied. Total rules applied 83 place count 170 transition count 311
Applied a total of 83 rules in 91 ms. Remains 170 /208 variables (removed 38) and now considering 311/364 (removed 53) transitions.
[2023-03-13 11:18:39] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
// Phase 1: matrix 306 rows 170 cols
[2023-03-13 11:18:39] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-13 11:18:39] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-13 11:18:39] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
[2023-03-13 11:18:39] [INFO ] Invariant cache hit.
[2023-03-13 11:18:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:40] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2023-03-13 11:18:40] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 11:18:40] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
[2023-03-13 11:18:40] [INFO ] Invariant cache hit.
[2023-03-13 11:18:40] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/208 places, 311/364 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1014 ms. Remains : 170/208 places, 311/364 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s164 1) (EQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 774 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-05 finished in 1862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X((F(G(!p1)) U !p2))))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 364/364 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 204 transition count 352
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 204 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 204 transition count 349
Applied a total of 11 rules in 10 ms. Remains 204 /208 variables (removed 4) and now considering 349/364 (removed 15) transitions.
[2023-03-13 11:18:41] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2023-03-13 11:18:41] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-13 11:18:41] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-13 11:18:41] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2023-03-13 11:18:41] [INFO ] Invariant cache hit.
[2023-03-13 11:18:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:41] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-13 11:18:41] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2023-03-13 11:18:41] [INFO ] Invariant cache hit.
[2023-03-13 11:18:42] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 933 ms. Remains : 204/208 places, 349/364 transitions.
Stuttering acceptance computed with spot in 227 ms :[p2, p2, (AND p0 p2 p1), (AND p0 p1)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s126 1) (EQ s202 1)), p2:(AND (EQ s138 1) (EQ s155 1)), p1:(AND (EQ s138 1) (EQ s155 1) (EQ s126 1) (EQ s202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 681 ms.
Product exploration explored 100000 steps with 50000 reset in 683 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 (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 7 factoid took 221 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiwaySync-PT-none-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiwaySync-PT-none-LTLFireability-06 finished in 2785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U p1)))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 364/364 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 361
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 361
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 198 edges and 204 vertex of which 102 / 204 are part of one of the 32 SCC in 0 ms
Free SCC test removed 70 places
Drop transitions 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 86 place count 134 transition count 281
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 136 rules applied. Total rules applied 222 place count 102 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 101 transition count 177
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 238 place count 86 transition count 143
Iterating global reduction 3 with 15 rules applied. Total rules applied 253 place count 86 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 256 place count 86 transition count 140
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 261 place count 81 transition count 127
Iterating global reduction 4 with 5 rules applied. Total rules applied 266 place count 81 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 271 place count 81 transition count 122
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 297 place count 68 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 298 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 6 with 2 rules applied. Total rules applied 300 place count 67 transition count 109
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 314 place count 67 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 314 place count 67 transition count 94
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 316 place count 66 transition count 94
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 6 with 12 rules applied. Total rules applied 328 place count 60 transition count 88
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 334 place count 54 transition count 68
Iterating global reduction 6 with 6 rules applied. Total rules applied 340 place count 54 transition count 68
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 345 place count 54 transition count 63
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 346 place count 54 transition count 62
Applied a total of 346 rules in 18 ms. Remains 54 /208 variables (removed 154) and now considering 62/364 (removed 302) transitions.
// Phase 1: matrix 62 rows 54 cols
[2023-03-13 11:18:44] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-13 11:18:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-13 11:18:44] [INFO ] Invariant cache hit.
[2023-03-13 11:18:44] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-13 11:18:44] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-13 11:18:44] [INFO ] Invariant cache hit.
[2023-03-13 11:18:44] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/208 places, 62/364 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 54/208 places, 62/364 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s11 1), p0:(AND (EQ s33 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-07 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 364/364 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 208 transition count 362
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 206 transition count 362
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 202 transition count 350
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 202 transition count 350
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 202 transition count 347
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 1 with 50 rules applied. Total rules applied 65 place count 177 transition count 322
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 73 place count 173 transition count 350
Drop transitions removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 1 with 95 rules applied. Total rules applied 168 place count 173 transition count 255
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 168 place count 173 transition count 235
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 40 rules applied. Total rules applied 208 place count 153 transition count 235
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 224 place count 137 transition count 219
Iterating global reduction 1 with 16 rules applied. Total rules applied 240 place count 137 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 240 place count 137 transition count 216
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 246 place count 134 transition count 216
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 288 place count 113 transition count 195
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 294 place count 107 transition count 183
Iterating global reduction 1 with 6 rules applied. Total rules applied 300 place count 107 transition count 183
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 306 place count 107 transition count 177
Applied a total of 306 rules in 59 ms. Remains 107 /208 variables (removed 101) and now considering 177/364 (removed 187) transitions.
[2023-03-13 11:18:44] [INFO ] Flow matrix only has 159 transitions (discarded 18 similar events)
// Phase 1: matrix 159 rows 107 cols
[2023-03-13 11:18:44] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-13 11:18:44] [INFO ] Implicit Places using invariants in 122 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/208 places, 177/364 transitions.
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 106 transition count 159
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 106 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 105 transition count 158
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 2 with 22 rules applied. Total rules applied 42 place count 94 transition count 147
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 88 transition count 127
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 88 transition count 127
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 85 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 64 place count 85 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 84 transition count 153
Applied a total of 66 rules in 24 ms. Remains 84 /106 variables (removed 22) and now considering 153/177 (removed 24) transitions.
// Phase 1: matrix 153 rows 84 cols
[2023-03-13 11:18:44] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-13 11:18:44] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-13 11:18:44] [INFO ] Invariant cache hit.
[2023-03-13 11:18:44] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-13 11:18:44] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/208 places, 153/364 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 503 ms. Remains : 84/208 places, 153/364 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 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 572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 364/364 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 204 transition count 352
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 204 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 204 transition count 349
Applied a total of 11 rules in 6 ms. Remains 204 /208 variables (removed 4) and now considering 349/364 (removed 15) transitions.
[2023-03-13 11:18:45] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2023-03-13 11:18:45] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-13 11:18:45] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-13 11:18:45] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2023-03-13 11:18:45] [INFO ] Invariant cache hit.
[2023-03-13 11:18:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:45] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-13 11:18:45] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2023-03-13 11:18:45] [INFO ] Invariant cache hit.
[2023-03-13 11:18:45] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 907 ms. Remains : 204/208 places, 349/364 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s102 1), p1:(AND (EQ s11 1) (EQ s202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2 reset in 485 ms.
Stack based approach found an accepted trace after 80 steps with 0 reset with depth 81 and stack size 81 in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-09 finished in 1508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 364/364 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 208 transition count 363
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 363
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 203 transition count 351
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 203 transition count 351
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 203 transition count 348
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 1 with 46 rules applied. Total rules applied 59 place count 180 transition count 325
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 176 transition count 353
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 100 place count 176 transition count 320
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 173 transition count 317
Applied a total of 106 rules in 41 ms. Remains 173 /208 variables (removed 35) and now considering 317/364 (removed 47) transitions.
[2023-03-13 11:18:46] [INFO ] Flow matrix only has 312 transitions (discarded 5 similar events)
// Phase 1: matrix 312 rows 173 cols
[2023-03-13 11:18:46] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-13 11:18:46] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-13 11:18:46] [INFO ] Flow matrix only has 312 transitions (discarded 5 similar events)
[2023-03-13 11:18:46] [INFO ] Invariant cache hit.
[2023-03-13 11:18:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:47] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2023-03-13 11:18:47] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-13 11:18:47] [INFO ] Flow matrix only has 312 transitions (discarded 5 similar events)
[2023-03-13 11:18:47] [INFO ] Invariant cache hit.
[2023-03-13 11:18:47] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 173/208 places, 317/364 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 966 ms. Remains : 173/208 places, 317/364 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s156 0) (EQ s171 0)), p1:(OR (EQ s111 0) (EQ s145 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 777 ms.
Product exploration explored 100000 steps with 0 reset in 814 ms.
Computed a total of 9 stabilizing places and 18 stable transitions
Computed a total of 9 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :1
Finished Best-First random walk after 4332 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=618 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 337 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 317/317 transitions.
Applied a total of 0 rules in 9 ms. Remains 173 /173 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2023-03-13 11:18:50] [INFO ] Flow matrix only has 312 transitions (discarded 5 similar events)
[2023-03-13 11:18:50] [INFO ] Invariant cache hit.
[2023-03-13 11:18:50] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-13 11:18:50] [INFO ] Flow matrix only has 312 transitions (discarded 5 similar events)
[2023-03-13 11:18:50] [INFO ] Invariant cache hit.
[2023-03-13 11:18:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:50] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2023-03-13 11:18:50] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 11:18:50] [INFO ] Flow matrix only has 312 transitions (discarded 5 similar events)
[2023-03-13 11:18:50] [INFO ] Invariant cache hit.
[2023-03-13 11:18:51] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 956 ms. Remains : 173/173 places, 317/317 transitions.
Computed a total of 9 stabilizing places and 18 stable transitions
Computed a total of 9 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6794 steps, including 2 resets, run visited all 2 properties in 184 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 342 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 764 ms.
Product exploration explored 100000 steps with 0 reset in 746 ms.
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 317/317 transitions.
Applied a total of 0 rules in 7 ms. Remains 173 /173 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2023-03-13 11:18:54] [INFO ] Flow matrix only has 312 transitions (discarded 5 similar events)
[2023-03-13 11:18:54] [INFO ] Invariant cache hit.
[2023-03-13 11:18:54] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-13 11:18:54] [INFO ] Flow matrix only has 312 transitions (discarded 5 similar events)
[2023-03-13 11:18:54] [INFO ] Invariant cache hit.
[2023-03-13 11:18:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:54] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-13 11:18:54] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-13 11:18:54] [INFO ] Flow matrix only has 312 transitions (discarded 5 similar events)
[2023-03-13 11:18:54] [INFO ] Invariant cache hit.
[2023-03-13 11:18:54] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 886 ms. Remains : 173/173 places, 317/317 transitions.
Treatment of property MultiwaySync-PT-none-LTLFireability-10 finished in 8407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p0))))'
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 364/364 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 205 transition count 353
Applied a total of 8 rules in 4 ms. Remains 205 /208 variables (removed 3) and now considering 353/364 (removed 11) transitions.
[2023-03-13 11:18:54] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
// Phase 1: matrix 348 rows 205 cols
[2023-03-13 11:18:54] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-13 11:18:55] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-13 11:18:55] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2023-03-13 11:18:55] [INFO ] Invariant cache hit.
[2023-03-13 11:18:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:55] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2023-03-13 11:18:55] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2023-03-13 11:18:55] [INFO ] Invariant cache hit.
[2023-03-13 11:18:55] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/208 places, 353/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 857 ms. Remains : 205/208 places, 353/364 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(AND (EQ s76 1) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-11 finished in 978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((F(G(p0)) U p1))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 364/364 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 362
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 362
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 202 transition count 350
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 202 transition count 350
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 202 transition count 347
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 1 with 50 rules applied. Total rules applied 63 place count 177 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 176 transition count 323
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 176 transition count 317
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 83 place count 170 transition count 311
Applied a total of 83 rules in 29 ms. Remains 170 /208 variables (removed 38) and now considering 311/364 (removed 53) transitions.
[2023-03-13 11:18:55] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
// Phase 1: matrix 306 rows 170 cols
[2023-03-13 11:18:55] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-13 11:18:56] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-13 11:18:56] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
[2023-03-13 11:18:56] [INFO ] Invariant cache hit.
[2023-03-13 11:18:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:56] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2023-03-13 11:18:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 11:18:56] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
[2023-03-13 11:18:56] [INFO ] Invariant cache hit.
[2023-03-13 11:18:56] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/208 places, 311/364 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 807 ms. Remains : 170/208 places, 311/364 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s168 1)), p0:(EQ s81 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 762 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-13 finished in 1740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U (p1 U p2)) U (F(p1)&&X(p3))))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 364/364 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 204 transition count 352
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 204 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 204 transition count 349
Applied a total of 11 rules in 6 ms. Remains 204 /208 variables (removed 4) and now considering 349/364 (removed 15) transitions.
[2023-03-13 11:18:57] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2023-03-13 11:18:57] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-13 11:18:57] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-13 11:18:57] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2023-03-13 11:18:57] [INFO ] Invariant cache hit.
[2023-03-13 11:18:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:18:58] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-13 11:18:58] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2023-03-13 11:18:58] [INFO ] Invariant cache hit.
[2023-03-13 11:18:58] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 793 ms. Remains : 204/208 places, 349/364 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p1) (NOT p3)), (NOT p1), (NOT p3), (NOT p3), (AND p2 (NOT p3)), (AND p2 (NOT p3)), true, p2, p2]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=p2, acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(EQ s126 1), p2:(AND (EQ s74 1) (EQ s98 1)), p0:(AND (EQ s74 1) (EQ s98 1) (NOT (AND (EQ s99 1) (EQ s202 1)))), p3:(AND (EQ s99 1) (EQ s202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 652 ms.
Stack based approach found an accepted trace after 175 steps with 1 reset with depth 28 and stack size 28 in 2 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-14 finished in 1877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||G(p1)))&&(X(p1) U p2)))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 364/364 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 205 transition count 353
Applied a total of 8 rules in 7 ms. Remains 205 /208 variables (removed 3) and now considering 353/364 (removed 11) transitions.
[2023-03-13 11:18:59] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
// Phase 1: matrix 348 rows 205 cols
[2023-03-13 11:18:59] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-13 11:18:59] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-13 11:18:59] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2023-03-13 11:18:59] [INFO ] Invariant cache hit.
[2023-03-13 11:19:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 11:19:00] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2023-03-13 11:19:00] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2023-03-13 11:19:00] [INFO ] Invariant cache hit.
[2023-03-13 11:19:00] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/208 places, 353/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1072 ms. Remains : 205/208 places, 353/364 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s159 1) (EQ s203 1)), p2:(AND (EQ s4 1) (EQ s21 1)), p0:(OR (EQ s159 0) (EQ s203 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 9 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-15 finished in 1453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U p2)||(!p3 U (G(!p3)||(!p3&&G(!p4))))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
[2023-03-13 11:19:01] [INFO ] Flatten gal took : 50 ms
[2023-03-13 11:19:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-13 11:19:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 208 places, 364 transitions and 1206 arcs took 7 ms.
Total runtime 73699 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MultiwaySync-PT-none
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLFireability

BK_STOP 1678706442934

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 MultiwaySync-PT-none-LTLFireability-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 3/32 MultiwaySync-PT-none-LTLFireability-10 290134 m, 58026 m/sec, 2511498 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 4/32 MultiwaySync-PT-none-LTLFireability-10 509018 m, 43776 m/sec, 5064131 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 6/32 MultiwaySync-PT-none-LTLFireability-10 750991 m, 48394 m/sec, 7553723 t fired, .

Time elapsed: 15 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 7/32 MultiwaySync-PT-none-LTLFireability-10 898575 m, 29516 m/sec, 10320609 t fired, .

Time elapsed: 20 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 9/32 MultiwaySync-PT-none-LTLFireability-10 1249740 m, 70233 m/sec, 12513872 t fired, .

Time elapsed: 25 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1800 12/32 MultiwaySync-PT-none-LTLFireability-10 1682435 m, 86539 m/sec, 14646243 t fired, .

Time elapsed: 30 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1800 16/32 MultiwaySync-PT-none-LTLFireability-10 2253028 m, 114118 m/sec, 16420417 t fired, .

Time elapsed: 35 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1800 20/32 MultiwaySync-PT-none-LTLFireability-10 2779938 m, 105382 m/sec, 18182426 t fired, .

Time elapsed: 40 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1800 23/32 MultiwaySync-PT-none-LTLFireability-10 3157515 m, 75515 m/sec, 20261648 t fired, .

Time elapsed: 45 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1800 26/32 MultiwaySync-PT-none-LTLFireability-10 3657897 m, 100076 m/sec, 22018820 t fired, .

Time elapsed: 50 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1800 30/32 MultiwaySync-PT-none-LTLFireability-10 4146119 m, 97644 m/sec, 23780418 t fired, .

Time elapsed: 55 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for MultiwaySync-PT-none-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 MultiwaySync-PT-none-LTLFireability-02
lola: time limit : 3540 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3540 5/32 MultiwaySync-PT-none-LTLFireability-02 575126 m, 115025 m/sec, 1674411 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3540 10/32 MultiwaySync-PT-none-LTLFireability-02 1131317 m, 111238 m/sec, 3447646 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3540 14/32 MultiwaySync-PT-none-LTLFireability-02 1657256 m, 105187 m/sec, 5182510 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3540 18/32 MultiwaySync-PT-none-LTLFireability-02 2151943 m, 98937 m/sec, 6869147 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3540 22/32 MultiwaySync-PT-none-LTLFireability-02 2638719 m, 97355 m/sec, 8572064 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3540 25/32 MultiwaySync-PT-none-LTLFireability-02 3107296 m, 93715 m/sec, 10250665 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3540 29/32 MultiwaySync-PT-none-LTLFireability-02 3566677 m, 91876 m/sec, 11925029 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for MultiwaySync-PT-none-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiwaySync-PT-none-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
MultiwaySync-PT-none-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MultiwaySync-PT-none-LTLFireability-02: LTL unknown AGGR
MultiwaySync-PT-none-LTLFireability-10: LTL unknown AGGR


Time elapsed: 100 secs. Pages in use: 32

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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
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 r263-smll-167863537600004"
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 ;