fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r508-tall-171654352100652
Last Updated
July 7, 2024

About the Execution of LTSMin+red for NoC3x3-PT-7A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
660.088 227343.00 284794.00 593.10 FFFFFFFFTFFFFFFF normal

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-171654352100652.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 NoC3x3-PT-7A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654352100652
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 07:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 07:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 355K 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 NoC3x3-PT-7A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-7A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717243752106

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:09:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:09:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:09:13] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-06-01 12:09:13] [INFO ] Transformed 801 places.
[2024-06-01 12:09:13] [INFO ] Transformed 1544 transitions.
[2024-06-01 12:09:13] [INFO ] Found NUPN structural information;
[2024-06-01 12:09:13] [INFO ] Parsed PT model containing 801 places and 1544 transitions and 4519 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
FORMULA NoC3x3-PT-7A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 1437/1437 transitions.
Discarding 173 places :
Symmetric choice reduction at 0 with 173 rule applications. Total rules 173 place count 628 transition count 1189
Ensure Unique test removed 42 places
Iterating global reduction 0 with 215 rules applied. Total rules applied 388 place count 586 transition count 1189
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 421 place count 586 transition count 1156
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 441 place count 586 transition count 1136
Applied a total of 441 rules in 114 ms. Remains 586 /801 variables (removed 215) and now considering 1136/1437 (removed 301) transitions.
[2024-06-01 12:09:13] [INFO ] Flow matrix only has 1130 transitions (discarded 6 similar events)
// Phase 1: matrix 1130 rows 586 cols
[2024-06-01 12:09:13] [INFO ] Computed 69 invariants in 27 ms
[2024-06-01 12:09:14] [INFO ] Implicit Places using invariants in 553 ms returned [10, 81, 156, 218, 301, 443, 495]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 584 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 579/801 places, 1136/1437 transitions.
Applied a total of 0 rules in 21 ms. Remains 579 /579 variables (removed 0) and now considering 1136/1136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 737 ms. Remains : 579/801 places, 1136/1437 transitions.
Support contains 45 out of 579 places after structural reductions.
[2024-06-01 12:09:14] [INFO ] Flatten gal took : 169 ms
[2024-06-01 12:09:14] [INFO ] Flatten gal took : 124 ms
[2024-06-01 12:09:15] [INFO ] Input system was already deterministic with 1136 transitions.
Support contains 44 out of 579 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (8 resets) in 3111 ms. (12 steps per ms) remains 3/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
[2024-06-01 12:09:16] [INFO ] Flow matrix only has 1130 transitions (discarded 6 similar events)
// Phase 1: matrix 1130 rows 579 cols
[2024-06-01 12:09:16] [INFO ] Computed 62 invariants in 14 ms
[2024-06-01 12:09:16] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 517/574 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 6 (OVERLAPS) 5/579 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1130/1709 variables, 579/641 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1709 variables, 19/660 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1709 variables, 0/660 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1709 variables, 0/660 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1709/1709 variables, and 660 constraints, problems are : Problem set: 1 solved, 2 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 579/579 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/41 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 533/574 variables, 56/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 12:09:17] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 1/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/579 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1130/1709 variables, 579/642 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1709 variables, 19/661 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1709 variables, 2/663 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1709 variables, 0/663 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1709 variables, 0/663 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 663 constraints, problems are : Problem set: 1 solved, 2 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 579/579 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1505ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 4333 steps, including 57 resets, run visited all 2 properties in 22 ms. (steps per millisecond=196 )
Parikh walk visited 2 properties in 28 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(!p1)))))'
Support contains 5 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 570 transition count 1121
Ensure Unique test removed 3 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 21 place count 567 transition count 1121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 24 place count 567 transition count 1118
Applied a total of 24 rules in 19 ms. Remains 567 /579 variables (removed 12) and now considering 1118/1136 (removed 18) transitions.
// Phase 1: matrix 1118 rows 567 cols
[2024-06-01 12:09:18] [INFO ] Computed 59 invariants in 10 ms
[2024-06-01 12:09:18] [INFO ] Implicit Places using invariants in 181 ms returned [370, 533]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 182 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/579 places, 1118/1136 transitions.
Applied a total of 0 rules in 11 ms. Remains 565 /565 variables (removed 0) and now considering 1118/1118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 214 ms. Remains : 565/579 places, 1118/1136 transitions.
Stuttering acceptance computed with spot in 254 ms :[p1, p1, p1, true]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 900 steps with 0 reset in 18 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-00 finished in 551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(p0))))||F(p1)))'
Support contains 3 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 569 transition count 1121
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 23 place count 566 transition count 1121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 27 place count 566 transition count 1117
Applied a total of 27 rules in 18 ms. Remains 566 /579 variables (removed 13) and now considering 1117/1136 (removed 19) transitions.
[2024-06-01 12:09:18] [INFO ] Flow matrix only has 1115 transitions (discarded 2 similar events)
// Phase 1: matrix 1115 rows 566 cols
[2024-06-01 12:09:18] [INFO ] Computed 59 invariants in 4 ms
[2024-06-01 12:09:19] [INFO ] Implicit Places using invariants in 217 ms returned [370, 532]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 226 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 564/579 places, 1117/1136 transitions.
Applied a total of 0 rules in 9 ms. Remains 564 /564 variables (removed 0) and now considering 1117/1117 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 254 ms. Remains : 564/579 places, 1117/1136 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 458 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 9 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-01 finished in 915 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(G((p1||X(p2))))&&p0)))'
Support contains 4 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 569 transition count 1121
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 23 place count 566 transition count 1121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 27 place count 566 transition count 1117
Applied a total of 27 rules in 19 ms. Remains 566 /579 variables (removed 13) and now considering 1117/1136 (removed 19) transitions.
[2024-06-01 12:09:19] [INFO ] Flow matrix only has 1115 transitions (discarded 2 similar events)
// Phase 1: matrix 1115 rows 566 cols
[2024-06-01 12:09:19] [INFO ] Computed 59 invariants in 7 ms
[2024-06-01 12:09:20] [INFO ] Implicit Places using invariants in 137 ms returned [370, 532]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 139 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 564/579 places, 1117/1136 transitions.
Applied a total of 0 rules in 6 ms. Remains 564 /564 variables (removed 0) and now considering 1117/1117 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 164 ms. Remains : 564/579 places, 1117/1136 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-02 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Graph (trivial) has 712 edges and 579 vertex of which 107 / 579 are part of one of the 9 SCC in 4 ms
Free SCC test removed 98 places
Ensure Unique test removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 478 transition count 890
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 465 transition count 890
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 38 place count 455 transition count 874
Ensure Unique test removed 3 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 51 place count 452 transition count 874
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 57 place count 452 transition count 868
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 63 place count 448 transition count 866
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 147 places in 1 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 357 place count 301 transition count 677
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 438 place count 301 transition count 596
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 468 place count 286 transition count 575
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 479 place count 286 transition count 564
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 507 place count 272 transition count 572
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 512 place count 272 transition count 567
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 7 with 70 rules applied. Total rules applied 582 place count 272 transition count 497
Applied a total of 582 rules in 115 ms. Remains 272 /579 variables (removed 307) and now considering 497/1136 (removed 639) transitions.
// Phase 1: matrix 497 rows 272 cols
[2024-06-01 12:09:20] [INFO ] Computed 54 invariants in 2 ms
[2024-06-01 12:09:20] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-01 12:09:20] [INFO ] Invariant cache hit.
[2024-06-01 12:09:20] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 12:09:20] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-06-01 12:09:20] [INFO ] Redundant transitions in 152 ms returned [383, 389, 391, 392, 399, 405, 407, 411, 415, 417, 418, 420, 421, 427, 429, 431, 436, 438, 439]
Found 19 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
Running 443 sub problems to find dead transitions.
// Phase 1: matrix 478 rows 272 cols
[2024-06-01 12:09:21] [INFO ] Computed 54 invariants in 2 ms
[2024-06-01 12:09:21] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 477/749 variables, 272/326 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 14/340 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/749 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 0/749 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 443 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/750 variables, and 340 constraints, problems are : Problem set: 0 solved, 443 unsolved in 15881 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 272/272 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 477/749 variables, 272/326 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 14/340 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/749 variables, 443/783 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/749 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (OVERLAPS) 0/749 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 443 unsolved
No progress, stopping.
After SMT solving in domain Int declared 749/750 variables, and 783 constraints, problems are : Problem set: 0 solved, 443 unsolved in 18247 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 272/272 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 0/0 constraints]
After SMT, in 34262ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 34270ms
Starting structural reductions in SI_LTL mode, iteration 1 : 272/579 places, 478/1136 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 272 transition count 473
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 267 transition count 473
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 262 transition count 468
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 260 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 260 transition count 466
Applied a total of 26 rules in 31 ms. Remains 260 /272 variables (removed 12) and now considering 466/478 (removed 12) transitions.
// Phase 1: matrix 466 rows 260 cols
[2024-06-01 12:09:55] [INFO ] Computed 54 invariants in 3 ms
[2024-06-01 12:09:55] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 12:09:55] [INFO ] Invariant cache hit.
[2024-06-01 12:09:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 12:09:55] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 260/579 places, 466/1136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35414 ms. Remains : 260/579 places, 466/1136 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-03 finished in 35468 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)&&(p1||(p2&&X(p1))))))'
Support contains 3 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 569 transition count 1119
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 23 place count 566 transition count 1119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 566 transition count 1116
Applied a total of 26 rules in 16 ms. Remains 566 /579 variables (removed 13) and now considering 1116/1136 (removed 20) transitions.
// Phase 1: matrix 1116 rows 566 cols
[2024-06-01 12:09:55] [INFO ] Computed 59 invariants in 9 ms
[2024-06-01 12:09:55] [INFO ] Implicit Places using invariants in 163 ms returned [370, 532]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 164 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 564/579 places, 1116/1136 transitions.
Applied a total of 0 rules in 7 ms. Remains 564 /564 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 564/579 places, 1116/1136 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-04
Product exploration explored 100000 steps with 27 reset in 388 ms.
Stack based approach found an accepted trace after 161 steps with 0 reset with depth 162 and stack size 162 in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-04 finished in 775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)&&(p2||F(p3))))))'
Support contains 4 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 569 transition count 1119
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 23 place count 566 transition count 1119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 566 transition count 1116
Applied a total of 26 rules in 11 ms. Remains 566 /579 variables (removed 13) and now considering 1116/1136 (removed 20) transitions.
// Phase 1: matrix 1116 rows 566 cols
[2024-06-01 12:09:56] [INFO ] Computed 59 invariants in 4 ms
[2024-06-01 12:09:56] [INFO ] Implicit Places using invariants in 144 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/579 places, 1116/1136 transitions.
Applied a total of 0 rules in 5 ms. Remains 565 /565 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 162 ms. Remains : 565/579 places, 1116/1136 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), true]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-05
Entered a terminal (fully accepting) state of product in 484 steps with 0 reset in 8 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-05 finished in 437 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(p0))||(!p1&&F(!p2))) U (p0&&(X(G(p0))||(!p1&&F(!p2)))))))'
Support contains 5 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 570 transition count 1122
Ensure Unique test removed 3 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 21 place count 567 transition count 1122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 25 place count 567 transition count 1118
Applied a total of 25 rules in 11 ms. Remains 567 /579 variables (removed 12) and now considering 1118/1136 (removed 18) transitions.
[2024-06-01 12:09:56] [INFO ] Flow matrix only has 1116 transitions (discarded 2 similar events)
// Phase 1: matrix 1116 rows 567 cols
[2024-06-01 12:09:56] [INFO ] Computed 59 invariants in 6 ms
[2024-06-01 12:09:57] [INFO ] Implicit Places using invariants in 140 ms returned [371, 533]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 142 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/579 places, 1118/1136 transitions.
Applied a total of 0 rules in 5 ms. Remains 565 /565 variables (removed 0) and now considering 1118/1118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 565/579 places, 1118/1136 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), true, p2]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-09
Entered a terminal (fully accepting) state of product in 5134 steps with 4 reset in 25 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-09 finished in 524 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)&&F(p1))))'
Support contains 2 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Graph (trivial) has 707 edges and 579 vertex of which 107 / 579 are part of one of the 9 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 478 transition count 890
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 465 transition count 890
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 38 place count 455 transition count 874
Ensure Unique test removed 3 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 51 place count 452 transition count 874
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 57 place count 452 transition count 868
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 63 place count 448 transition count 866
Performed 146 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 4 with 292 rules applied. Total rules applied 355 place count 302 transition count 678
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 435 place count 302 transition count 598
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 459 place count 290 transition count 583
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 469 place count 290 transition count 573
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 497 place count 276 transition count 581
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 502 place count 276 transition count 576
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 7 with 71 rules applied. Total rules applied 573 place count 276 transition count 505
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 573 place count 276 transition count 504
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 575 place count 275 transition count 504
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 7 with 2 rules applied. Total rules applied 577 place count 274 transition count 504
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 581 place count 274 transition count 500
Applied a total of 581 rules in 71 ms. Remains 274 /579 variables (removed 305) and now considering 500/1136 (removed 636) transitions.
// Phase 1: matrix 500 rows 274 cols
[2024-06-01 12:09:57] [INFO ] Computed 54 invariants in 2 ms
[2024-06-01 12:09:57] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 12:09:57] [INFO ] Invariant cache hit.
[2024-06-01 12:09:57] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 12:09:57] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-01 12:09:57] [INFO ] Redundant transitions in 117 ms returned [384, 390, 392, 393, 400, 406, 408, 412, 416, 418, 419, 421, 422, 428, 430, 432, 437, 439, 440]
Found 19 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
Running 446 sub problems to find dead transitions.
// Phase 1: matrix 481 rows 274 cols
[2024-06-01 12:09:57] [INFO ] Computed 54 invariants in 2 ms
[2024-06-01 12:09:57] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 480/754 variables, 274/328 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/754 variables, 14/342 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/754 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (OVERLAPS) 0/754 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 446 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/755 variables, and 342 constraints, problems are : Problem set: 0 solved, 446 unsolved in 15687 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 274/274 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 480/754 variables, 274/328 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/754 variables, 14/342 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/754 variables, 446/788 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 2 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2024-06-01 12:10:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/754 variables, 3/791 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (OVERLAPS) 0/754 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 446 unsolved
No progress, stopping.
After SMT solving in domain Int declared 754/755 variables, and 791 constraints, problems are : Problem set: 0 solved, 446 unsolved in 25854 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 274/274 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 3/3 constraints]
After SMT, in 41641ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 41647ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/579 places, 481/1136 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 274 transition count 476
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 269 transition count 476
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 264 transition count 471
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 262 transition count 471
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 262 transition count 469
Applied a total of 26 rules in 52 ms. Remains 262 /274 variables (removed 12) and now considering 469/481 (removed 12) transitions.
// Phase 1: matrix 469 rows 262 cols
[2024-06-01 12:10:39] [INFO ] Computed 54 invariants in 2 ms
[2024-06-01 12:10:39] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 12:10:39] [INFO ] Invariant cache hit.
[2024-06-01 12:10:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 12:10:39] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 262/579 places, 469/1136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42559 ms. Remains : 262/579 places, 469/1136 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-10 finished in 42698 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((G(F(!p0)) U p1))))'
Support contains 4 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 569 transition count 1119
Ensure Unique test removed 2 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 567 transition count 1119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 567 transition count 1116
Applied a total of 25 rules in 13 ms. Remains 567 /579 variables (removed 12) and now considering 1116/1136 (removed 20) transitions.
// Phase 1: matrix 1116 rows 567 cols
[2024-06-01 12:10:40] [INFO ] Computed 60 invariants in 3 ms
[2024-06-01 12:10:40] [INFO ] Implicit Places using invariants in 129 ms returned [369, 532]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 130 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/579 places, 1116/1136 transitions.
Applied a total of 0 rules in 5 ms. Remains 565 /565 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 565/579 places, 1116/1136 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), p0, p0, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-11
Product exploration explored 100000 steps with 114 reset in 371 ms.
Stack based approach found an accepted trace after 6366 steps with 5 reset with depth 2603 and stack size 2583 in 30 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-11 finished in 795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 568 transition count 1118
Ensure Unique test removed 3 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 25 place count 565 transition count 1118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 29 place count 565 transition count 1114
Applied a total of 29 rules in 16 ms. Remains 565 /579 variables (removed 14) and now considering 1114/1136 (removed 22) transitions.
// Phase 1: matrix 1114 rows 565 cols
[2024-06-01 12:10:40] [INFO ] Computed 59 invariants in 6 ms
[2024-06-01 12:10:41] [INFO ] Implicit Places using invariants in 144 ms returned [369, 531]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 146 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 563/579 places, 1114/1136 transitions.
Applied a total of 0 rules in 5 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 168 ms. Remains : 563/579 places, 1114/1136 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-12 finished in 280 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(G((F(X(((F(p2)||(p3 U p4))&&p1)))&&p0)))))'
Support contains 7 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Graph (trivial) has 702 edges and 579 vertex of which 106 / 579 are part of one of the 9 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 482 transition count 896
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 471 transition count 895
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 470 transition count 895
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 35 place count 460 transition count 879
Ensure Unique test removed 3 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 48 place count 457 transition count 879
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 54 place count 457 transition count 873
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 56 place count 455 transition count 873
Performed 142 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 5 with 284 rules applied. Total rules applied 340 place count 313 transition count 699
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 5 with 86 rules applied. Total rules applied 426 place count 313 transition count 613
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 456 place count 298 transition count 592
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 467 place count 298 transition count 581
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 495 place count 284 transition count 589
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 500 place count 284 transition count 584
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 8 with 69 rules applied. Total rules applied 569 place count 284 transition count 515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 570 place count 283 transition count 515
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 570 place count 283 transition count 512
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 576 place count 280 transition count 512
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 578 place count 279 transition count 511
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 579 place count 279 transition count 511
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 581 place count 279 transition count 509
Applied a total of 581 rules in 80 ms. Remains 279 /579 variables (removed 300) and now considering 509/1136 (removed 627) transitions.
[2024-06-01 12:10:41] [INFO ] Flow matrix only has 501 transitions (discarded 8 similar events)
// Phase 1: matrix 501 rows 279 cols
[2024-06-01 12:10:41] [INFO ] Computed 58 invariants in 3 ms
[2024-06-01 12:10:41] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 12:10:41] [INFO ] Flow matrix only has 501 transitions (discarded 8 similar events)
[2024-06-01 12:10:41] [INFO ] Invariant cache hit.
[2024-06-01 12:10:41] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-01 12:10:41] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-06-01 12:10:41] [INFO ] Redundant transitions in 5 ms returned []
Running 508 sub problems to find dead transitions.
[2024-06-01 12:10:41] [INFO ] Flow matrix only has 501 transitions (discarded 8 similar events)
[2024-06-01 12:10:41] [INFO ] Invariant cache hit.
[2024-06-01 12:10:41] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (OVERLAPS) 500/779 variables, 279/337 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 50/387 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 8 (OVERLAPS) 1/780 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/780 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 10 (OVERLAPS) 0/780 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 508 unsolved
No progress, stopping.
After SMT solving in domain Real declared 780/780 variables, and 388 constraints, problems are : Problem set: 0 solved, 508 unsolved in 28585 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 279/279 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 508 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (OVERLAPS) 500/779 variables, 279/337 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 50/387 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 508/895 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/779 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 9 (OVERLAPS) 1/780 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/780 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 780/780 variables, and 896 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 279/279 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 0/0 constraints]
After SMT, in 58744ms problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 58749ms
Starting structural reductions in SI_LTL mode, iteration 1 : 279/579 places, 509/1136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59179 ms. Remains : 279/579 places, 509/1136 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p4))), (OR (NOT p1) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p4))), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-13 finished in 59376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Graph (trivial) has 715 edges and 579 vertex of which 107 / 579 are part of one of the 9 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 478 transition count 890
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 465 transition count 890
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 37 place count 456 transition count 875
Ensure Unique test removed 2 places
Iterating global reduction 2 with 11 rules applied. Total rules applied 48 place count 454 transition count 875
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 54 place count 454 transition count 869
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 60 place count 450 transition count 867
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 354 place count 303 transition count 678
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 4 with 82 rules applied. Total rules applied 436 place count 303 transition count 596
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 466 place count 288 transition count 575
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 477 place count 288 transition count 564
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 505 place count 274 transition count 572
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 510 place count 274 transition count 567
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 7 with 71 rules applied. Total rules applied 581 place count 274 transition count 496
Applied a total of 581 rules in 44 ms. Remains 274 /579 variables (removed 305) and now considering 496/1136 (removed 640) transitions.
// Phase 1: matrix 496 rows 274 cols
[2024-06-01 12:11:40] [INFO ] Computed 55 invariants in 2 ms
[2024-06-01 12:11:40] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 12:11:40] [INFO ] Invariant cache hit.
[2024-06-01 12:11:40] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 12:11:40] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2024-06-01 12:11:41] [INFO ] Redundant transitions in 115 ms returned [386, 391, 398, 404, 406, 410, 414, 416, 417, 419, 420, 426, 428, 430, 435, 437, 438]
Found 17 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 17 transitions
Redundant transitions reduction (with SMT) removed 17 transitions.
Running 444 sub problems to find dead transitions.
// Phase 1: matrix 479 rows 274 cols
[2024-06-01 12:11:41] [INFO ] Computed 55 invariants in 1 ms
[2024-06-01 12:11:41] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (OVERLAPS) 478/752 variables, 274/329 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 14/343 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (OVERLAPS) 0/752 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 444 unsolved
No progress, stopping.
After SMT solving in domain Real declared 752/753 variables, and 343 constraints, problems are : Problem set: 0 solved, 444 unsolved in 19253 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (OVERLAPS) 478/752 variables, 274/329 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 14/343 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 444/787 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (OVERLAPS) 0/752 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 444 unsolved
No progress, stopping.
After SMT solving in domain Int declared 752/753 variables, and 787 constraints, problems are : Problem set: 0 solved, 444 unsolved in 17711 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 0/0 constraints]
After SMT, in 37076ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 37080ms
Starting structural reductions in SI_LTL mode, iteration 1 : 274/579 places, 479/1136 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 274 transition count 475
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 270 transition count 475
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 266 transition count 471
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 264 transition count 471
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 264 transition count 469
Applied a total of 22 rules in 23 ms. Remains 264 /274 variables (removed 10) and now considering 469/479 (removed 10) transitions.
// Phase 1: matrix 469 rows 264 cols
[2024-06-01 12:12:18] [INFO ] Computed 55 invariants in 1 ms
[2024-06-01 12:12:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 12:12:18] [INFO ] Invariant cache hit.
[2024-06-01 12:12:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 12:12:18] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 264/579 places, 469/1136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37950 ms. Remains : 264/579 places, 469/1136 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-14
Stuttering criterion allowed to conclude after 7439 steps with 0 reset in 45 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-14 finished in 38056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 1136/1136 transitions.
Graph (trivial) has 710 edges and 579 vertex of which 106 / 579 are part of one of the 9 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 479 transition count 894
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 466 transition count 894
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 38 place count 456 transition count 878
Ensure Unique test removed 3 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 51 place count 453 transition count 878
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 57 place count 453 transition count 872
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 63 place count 449 transition count 870
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 357 place count 302 transition count 681
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 438 place count 302 transition count 600
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 468 place count 287 transition count 579
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 479 place count 287 transition count 568
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 507 place count 273 transition count 576
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 512 place count 273 transition count 571
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 7 with 70 rules applied. Total rules applied 582 place count 273 transition count 501
Applied a total of 582 rules in 42 ms. Remains 273 /579 variables (removed 306) and now considering 501/1136 (removed 635) transitions.
// Phase 1: matrix 501 rows 273 cols
[2024-06-01 12:12:18] [INFO ] Computed 54 invariants in 1 ms
[2024-06-01 12:12:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 12:12:18] [INFO ] Invariant cache hit.
[2024-06-01 12:12:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 12:12:19] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-06-01 12:12:19] [INFO ] Redundant transitions in 122 ms returned [388, 394, 396, 397, 404, 410, 412, 416, 420, 422, 423, 425, 426, 434, 436, 440, 442, 443]
Found 18 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 18 transitions
Redundant transitions reduction (with SMT) removed 18 transitions.
Running 446 sub problems to find dead transitions.
// Phase 1: matrix 483 rows 273 cols
[2024-06-01 12:12:19] [INFO ] Computed 54 invariants in 1 ms
[2024-06-01 12:12:19] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 482/755 variables, 273/327 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/755 variables, 14/341 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (OVERLAPS) 0/755 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 446 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/756 variables, and 341 constraints, problems are : Problem set: 0 solved, 446 unsolved in 14362 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 273/273 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 482/755 variables, 273/327 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/755 variables, 14/341 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 446/787 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-06-01 12:12:37] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/755 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/755 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (OVERLAPS) 0/755 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 446 unsolved
No progress, stopping.
After SMT solving in domain Int declared 755/756 variables, and 788 constraints, problems are : Problem set: 0 solved, 446 unsolved in 25174 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 273/273 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 1/1 constraints]
After SMT, in 39607ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 39611ms
Starting structural reductions in SI_LTL mode, iteration 1 : 273/579 places, 483/1136 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 273 transition count 478
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 268 transition count 478
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 264 transition count 474
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 262 transition count 474
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 262 transition count 472
Applied a total of 24 rules in 21 ms. Remains 262 /273 variables (removed 11) and now considering 472/483 (removed 11) transitions.
// Phase 1: matrix 472 rows 262 cols
[2024-06-01 12:12:58] [INFO ] Computed 54 invariants in 3 ms
[2024-06-01 12:12:59] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 12:12:59] [INFO ] Invariant cache hit.
[2024-06-01 12:12:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-01 12:12:59] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 262/579 places, 472/1136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40611 ms. Remains : 262/579 places, 472/1136 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-15 finished in 40754 ms.
All properties solved by simple procedures.
Total runtime 226127 ms.
ITS solved all properties within timeout

BK_STOP 1717243979449

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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