Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 18:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 111K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-00
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-01
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-02
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-03
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-04
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-05
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-06
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-07
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-08
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-09
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-10
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-11
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-12
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-13
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-14
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717235185076

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiwaySync-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:46:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:46:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:46:26] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-01 09:46:26] [INFO ] Transformed 222 places.
[2024-06-01 09:46:26] [INFO ] Transformed 472 transitions.
[2024-06-01 09:46:26] [INFO ] Found NUPN structural information;
[2024-06-01 09:46:26] [INFO ] Parsed PT model containing 222 places and 472 transitions and 1496 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 83 transitions
Reduce redundant transitions removed 83 transitions.
FORMULA MultiwaySync-PT-none-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 389/389 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 213 transition count 380
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 213 transition count 380
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 23 place count 213 transition count 375
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 210 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 210 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 210 transition count 365
Applied a total of 30 rules in 64 ms. Remains 210 /222 variables (removed 12) and now considering 365/389 (removed 24) transitions.
[2024-06-01 09:46:26] [INFO ] Flow matrix only has 360 transitions (discarded 5 similar events)
// Phase 1: matrix 360 rows 210 cols
[2024-06-01 09:46:26] [INFO ] Computed 25 invariants in 19 ms
[2024-06-01 09:46:27] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-01 09:46:27] [INFO ] Flow matrix only has 360 transitions (discarded 5 similar events)
[2024-06-01 09:46:27] [INFO ] Invariant cache hit.
[2024-06-01 09:46:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:46:27] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-01 09:46:27] [INFO ] Flow matrix only has 360 transitions (discarded 5 similar events)
[2024-06-01 09:46:27] [INFO ] Invariant cache hit.
[2024-06-01 09:46:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-01 09:46:31] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 12 ms to minimize.
[2024-06-01 09:46:31] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:46:32] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:46:32] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:46:32] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:46:32] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:46:32] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:46:32] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 360/570 variables, 210/243 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 244 constraints, problems are : Problem set: 0 solved, 364 unsolved in 15025 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 210/210 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 360/570 variables, 210/243 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 364/608 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-01 09:46:50] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:46:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/570 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 9 (OVERLAPS) 0/570 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 610 constraints, problems are : Problem set: 0 solved, 364 unsolved in 24849 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 210/210 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 10/10 constraints]
After SMT, in 40381ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 40397ms
Starting structural reductions in LTL mode, iteration 1 : 210/222 places, 365/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41001 ms. Remains : 210/222 places, 365/389 transitions.
Support contains 25 out of 210 places after structural reductions.
[2024-06-01 09:47:07] [INFO ] Flatten gal took : 90 ms
[2024-06-01 09:47:08] [INFO ] Flatten gal took : 30 ms
[2024-06-01 09:47:08] [INFO ] Input system was already deterministic with 365 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (8 resets) in 1319 ms. (30 steps per ms) remains 3/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/2 properties
BEST_FIRST walk for 23784 steps (5 resets) in 39 ms. (594 steps per ms) remains 0/1 properties
Computed a total of 11 stabilizing places and 17 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 365/365 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 206 transition count 359
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 206 transition count 359
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 206 transition count 357
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 204 transition count 351
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 204 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 204 transition count 349
Applied a total of 16 rules in 21 ms. Remains 204 /210 variables (removed 6) and now considering 349/365 (removed 16) transitions.
[2024-06-01 09:47:08] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-06-01 09:47:09] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 09:47:09] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-06-01 09:47:09] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:47:09] [INFO ] Invariant cache hit.
[2024-06-01 09:47:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:47:09] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 09:47:09] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:47:09] [INFO ] Invariant cache hit.
[2024-06-01 09:47:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:47:12] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:47:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:47:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:47:12] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:47:13] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:47:13] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:47:13] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:47:13] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12322 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:47:29] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:47:29] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 26519 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 39162ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 39165ms
Starting structural reductions in LTL mode, iteration 1 : 204/210 places, 349/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39629 ms. Remains : 204/210 places, 349/365 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-00
Product exploration explored 100000 steps with 636 reset in 480 ms.
Stack based approach found an accepted trace after 95 steps with 1 reset with depth 66 and stack size 66 in 0 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-00 finished in 40410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 365/365 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 210 transition count 363
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 208 transition count 363
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 204 transition count 357
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 204 transition count 357
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 204 transition count 355
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 202 transition count 349
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 202 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 202 transition count 347
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 68 place count 178 transition count 323
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 2 with 8 rules applied. Total rules applied 76 place count 174 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 2 with 95 rules applied. Total rules applied 171 place count 174 transition count 256
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 171 place count 174 transition count 237
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 209 place count 155 transition count 237
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 224 place count 140 transition count 222
Iterating global reduction 2 with 15 rules applied. Total rules applied 239 place count 140 transition count 222
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 239 place count 140 transition count 219
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 245 place count 137 transition count 219
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 2 with 42 rules applied. Total rules applied 287 place count 116 transition count 198
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 293 place count 110 transition count 186
Iterating global reduction 2 with 6 rules applied. Total rules applied 299 place count 110 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 305 place count 110 transition count 180
Applied a total of 305 rules in 111 ms. Remains 110 /210 variables (removed 100) and now considering 180/365 (removed 185) transitions.
[2024-06-01 09:47:49] [INFO ] Flow matrix only has 162 transitions (discarded 18 similar events)
// Phase 1: matrix 162 rows 110 cols
[2024-06-01 09:47:49] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 09:47:49] [INFO ] Implicit Places using invariants in 95 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/210 places, 180/365 transitions.
Drop transitions (Redundant composition of simpler 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 109 transition count 162
Drop transitions (Trivial Post-Agglo cleanup.) 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 109 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 108 transition count 161
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 2 with 22 rules applied. Total rules applied 42 place count 97 transition count 150
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 91 transition count 130
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 91 transition count 130
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 88 transition count 148
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 88 transition count 144
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 87 transition count 156
Applied a total of 66 rules in 25 ms. Remains 87 /109 variables (removed 22) and now considering 156/180 (removed 24) transitions.
// Phase 1: matrix 156 rows 87 cols
[2024-06-01 09:47:49] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 09:47:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 09:47:49] [INFO ] Invariant cache hit.
[2024-06-01 09:47:49] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 09:47:49] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/210 places, 156/365 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 390 ms. Remains : 87/210 places, 156/365 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-01
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-01 finished in 525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 365/365 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 206 transition count 359
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 206 transition count 359
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 206 transition count 357
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 204 transition count 351
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 204 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 204 transition count 349
Applied a total of 16 rules in 12 ms. Remains 204 /210 variables (removed 6) and now considering 349/365 (removed 16) transitions.
[2024-06-01 09:47:49] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-06-01 09:47:49] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 09:47:49] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 09:47:49] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:47:49] [INFO ] Invariant cache hit.
[2024-06-01 09:47:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:47:50] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 09:47:50] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:47:50] [INFO ] Invariant cache hit.
[2024-06-01 09:47:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:47:52] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:47:53] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:47:53] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:47:53] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:47:53] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:47:53] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:47:54] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:47:54] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12409 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:48:10] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:48:10] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25409 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 38129ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 38131ms
Starting structural reductions in LTL mode, iteration 1 : 204/210 places, 349/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38381 ms. Remains : 204/210 places, 349/365 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 361 ms.
Product exploration explored 100000 steps with 50000 reset in 329 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiwaySync-PT-none-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiwaySync-PT-none-LTLCardinality-02 finished in 39299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 365/365 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 210 transition count 363
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 208 transition count 363
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 204 transition count 357
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 204 transition count 357
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 204 transition count 355
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 202 transition count 349
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 202 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 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 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 70 place count 177 transition count 322
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 174 transition count 349
Drop transitions (Redundant composition of simpler transitions.) removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 2 with 95 rules applied. Total rules applied 171 place count 174 transition count 254
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 171 place count 174 transition count 234
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 211 place count 154 transition count 234
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 227 place count 138 transition count 218
Iterating global reduction 2 with 16 rules applied. Total rules applied 243 place count 138 transition count 218
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 243 place count 138 transition count 215
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 249 place count 135 transition count 215
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 2 with 42 rules applied. Total rules applied 291 place count 114 transition count 194
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 297 place count 108 transition count 182
Iterating global reduction 2 with 6 rules applied. Total rules applied 303 place count 108 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 309 place count 108 transition count 176
Applied a total of 309 rules in 116 ms. Remains 108 /210 variables (removed 102) and now considering 176/365 (removed 189) transitions.
[2024-06-01 09:48:29] [INFO ] Flow matrix only has 158 transitions (discarded 18 similar events)
// Phase 1: matrix 158 rows 108 cols
[2024-06-01 09:48:29] [INFO ] Computed 12 invariants in 18 ms
[2024-06-01 09:48:29] [INFO ] Implicit Places using invariants in 370 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 372 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/210 places, 176/365 transitions.
Drop transitions (Redundant composition of simpler 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 107 transition count 158
Drop transitions (Trivial Post-Agglo cleanup.) 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 107 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 106 transition count 157
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 95 transition count 146
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 89 transition count 127
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 89 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 86 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 86 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 85 transition count 153
Applied a total of 66 rules in 14 ms. Remains 85 /107 variables (removed 22) and now considering 153/176 (removed 23) transitions.
// Phase 1: matrix 153 rows 85 cols
[2024-06-01 09:48:29] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 09:48:29] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 09:48:29] [INFO ] Invariant cache hit.
[2024-06-01 09:48:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 09:48:29] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/210 places, 153/365 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 701 ms. Remains : 85/210 places, 153/365 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-06 finished in 834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((!p1 U (p2||G(!p1)))||p0)))))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 365/365 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 207 transition count 360
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 207 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 207 transition count 359
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 205 transition count 353
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 205 transition count 353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 205 transition count 351
Applied a total of 13 rules in 4 ms. Remains 205 /210 variables (removed 5) and now considering 351/365 (removed 14) transitions.
[2024-06-01 09:48:30] [INFO ] Flow matrix only has 346 transitions (discarded 5 similar events)
// Phase 1: matrix 346 rows 205 cols
[2024-06-01 09:48:30] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 09:48:30] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 09:48:30] [INFO ] Flow matrix only has 346 transitions (discarded 5 similar events)
[2024-06-01 09:48:30] [INFO ] Invariant cache hit.
[2024-06-01 09:48:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:48:30] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 350 sub problems to find dead transitions.
[2024-06-01 09:48:30] [INFO ] Flow matrix only has 346 transitions (discarded 5 similar events)
[2024-06-01 09:48:30] [INFO ] Invariant cache hit.
[2024-06-01 09:48:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-01 09:48:33] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
[2024-06-01 09:48:33] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 10 ms to minimize.
[2024-06-01 09:48:33] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
[2024-06-01 09:48:33] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:48:33] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 4 ms to minimize.
[2024-06-01 09:48:33] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:48:34] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:48:34] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 346/551 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 7 (OVERLAPS) 0/551 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 239 constraints, problems are : Problem set: 0 solved, 350 unsolved in 11946 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 346/551 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 350/589 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-01 09:48:49] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:48:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 9 (OVERLAPS) 0/551 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 591 constraints, problems are : Problem set: 0 solved, 350 unsolved in 21235 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 10/10 constraints]
After SMT, in 33474ms problems are : Problem set: 0 solved, 350 unsolved
Search for dead transitions found 0 dead transitions in 33477ms
Starting structural reductions in LTL mode, iteration 1 : 205/210 places, 351/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33789 ms. Remains : 205/210 places, 351/365 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 280 ms.
Product exploration explored 100000 steps with 0 reset in 289 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) p1 p0), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p2))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 8 to 5
RANDOM walk for 40000 steps (8 resets) in 720 ms. (55 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 226 ms. (176 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 1/1 properties
[2024-06-01 09:49:05] [INFO ] Flow matrix only has 346 transitions (discarded 5 similar events)
[2024-06-01 09:49:05] [INFO ] Invariant cache hit.
[2024-06-01 09:49:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 4/551 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/25 constraints, State Equation: 0/205 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p2))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p2) p1))), (F p2), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 360 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 213 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 351/351 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2024-06-01 09:49:06] [INFO ] Flow matrix only has 346 transitions (discarded 5 similar events)
[2024-06-01 09:49:06] [INFO ] Invariant cache hit.
[2024-06-01 09:49:06] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 09:49:06] [INFO ] Flow matrix only has 346 transitions (discarded 5 similar events)
[2024-06-01 09:49:06] [INFO ] Invariant cache hit.
[2024-06-01 09:49:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:49:06] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 350 sub problems to find dead transitions.
[2024-06-01 09:49:06] [INFO ] Flow matrix only has 346 transitions (discarded 5 similar events)
[2024-06-01 09:49:06] [INFO ] Invariant cache hit.
[2024-06-01 09:49:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-01 09:49:09] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:49:09] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:49:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:49:09] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:49:10] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:49:10] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:49:10] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:49:10] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 346/551 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 7 (OVERLAPS) 0/551 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 239 constraints, problems are : Problem set: 0 solved, 350 unsolved in 12940 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 346/551 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 350/589 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-01 09:49:26] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:49:27] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 9 (OVERLAPS) 0/551 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 591 constraints, problems are : Problem set: 0 solved, 350 unsolved in 22083 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 10/10 constraints]
After SMT, in 35307ms problems are : Problem set: 0 solved, 350 unsolved
Search for dead transitions found 0 dead transitions in 35311ms
Finished structural reductions in LTL mode , in 1 iterations and 35628 ms. Remains : 205/205 places, 351/351 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 p2) p1 p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR p0 p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Reduction of identical properties reduced properties to check from 7 to 4
RANDOM walk for 40000 steps (8 resets) in 264 ms. (150 steps per ms) remains 1/4 properties
BEST_FIRST walk for 39558 steps (8 resets) in 54 ms. (719 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR p0 p2))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p0 p2))), (F p2)]
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 259 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Entered a terminal (fully accepting) state of product in 150 steps with 0 reset in 2 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-07 finished in 73255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 365/365 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 209 transition count 362
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 206 transition count 362
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 203 edges and 206 vertex of which 105 / 206 are part of one of the 31 SCC in 4 ms
Free SCC test removed 74 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 80 rules applied. Total rules applied 85 place count 132 transition count 283
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 142 rules applied. Total rules applied 227 place count 101 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 228 place count 100 transition count 172
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 241 place count 87 transition count 148
Iterating global reduction 3 with 13 rules applied. Total rules applied 254 place count 87 transition count 148
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 261 place count 80 transition count 124
Iterating global reduction 3 with 7 rules applied. Total rules applied 268 place count 80 transition count 124
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 275 place count 80 transition count 117
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 297 place count 69 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 299 place count 68 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 311 place count 68 transition count 94
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 323 place count 62 transition count 88
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 329 place count 56 transition count 67
Iterating global reduction 4 with 6 rules applied. Total rules applied 335 place count 56 transition count 67
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 340 place count 56 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 341 place count 56 transition count 61
Applied a total of 341 rules in 47 ms. Remains 56 /210 variables (removed 154) and now considering 61/365 (removed 304) transitions.
// Phase 1: matrix 61 rows 56 cols
[2024-06-01 09:49:43] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 09:49:43] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 09:49:43] [INFO ] Invariant cache hit.
[2024-06-01 09:49:43] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-06-01 09:49:43] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-06-01 09:49:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 5/54 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 09:49:43] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 60/114 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 2/116 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/116 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/117 variables, and 67 constraints, problems are : Problem set: 0 solved, 45 unsolved in 746 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 5/54 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 60/114 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 45/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 2/116 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/116 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/117 variables, and 112 constraints, problems are : Problem set: 0 solved, 45 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 1/1 constraints]
After SMT, in 1463ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1464ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/210 places, 61/365 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1617 ms. Remains : 56/210 places, 61/365 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 463 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1367 resets) in 141 ms. (281 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
[2024-06-01 09:49:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/58 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/74 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/76 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/76 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/117 variables, and 42 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 6/10 constraints, State Equation: 36/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/58 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/74 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/76 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/76 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/117 variables, and 43 constraints, problems are : Problem set: 0 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 6/10 constraints, State Equation: 36/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 723 steps, including 81 resets, run visited all 1 properties in 3 ms. (steps per millisecond=241 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 p0))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 638 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0))]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 09:49:46] [INFO ] Invariant cache hit.
[2024-06-01 09:49:46] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 09:49:46] [INFO ] Invariant cache hit.
[2024-06-01 09:49:46] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-06-01 09:49:46] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2024-06-01 09:49:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 5/54 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 09:49:46] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 60/114 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 2/116 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/116 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/117 variables, and 67 constraints, problems are : Problem set: 0 solved, 45 unsolved in 746 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 5/54 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 60/114 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 45/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 2/116 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/116 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/117 variables, and 112 constraints, problems are : Problem set: 0 solved, 45 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 1/1 constraints]
After SMT, in 1449ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1450ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1556 ms. Remains : 56/56 places, 61/61 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 455 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
RANDOM walk for 34380 steps (1177 resets) in 107 ms. (318 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 p0))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 652 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 191 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 56 /56 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 09:49:49] [INFO ] Invariant cache hit.
[2024-06-01 09:49:49] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 09:49:49] [INFO ] Invariant cache hit.
[2024-06-01 09:49:49] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-06-01 09:49:49] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-06-01 09:49:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 5/54 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 09:49:50] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 60/114 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 2/116 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/116 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/117 variables, and 67 constraints, problems are : Problem set: 0 solved, 45 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 5/54 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 60/114 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 45/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 2/116 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/116 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/117 variables, and 112 constraints, problems are : Problem set: 0 solved, 45 unsolved in 680 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 1/1 constraints]
After SMT, in 1455ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1455ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1560 ms. Remains : 56/56 places, 61/61 transitions.
Treatment of property MultiwaySync-PT-none-LTLCardinality-08 finished in 8207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 365/365 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 209 transition count 362
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 206 transition count 362
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 201 edges and 206 vertex of which 107 / 206 are part of one of the 32 SCC in 0 ms
Free SCC test removed 75 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 76 rules applied. Total rules applied 81 place count 131 transition count 287
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 141 rules applied. Total rules applied 222 place count 104 transition count 173
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 225 place count 101 transition count 173
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 240 place count 86 transition count 144
Iterating global reduction 3 with 15 rules applied. Total rules applied 255 place count 86 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 256 place count 86 transition count 143
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 264 place count 78 transition count 118
Iterating global reduction 4 with 8 rules applied. Total rules applied 272 place count 78 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 277 place count 78 transition count 113
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 5 with 22 rules applied. Total rules applied 299 place count 67 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 301 place count 66 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 314 place count 66 transition count 89
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 326 place count 60 transition count 83
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 332 place count 54 transition count 63
Iterating global reduction 5 with 6 rules applied. Total rules applied 338 place count 54 transition count 63
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 344 place count 54 transition count 57
Applied a total of 344 rules in 16 ms. Remains 54 /210 variables (removed 156) and now considering 57/365 (removed 308) transitions.
// Phase 1: matrix 57 rows 54 cols
[2024-06-01 09:49:51] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 09:49:51] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-06-01 09:49:51] [INFO ] Invariant cache hit.
[2024-06-01 09:49:51] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-06-01 09:49:51] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-06-01 09:49:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 5/52 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 56/108 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 2/110 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/111 variables, and 64 constraints, problems are : Problem set: 0 solved, 41 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 5/52 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 56/108 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 41/103 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 2/110 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/110 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/111 variables, and 105 constraints, problems are : Problem set: 0 solved, 41 unsolved in 608 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 1142ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1143ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/210 places, 57/365 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1578 ms. Remains : 54/210 places, 57/365 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-10
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-10 finished in 1773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 365/365 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 209 transition count 362
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 206 transition count 362
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 210 edges and 206 vertex of which 109 / 206 are part of one of the 32 SCC in 1 ms
Free SCC test removed 77 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 81 rules applied. Total rules applied 86 place count 129 transition count 282
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 233 place count 97 transition count 167
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 248 place count 82 transition count 138
Iterating global reduction 2 with 15 rules applied. Total rules applied 263 place count 82 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 82 transition count 137
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 272 place count 74 transition count 112
Iterating global reduction 3 with 8 rules applied. Total rules applied 280 place count 74 transition count 112
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 288 place count 74 transition count 104
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 310 place count 63 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 312 place count 62 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 324 place count 62 transition count 81
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 336 place count 56 transition count 75
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 342 place count 50 transition count 55
Iterating global reduction 4 with 6 rules applied. Total rules applied 348 place count 50 transition count 55
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 354 place count 50 transition count 49
Applied a total of 354 rules in 22 ms. Remains 50 /210 variables (removed 160) and now considering 49/365 (removed 316) transitions.
// Phase 1: matrix 49 rows 50 cols
[2024-06-01 09:49:53] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 09:49:53] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 09:49:53] [INFO ] Invariant cache hit.
[2024-06-01 09:49:53] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-06-01 09:49:53] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-06-01 09:49:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 5/48 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 48/96 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 2/98 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/99 variables, and 60 constraints, problems are : Problem set: 0 solved, 36 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 5/48 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 48/96 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 36/94 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 2/98 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/99 variables, and 96 constraints, problems are : Problem set: 0 solved, 36 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 975ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 976ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/210 places, 49/365 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1216 ms. Remains : 50/210 places, 49/365 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 42 ms.
Product exploration explored 100000 steps with 0 reset in 53 ms.
Computed a total of 10 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 2307 steps (89 resets) in 7 ms. (288 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-06-01 09:49:54] [INFO ] Invariant cache hit.
[2024-06-01 09:49:54] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 09:49:54] [INFO ] Invariant cache hit.
[2024-06-01 09:49:55] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-01 09:49:55] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-06-01 09:49:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 5/48 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 48/96 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 2/98 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/99 variables, and 60 constraints, problems are : Problem set: 0 solved, 36 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 5/48 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 48/96 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 36/94 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 2/98 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/99 variables, and 96 constraints, problems are : Problem set: 0 solved, 36 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 968ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 969ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1064 ms. Remains : 50/50 places, 49/49 transitions.
Computed a total of 10 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 3943 steps (159 resets) in 9 ms. (394 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 48 ms.
Product exploration explored 100000 steps with 0 reset in 52 ms.
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2024-06-01 09:49:56] [INFO ] Invariant cache hit.
[2024-06-01 09:49:56] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 09:49:56] [INFO ] Invariant cache hit.
[2024-06-01 09:49:56] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-01 09:49:56] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-06-01 09:49:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 5/48 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 48/96 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 2/98 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/99 variables, and 60 constraints, problems are : Problem set: 0 solved, 36 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 5/48 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 48/96 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 36/94 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 2/98 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/99 variables, and 96 constraints, problems are : Problem set: 0 solved, 36 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 970ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 970ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1073 ms. Remains : 50/50 places, 49/49 transitions.
Treatment of property MultiwaySync-PT-none-LTLCardinality-12 finished in 4370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 365/365 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 208 transition count 361
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 208 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 208 transition count 359
Applied a total of 6 rules in 4 ms. Remains 208 /210 variables (removed 2) and now considering 359/365 (removed 6) transitions.
[2024-06-01 09:49:57] [INFO ] Flow matrix only has 354 transitions (discarded 5 similar events)
// Phase 1: matrix 354 rows 208 cols
[2024-06-01 09:49:57] [INFO ] Computed 25 invariants in 7 ms
[2024-06-01 09:49:57] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 09:49:57] [INFO ] Flow matrix only has 354 transitions (discarded 5 similar events)
[2024-06-01 09:49:57] [INFO ] Invariant cache hit.
[2024-06-01 09:49:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:49:57] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2024-06-01 09:49:57] [INFO ] Flow matrix only has 354 transitions (discarded 5 similar events)
[2024-06-01 09:49:57] [INFO ] Invariant cache hit.
[2024-06-01 09:49:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 09:50:00] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:50:00] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:50:01] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:50:01] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:50:01] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:50:01] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:50:01] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:50:01] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (OVERLAPS) 354/562 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (OVERLAPS) 0/562 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 358 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 242 constraints, problems are : Problem set: 0 solved, 358 unsolved in 12751 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 208/208 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (OVERLAPS) 354/562 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 358/600 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-06-01 09:50:18] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:50:18] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 9 (OVERLAPS) 0/562 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 358 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 602 constraints, problems are : Problem set: 0 solved, 358 unsolved in 22804 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 208/208 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 10/10 constraints]
After SMT, in 35873ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 35878ms
Starting structural reductions in LTL mode, iteration 1 : 208/210 places, 359/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36135 ms. Remains : 208/210 places, 359/365 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-14
Product exploration explored 100000 steps with 2 reset in 349 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 1 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-14 finished in 36616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 365/365 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 206 transition count 359
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 206 transition count 359
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 206 transition count 357
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 204 transition count 351
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 204 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 204 transition count 349
Applied a total of 16 rules in 4 ms. Remains 204 /210 variables (removed 6) and now considering 349/365 (removed 16) transitions.
[2024-06-01 09:50:34] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-06-01 09:50:34] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 09:50:34] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 09:50:34] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:50:34] [INFO ] Invariant cache hit.
[2024-06-01 09:50:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 09:50:34] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-01 09:50:34] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-06-01 09:50:34] [INFO ] Invariant cache hit.
[2024-06-01 09:50:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:50:37] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:50:37] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:50:37] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:50:37] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:50:38] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:50:38] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:50:38] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:50:38] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12244 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-01 09:50:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:50:54] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25234 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 37764ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 37767ms
Starting structural reductions in LTL mode, iteration 1 : 204/210 places, 349/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38018 ms. Remains : 204/210 places, 349/365 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-15 finished in 38148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-01 09:51:12] [INFO ] Flatten gal took : 26 ms
[2024-06-01 09:51:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 09:51:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 210 places, 365 transitions and 1206 arcs took 6 ms.
Total runtime 286415 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MultiwaySync-PT-none-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiwaySync-PT-none-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717235704913

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name MultiwaySync-PT-none-LTLCardinality-08
ltl formula formula --ltl=/tmp/1522/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 210 places, 365 transitions and 1206 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1522/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1522/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1522/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1522/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 211 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 211, there are 423 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~121212 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~251656 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~513240 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~1058428 transitions
pnml2lts-mc( 0/ 4): ~40000 levels ~160000 states ~2118368 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~4172692 transitions
pnml2lts-mc( 0/ 4): ~160000 levels ~640000 states ~8295808 transitions
pnml2lts-mc( 3/ 4): ~319324 levels ~1280000 states ~18804100 transitions
pnml2lts-mc( 0/ 4): ~640000 levels ~2560000 states ~32503768 transitions
pnml2lts-mc( 0/ 4): ~1279998 levels ~5120000 states ~64324768 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 6238960
pnml2lts-mc( 0/ 4): unique transitions count: 85991116
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 31107930
pnml2lts-mc( 0/ 4): - claim success count: 6238967
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6234530
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6238967 states 85991228 transitions, fanout: 13.783
pnml2lts-mc( 0/ 4): Total exploration time 52.560 sec (52.550 sec minimum, 52.553 sec on average)
pnml2lts-mc( 0/ 4): States per second: 118702, Transitions per second: 1636058
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 288.4MB, 9.0 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/50.0%
pnml2lts-mc( 0/ 4): Stored 368 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 288.4MB (~256.0MB paged-in)
ltl formula name MultiwaySync-PT-none-LTLCardinality-12
ltl formula formula --ltl=/tmp/1522/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 210 places, 365 transitions and 1206 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1522/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1522/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1522/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1522/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 211 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 211, there are 371 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~133828 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~279360 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~583956 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~1132588 transitions
pnml2lts-mc( 2/ 4): ~39988 levels ~160000 states ~2230652 transitions
pnml2lts-mc( 2/ 4): ~79948 levels ~320000 states ~4364012 transitions
pnml2lts-mc( 2/ 4): ~159846 levels ~640000 states ~8495628 transitions
pnml2lts-mc( 2/ 4): ~319494 levels ~1280000 states ~16998592 transitions
pnml2lts-mc( 2/ 4): ~638261 levels ~2560000 states ~34254772 transitions
pnml2lts-mc( 2/ 4): ~1275047 levels ~5120000 states ~69424676 transitions
pnml2lts-mc( 2/ 4): ~2545620 levels ~10240000 states ~141293932 transitions
pnml2lts-mc( 2/ 4): ~5072524 levels ~20480000 states ~288402876 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 19852498
pnml2lts-mc( 0/ 4): unique transitions count: 270703534
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 150802644
pnml2lts-mc( 0/ 4): - claim success count: 19852504
pnml2lts-mc( 0/ 4): - cum. max stack depth: 19660247
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 19852504 states 270703619 transitions, fanout: 13.636
pnml2lts-mc( 0/ 4): Total exploration time 178.380 sec (178.360 sec minimum, 178.365 sec on average)
pnml2lts-mc( 0/ 4): States per second: 111293, Transitions per second: 1517567
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 312.1MB, 9.8 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/87.0%
pnml2lts-mc( 0/ 4): Stored 368 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 312.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MultiwaySync-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654351200235"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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