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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 07:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 07:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 07:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 07:33 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 133K 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-3A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-3A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717240707184

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:18:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:18:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:18:28] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-06-01 11:18:28] [INFO ] Transformed 370 places.
[2024-06-01 11:18:28] [INFO ] Transformed 450 transitions.
[2024-06-01 11:18:28] [INFO ] Found NUPN structural information;
[2024-06-01 11:18:28] [INFO ] Parsed PT model containing 370 places and 450 transitions and 1773 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-3A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 352 transition count 449
Discarding 110 places :
Symmetric choice reduction at 1 with 110 rule applications. Total rules 128 place count 242 transition count 314
Ensure Unique test removed 40 places
Iterating global reduction 1 with 150 rules applied. Total rules applied 278 place count 202 transition count 314
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 345 place count 202 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 369 place count 202 transition count 223
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 378 place count 193 transition count 223
Applied a total of 378 rules in 75 ms. Remains 193 /370 variables (removed 177) and now considering 223/449 (removed 226) transitions.
[2024-06-01 11:18:28] [INFO ] Flow matrix only has 215 transitions (discarded 8 similar events)
// Phase 1: matrix 215 rows 193 cols
[2024-06-01 11:18:28] [INFO ] Computed 60 invariants in 18 ms
[2024-06-01 11:18:29] [INFO ] Implicit Places using invariants in 254 ms returned [82, 86, 119]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 286 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/370 places, 223/449 transitions.
Applied a total of 0 rules in 8 ms. Remains 190 /190 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 385 ms. Remains : 190/370 places, 223/449 transitions.
Support contains 11 out of 190 places after structural reductions.
[2024-06-01 11:18:29] [INFO ] Flatten gal took : 44 ms
[2024-06-01 11:18:29] [INFO ] Flatten gal took : 24 ms
[2024-06-01 11:18:29] [INFO ] Input system was already deterministic with 223 transitions.
RANDOM walk for 18820 steps (5 resets) in 652 ms. (28 steps per ms) remains 0/6 properties
FORMULA NoC3x3-PT-3A-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 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((F(p0)||G(p1))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 223/223 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 186 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 186 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 186 transition count 216
Applied a total of 11 rules in 18 ms. Remains 186 /190 variables (removed 4) and now considering 216/223 (removed 7) transitions.
[2024-06-01 11:18:29] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2024-06-01 11:18:29] [INFO ] Computed 57 invariants in 1 ms
[2024-06-01 11:18:29] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 11:18:29] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2024-06-01 11:18:29] [INFO ] Invariant cache hit.
[2024-06-01 11:18:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 11:18:30] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-01 11:18:30] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2024-06-01 11:18:30] [INFO ] Invariant cache hit.
[2024-06-01 11:18:30] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 207/393 variables, 186/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/394 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 253 constraints, problems are : Problem set: 0 solved, 215 unsolved in 8489 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 186/186 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 207/393 variables, 186/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 215/467 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 468 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9890 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 186/186 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 18482ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 18508ms
Starting structural reductions in LTL mode, iteration 1 : 186/190 places, 216/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18809 ms. Remains : 186/190 places, 216/223 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-04 finished in 19137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 223/223 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 187 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 187 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 187 transition count 218
Applied a total of 8 rules in 9 ms. Remains 187 /190 variables (removed 3) and now considering 218/223 (removed 5) transitions.
[2024-06-01 11:18:48] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 187 cols
[2024-06-01 11:18:48] [INFO ] Computed 57 invariants in 5 ms
[2024-06-01 11:18:49] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 11:18:49] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-06-01 11:18:49] [INFO ] Invariant cache hit.
[2024-06-01 11:18:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 11:18:49] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-01 11:18:49] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-06-01 11:18:49] [INFO ] Invariant cache hit.
[2024-06-01 11:18:49] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 209/396 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/397 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/397 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 254 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8069 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 209/396 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 217/470 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 471 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9892 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 18003ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 18007ms
Starting structural reductions in LTL mode, iteration 1 : 187/190 places, 218/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18262 ms. Remains : 187/190 places, 218/223 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-09 finished in 18568 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 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 223/223 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 189 transition count 161
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 137 place count 120 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 137 place count 120 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 118 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 140 place count 118 transition count 152
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 116 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 146 place count 116 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 116 transition count 148
Applied a total of 147 rules in 26 ms. Remains 116 /190 variables (removed 74) and now considering 148/223 (removed 75) transitions.
// Phase 1: matrix 148 rows 116 cols
[2024-06-01 11:19:07] [INFO ] Computed 47 invariants in 1 ms
[2024-06-01 11:19:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 11:19:07] [INFO ] Invariant cache hit.
[2024-06-01 11:19:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 11:19:07] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-01 11:19:07] [INFO ] Redundant transitions in 60 ms returned [24, 30, 31, 42, 43, 71, 72, 75, 85, 98, 99, 101, 105, 108, 109, 110, 129, 130, 132, 135, 136, 137, 138, 144]
Found 24 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 24 transitions
Redundant transitions reduction (with SMT) removed 24 transitions.
Running 99 sub problems to find dead transitions.
// Phase 1: matrix 124 rows 116 cols
[2024-06-01 11:19:07] [INFO ] Computed 47 invariants in 1 ms
[2024-06-01 11:19:07] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 11/116 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 123/239 variables, 116/163 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/240 variables, and 172 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1823 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 11/116 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 123/239 variables, 116/163 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 99/271 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/239 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/240 variables, and 271 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1759 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 3598ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 3599ms
Starting structural reductions in SI_LTL mode, iteration 1 : 116/190 places, 124/223 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 116 transition count 114
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 96 transition count 114
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 96 transition count 111
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 44 edges and 90 vertex of which 14 / 90 are part of one of the 7 SCC in 2 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 43 place count 83 transition count 108
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 50 place count 83 transition count 101
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 74 place count 67 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 65 transition count 91
Graph (trivial) has 35 edges and 65 vertex of which 10 / 65 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 60 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 84 place count 60 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 100 place count 60 transition count 70
Applied a total of 100 rules in 32 ms. Remains 60 /116 variables (removed 56) and now considering 70/124 (removed 54) transitions.
[2024-06-01 11:19:11] [INFO ] Flow matrix only has 68 transitions (discarded 2 similar events)
// Phase 1: matrix 68 rows 60 cols
[2024-06-01 11:19:11] [INFO ] Computed 26 invariants in 1 ms
[2024-06-01 11:19:11] [INFO ] Implicit Places using invariants in 47 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/190 places, 70/223 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 70
Applied a total of 1 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-06-01 11:19:11] [INFO ] Flow matrix only has 68 transitions (discarded 2 similar events)
// Phase 1: matrix 68 rows 59 cols
[2024-06-01 11:19:11] [INFO ] Computed 25 invariants in 1 ms
[2024-06-01 11:19:11] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 11:19:11] [INFO ] Flow matrix only has 68 transitions (discarded 2 similar events)
[2024-06-01 11:19:11] [INFO ] Invariant cache hit.
[2024-06-01 11:19:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 11:19:11] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 59/190 places, 70/223 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4047 ms. Remains : 59/190 places, 70/223 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLCardinality-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLCardinality-12 finished in 4088 ms.
All properties solved by simple procedures.
Total runtime 43218 ms.
ITS solved all properties within timeout

BK_STOP 1717240751667

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-3A"
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 NoC3x3-PT-3A, 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-171654352000587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3A.tgz
mv NoC3x3-PT-3A 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 ;