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.r245-tall-171654350300635.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 greatspnxred
Input is NoC3x3-PT-6A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350300635
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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 May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 07:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 07:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 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 297K 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-6A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-6A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716692750189

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 03:05:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 03:05:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:05:51] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-26 03:05:51] [INFO ] Transformed 512 places.
[2024-05-26 03:05:51] [INFO ] Transformed 1117 transitions.
[2024-05-26 03:05:51] [INFO ] Found NUPN structural information;
[2024-05-26 03:05:51] [INFO ] Parsed PT model containing 512 places and 1117 transitions and 4279 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-6A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 1117/1117 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 441 transition count 829
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 441 transition count 829
Applied a total of 142 rules in 81 ms. Remains 441 /512 variables (removed 71) and now considering 829/1117 (removed 288) transitions.
[2024-05-26 03:05:51] [INFO ] Flow matrix only has 824 transitions (discarded 5 similar events)
// Phase 1: matrix 824 rows 441 cols
[2024-05-26 03:05:51] [INFO ] Computed 66 invariants in 26 ms
[2024-05-26 03:05:52] [INFO ] Implicit Places using invariants in 467 ms returned [10, 45, 94, 133, 192, 283, 335, 373, 423]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 501 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 432/512 places, 829/1117 transitions.
Applied a total of 0 rules in 15 ms. Remains 432 /432 variables (removed 0) and now considering 829/829 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 620 ms. Remains : 432/512 places, 829/1117 transitions.
Support contains 30 out of 432 places after structural reductions.
[2024-05-26 03:05:52] [INFO ] Flatten gal took : 105 ms
[2024-05-26 03:05:52] [INFO ] Flatten gal took : 59 ms
[2024-05-26 03:05:52] [INFO ] Input system was already deterministic with 829 transitions.
Support contains 29 out of 432 places (down from 30) after GAL structural reductions.
RANDOM walk for 29653 steps (74 resets) in 1093 ms. (27 steps per ms) remains 0/18 properties
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' '!((F(G(p0))||((X(p1) U ((p2&&X(p1))||X(G(p1)))) U (G((X(p1) U ((p2&&X(p1))||X(G(p1)))))||(X(!p3)&&(X(p1) U ((p2&&X(p1))||X(G(p1)))))))))'
Support contains 7 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 424 transition count 800
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 424 transition count 800
Applied a total of 16 rules in 14 ms. Remains 424 /432 variables (removed 8) and now considering 800/829 (removed 29) transitions.
[2024-05-26 03:05:53] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
// Phase 1: matrix 798 rows 424 cols
[2024-05-26 03:05:53] [INFO ] Computed 57 invariants in 11 ms
[2024-05-26 03:05:53] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-26 03:05:53] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
[2024-05-26 03:05:53] [INFO ] Invariant cache hit.
[2024-05-26 03:05:54] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:05:54] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 799 sub problems to find dead transitions.
[2024-05-26 03:05:54] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
[2024-05-26 03:05:54] [INFO ] Invariant cache hit.
[2024-05-26 03:05:54] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 3 (OVERLAPS) 798/1222 variables, 424/481 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1222 variables, 17/498 constraints. Problems are: Problem set: 0 solved, 799 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 498 constraints, problems are : Problem set: 0 solved, 799 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 799/799 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 799 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 3 (OVERLAPS) 798/1222 variables, 424/481 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1222 variables, 17/498 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1222 variables, 799/1297 constraints. Problems are: Problem set: 0 solved, 799 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1222/1222 variables, and 1297 constraints, problems are : Problem set: 0 solved, 799 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 799/799 constraints, Known Traps: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 799 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Starting structural reductions in LTL mode, iteration 1 : 424/432 places, 800/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61213 ms. Remains : 424/432 places, 800/829 transitions.
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-00
Product exploration explored 100000 steps with 28528 reset in 969 ms.
Product exploration explored 100000 steps with 28533 reset in 905 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p3), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p2) p3)), (X p1), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p3)), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p3))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 234 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 22722 steps (58 resets) in 329 ms. (68 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) p3 p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p3), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p2) p3)), (X p1), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p3)), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p3))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT p3)), (F p0), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 417 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 7 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 800/800 transitions.
Applied a total of 0 rules in 15 ms. Remains 424 /424 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2024-05-26 03:06:58] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
[2024-05-26 03:06:58] [INFO ] Invariant cache hit.
[2024-05-26 03:06:59] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-26 03:06:59] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
[2024-05-26 03:06:59] [INFO ] Invariant cache hit.
[2024-05-26 03:06:59] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:06:59] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
Running 799 sub problems to find dead transitions.
[2024-05-26 03:06:59] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
[2024-05-26 03:06:59] [INFO ] Invariant cache hit.
[2024-05-26 03:06:59] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 3 (OVERLAPS) 798/1222 variables, 424/481 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1222 variables, 17/498 constraints. Problems are: Problem set: 0 solved, 799 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 498 constraints, problems are : Problem set: 0 solved, 799 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 799/799 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 799 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 3 (OVERLAPS) 798/1222 variables, 424/481 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1222 variables, 17/498 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1222 variables, 799/1297 constraints. Problems are: Problem set: 0 solved, 799 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1222/1222 variables, and 1297 constraints, problems are : Problem set: 0 solved, 799 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 799/799 constraints, Known Traps: 0/0 constraints]
After SMT, in 60393ms problems are : Problem set: 0 solved, 799 unsolved
Search for dead transitions found 0 dead transitions in 60399ms
Finished structural reductions in LTL mode , in 1 iterations and 61260 ms. Remains : 424/424 places, 800/800 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X p3), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p2) p3)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 214 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 31983 steps (87 resets) in 219 ms. (145 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p3 (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X p3), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p2) p3)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (NOT p2) p3))), (F p2), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT p3)), (F p0), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 400 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 23507 reset in 593 ms.
Product exploration explored 100000 steps with 23446 reset in 611 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 7 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 800/800 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 424 transition count 800
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 27 places in 1 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 424 transition count 831
Deduced a syphon composed of 27 places in 1 ms
Applied a total of 27 rules in 126 ms. Remains 424 /424 variables (removed 0) and now considering 831/800 (removed -31) transitions.
[2024-05-26 03:08:03] [INFO ] Redundant transitions in 55 ms returned []
Running 823 sub problems to find dead transitions.
[2024-05-26 03:08:03] [INFO ] Flow matrix only has 829 transitions (discarded 2 similar events)
// Phase 1: matrix 829 rows 424 cols
[2024-05-26 03:08:03] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:08:03] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 823 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 823 unsolved
[2024-05-26 03:08:14] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 7 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-26 03:08:15] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-26 03:08:15] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-26 03:08:15] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-05-26 03:08:16] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
Problem TDEAD221 is UNSAT
[2024-05-26 03:08:16] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
Problem TDEAD255 is UNSAT
[2024-05-26 03:08:17] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Problem TDEAD302 is UNSAT
[2024-05-26 03:08:17] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD327 is UNSAT
[2024-05-26 03:08:17] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
Problem TDEAD377 is UNSAT
[2024-05-26 03:08:18] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD400 is UNSAT
[2024-05-26 03:08:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD402 is UNSAT
[2024-05-26 03:08:18] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
Problem TDEAD408 is UNSAT
[2024-05-26 03:08:18] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Problem TDEAD435 is UNSAT
[2024-05-26 03:08:18] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Problem TDEAD451 is UNSAT
[2024-05-26 03:08:18] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
Problem TDEAD465 is UNSAT
[2024-05-26 03:08:18] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
Problem TDEAD480 is UNSAT
[2024-05-26 03:08:19] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
Problem TDEAD500 is UNSAT
[2024-05-26 03:08:19] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
Problem TDEAD542 is UNSAT
[2024-05-26 03:08:19] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Problem TDEAD574 is UNSAT
[2024-05-26 03:08:19] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD593 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 20/77 constraints. Problems are: Problem set: 20 solved, 803 unsolved
[2024-05-26 03:08:24] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 2 ms to minimize.
Problem TDEAD621 is UNSAT
[2024-05-26 03:08:24] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD647 is UNSAT
[2024-05-26 03:08:25] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
Problem TDEAD663 is UNSAT
[2024-05-26 03:08:25] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD707 is UNSAT
[2024-05-26 03:08:25] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
[2024-05-26 03:08:25] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
[2024-05-26 03:08:25] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 7/84 constraints. Problems are: Problem set: 30 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/1253 variables, and 84 constraints, problems are : Problem set: 30 solved, 793 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/424 constraints, ReadFeed: 0/43 constraints, PredecessorRefiner: 823/823 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 30 solved, 793 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 30 solved, 793 unsolved
At refinement iteration 1 (OVERLAPS) 28/424 variables, 57/57 constraints. Problems are: Problem set: 30 solved, 793 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 27/84 constraints. Problems are: Problem set: 30 solved, 793 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/84 constraints. Problems are: Problem set: 30 solved, 793 unsolved
At refinement iteration 4 (OVERLAPS) 829/1253 variables, 424/508 constraints. Problems are: Problem set: 30 solved, 793 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1253 variables, 43/551 constraints. Problems are: Problem set: 30 solved, 793 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 793/1344 constraints. Problems are: Problem set: 30 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/1253 variables, and 1344 constraints, problems are : Problem set: 30 solved, 793 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 793/823 constraints, Known Traps: 27/27 constraints]
After SMT, in 60474ms problems are : Problem set: 30 solved, 793 unsolved
Search for dead transitions found 30 dead transitions in 60505ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 424/424 places, 801/800 transitions.
Graph (complete) has 1833 edges and 424 vertex of which 397 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.4 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 31 ms. Remains 397 /424 variables (removed 27) and now considering 801/801 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 397/424 places, 801/800 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60740 ms. Remains : 397/424 places, 801/800 transitions.
Support contains 7 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 800/800 transitions.
Applied a total of 0 rules in 5 ms. Remains 424 /424 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2024-05-26 03:09:04] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
// Phase 1: matrix 798 rows 424 cols
[2024-05-26 03:09:04] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:09:04] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-26 03:09:04] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
[2024-05-26 03:09:04] [INFO ] Invariant cache hit.
[2024-05-26 03:09:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:09:04] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Running 799 sub problems to find dead transitions.
[2024-05-26 03:09:04] [INFO ] Flow matrix only has 798 transitions (discarded 2 similar events)
[2024-05-26 03:09:04] [INFO ] Invariant cache hit.
[2024-05-26 03:09:04] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 3 (OVERLAPS) 798/1222 variables, 424/481 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1222 variables, 17/498 constraints. Problems are: Problem set: 0 solved, 799 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 498 constraints, problems are : Problem set: 0 solved, 799 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 799/799 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 799 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 3 (OVERLAPS) 798/1222 variables, 424/481 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1222 variables, 17/498 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1222 variables, 799/1297 constraints. Problems are: Problem set: 0 solved, 799 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1222/1222 variables, and 1297 constraints, problems are : Problem set: 0 solved, 799 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 799/799 constraints, Known Traps: 0/0 constraints]
After SMT, in 60308ms problems are : Problem set: 0 solved, 799 unsolved
Search for dead transitions found 0 dead transitions in 60319ms
Finished structural reductions in LTL mode , in 1 iterations and 61044 ms. Remains : 424/424 places, 800/800 transitions.
Treatment of property NoC3x3-PT-6A-LTLCardinality-00 finished in 251791 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(X(G(p0)))))'
Support contains 3 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 422 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 422 transition count 787
Applied a total of 20 rules in 9 ms. Remains 422 /432 variables (removed 10) and now considering 787/829 (removed 42) transitions.
// Phase 1: matrix 787 rows 422 cols
[2024-05-26 03:10:05] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:10:05] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-26 03:10:05] [INFO ] Invariant cache hit.
[2024-05-26 03:10:05] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:10:06] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Running 786 sub problems to find dead transitions.
[2024-05-26 03:10:06] [INFO ] Invariant cache hit.
[2024-05-26 03:10:06] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (OVERLAPS) 787/1209 variables, 422/479 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1209/1209 variables, and 496 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 422/422 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (OVERLAPS) 787/1209 variables, 422/479 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1209 variables, 786/1282 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-26 03:11:01] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1209/1209 variables, and 1283 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 422/422 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 1/1 constraints]
After SMT, in 60310ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 60317ms
Starting structural reductions in LTL mode, iteration 1 : 422/432 places, 787/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61128 ms. Remains : 422/432 places, 787/829 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 3359 steps with 9 reset in 18 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLCardinality-02 finished in 61385 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) U (F(p1)&&G((p2||F(!p1))))))'
Support contains 3 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 422 transition count 791
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 422 transition count 791
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 66 place count 398 transition count 767
Applied a total of 66 rules in 49 ms. Remains 398 /432 variables (removed 34) and now considering 767/829 (removed 62) transitions.
[2024-05-26 03:11:06] [INFO ] Flow matrix only has 766 transitions (discarded 1 similar events)
// Phase 1: matrix 766 rows 398 cols
[2024-05-26 03:11:06] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:11:06] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-26 03:11:06] [INFO ] Flow matrix only has 766 transitions (discarded 1 similar events)
[2024-05-26 03:11:06] [INFO ] Invariant cache hit.
[2024-05-26 03:11:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:11:07] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-05-26 03:11:07] [INFO ] Redundant transitions in 8 ms returned []
Running 736 sub problems to find dead transitions.
[2024-05-26 03:11:07] [INFO ] Flow matrix only has 766 transitions (discarded 1 similar events)
[2024-05-26 03:11:07] [INFO ] Invariant cache hit.
[2024-05-26 03:11:07] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 2 (OVERLAPS) 9/398 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 4 (OVERLAPS) 766/1164 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1164 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1164 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 736 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 472 constraints, problems are : Problem set: 0 solved, 736 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 736/736 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 736 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 2 (OVERLAPS) 9/398 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 4 (OVERLAPS) 766/1164 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1164 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1164 variables, 736/1208 constraints. Problems are: Problem set: 0 solved, 736 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1208 constraints, problems are : Problem set: 0 solved, 736 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 736/736 constraints, Known Traps: 0/0 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 736 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Starting structural reductions in SI_LTL mode, iteration 1 : 398/432 places, 767/829 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61042 ms. Remains : 398/432 places, 767/829 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-03
Stuttering criterion allowed to conclude after 861 steps with 3 reset in 3 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLCardinality-03 finished in 61298 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 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 422 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 422 transition count 787
Applied a total of 20 rules in 11 ms. Remains 422 /432 variables (removed 10) and now considering 787/829 (removed 42) transitions.
// Phase 1: matrix 787 rows 422 cols
[2024-05-26 03:12:08] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 03:12:08] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-26 03:12:08] [INFO ] Invariant cache hit.
[2024-05-26 03:12:08] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:12:08] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 786 sub problems to find dead transitions.
[2024-05-26 03:12:08] [INFO ] Invariant cache hit.
[2024-05-26 03:12:08] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (OVERLAPS) 787/1209 variables, 422/479 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1209/1209 variables, and 496 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 422/422 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (OVERLAPS) 787/1209 variables, 422/479 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1209 variables, 786/1282 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-26 03:13:05] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1209/1209 variables, and 1283 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 422/422 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 1/1 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Starting structural reductions in LTL mode, iteration 1 : 422/432 places, 787/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60930 ms. Remains : 422/432 places, 787/829 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 286 steps with 1 reset in 2 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLCardinality-05 finished in 61057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 422 transition count 793
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 422 transition count 793
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 66 place count 398 transition count 769
Applied a total of 66 rules in 80 ms. Remains 398 /432 variables (removed 34) and now considering 769/829 (removed 60) transitions.
[2024-05-26 03:13:09] [INFO ] Flow matrix only has 767 transitions (discarded 2 similar events)
// Phase 1: matrix 767 rows 398 cols
[2024-05-26 03:13:09] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:13:09] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-26 03:13:09] [INFO ] Flow matrix only has 767 transitions (discarded 2 similar events)
[2024-05-26 03:13:09] [INFO ] Invariant cache hit.
[2024-05-26 03:13:09] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:13:09] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2024-05-26 03:13:09] [INFO ] Redundant transitions in 14 ms returned []
Running 738 sub problems to find dead transitions.
[2024-05-26 03:13:09] [INFO ] Flow matrix only has 767 transitions (discarded 2 similar events)
[2024-05-26 03:13:09] [INFO ] Invariant cache hit.
[2024-05-26 03:13:09] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (OVERLAPS) 9/398 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 4 (OVERLAPS) 767/1165 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1165/1165 variables, and 472 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 738 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (OVERLAPS) 9/398 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 4 (OVERLAPS) 767/1165 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1165 variables, 738/1210 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1165/1165 variables, and 1210 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 0/0 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 738 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in SI_LTL mode, iteration 1 : 398/432 places, 769/829 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60986 ms. Remains : 398/432 places, 769/829 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-08
Stuttering criterion allowed to conclude after 23670 steps with 70 reset in 84 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLCardinality-08 finished in 61160 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 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 422 transition count 789
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 422 transition count 789
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 66 place count 398 transition count 765
Applied a total of 66 rules in 65 ms. Remains 398 /432 variables (removed 34) and now considering 765/829 (removed 64) transitions.
// Phase 1: matrix 765 rows 398 cols
[2024-05-26 03:14:10] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 03:14:10] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-26 03:14:10] [INFO ] Invariant cache hit.
[2024-05-26 03:14:10] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:14:11] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2024-05-26 03:14:11] [INFO ] Redundant transitions in 7 ms returned []
Running 734 sub problems to find dead transitions.
[2024-05-26 03:14:11] [INFO ] Invariant cache hit.
[2024-05-26 03:14:11] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (OVERLAPS) 9/398 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (OVERLAPS) 765/1163 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1163 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-05-26 03:14:39] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 473 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (OVERLAPS) 9/398 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (OVERLAPS) 765/1163 variables, 398/456 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 17/473 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1163 variables, 734/1207 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 1207 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 1/1 constraints]
After SMT, in 60235ms problems are : Problem set: 0 solved, 734 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 398/432 places, 765/829 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61124 ms. Remains : 398/432 places, 765/829 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-09
Stuttering criterion allowed to conclude after 27071 steps with 74 reset in 93 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLCardinality-09 finished in 61284 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((p0 U (F(p1) U p2))) U G(p1)))'
Support contains 6 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 425 transition count 797
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 425 transition count 797
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 60 place count 401 transition count 773
Applied a total of 60 rules in 51 ms. Remains 401 /432 variables (removed 31) and now considering 773/829 (removed 56) transitions.
// Phase 1: matrix 773 rows 401 cols
[2024-05-26 03:15:11] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:15:11] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-26 03:15:11] [INFO ] Invariant cache hit.
[2024-05-26 03:15:12] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:15:12] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2024-05-26 03:15:12] [INFO ] Redundant transitions in 8 ms returned []
Running 742 sub problems to find dead transitions.
[2024-05-26 03:15:12] [INFO ] Invariant cache hit.
[2024-05-26 03:15:12] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (OVERLAPS) 9/401 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 4 (OVERLAPS) 773/1174 variables, 401/458 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1174 variables, 17/475 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1174/1174 variables, and 475 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 401/401 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (OVERLAPS) 9/401 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 4 (OVERLAPS) 773/1174 variables, 401/458 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1174 variables, 17/475 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1174 variables, 742/1217 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1174/1174 variables, and 1217 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 401/401 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 0/0 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Starting structural reductions in SI_LTL mode, iteration 1 : 401/432 places, 773/829 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61144 ms. Remains : 401/432 places, 773/829 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-11
Product exploration explored 100000 steps with 33271 reset in 306 ms.
Product exploration explored 100000 steps with 33439 reset in 309 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 17 factoid took 169 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (113 resets) in 308 ms. (129 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
[2024-05-26 03:16:14] [INFO ] Invariant cache hit.
[2024-05-26 03:16:14] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
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, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 160/217 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 341/558 variables, 51/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 49/607 variables, 17/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 337/944 variables, 140/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/944 variables, 7/319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/944 variables, 9/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/944 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 33/977 variables, 14/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/977 variables, 19/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/977 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 151/1128 variables, 58/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1128 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1128 variables, 5/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1128 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 13/1141 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1141 variables, 13/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1141 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 33/1174 variables, 23/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1174 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1174 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1174 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/1174 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1174/1174 variables, and 475 constraints, problems are : Problem set: 0 solved, 3 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 401/401 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
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, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 160/217 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 341/558 variables, 51/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 49/607 variables, 17/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 40/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 337/944 variables, 140/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/944 variables, 7/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/944 variables, 9/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/944 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 33/977 variables, 14/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/977 variables, 19/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/977 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 151/1128 variables, 58/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1128 variables, 4/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1128 variables, 5/431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1128 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 13/1141 variables, 7/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1141 variables, 13/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1141 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 33/1174 variables, 23/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1174 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1174 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1174 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/1174 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1174/1174 variables, and 478 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 401/401 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1875ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 668 ms.
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 773/773 transitions.
Free-agglomeration rule applied 31 times.
Iterating global reduction 0 with 31 rules applied. Total rules applied 31 place count 401 transition count 742
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 62 place count 370 transition count 742
Applied a total of 62 rules in 26 ms. Remains 370 /401 variables (removed 31) and now considering 742/773 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 370/401 places, 742/773 transitions.
RANDOM walk for 40000 steps (9 resets) in 275 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 278463 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 3
Probabilistic random walk after 278463 steps, saw 247486 distinct states, run finished after 3005 ms. (steps per millisecond=92 ) properties seen :0
// Phase 1: matrix 742 rows 370 cols
[2024-05-26 03:16:19] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:16:19] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
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) 49/55 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 158/213 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 338/551 variables, 50/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 46/597 variables, 17/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/597 variables, 39/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 304/901 variables, 123/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/901 variables, 7/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/901 variables, 9/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 28/929 variables, 14/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/929 variables, 16/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/929 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 144/1073 variables, 55/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1073 variables, 4/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1073 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1073 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 12/1085 variables, 7/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1085 variables, 12/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1085 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 27/1112 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1112 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1112 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1112 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/1112 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1112/1112 variables, and 444 constraints, problems are : Problem set: 0 solved, 3 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 370/370 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
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) 49/55 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 158/213 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 338/551 variables, 50/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 46/597 variables, 17/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 39/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 304/901 variables, 123/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/901 variables, 7/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 9/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/901 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 28/929 variables, 14/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/929 variables, 16/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/929 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 144/1073 variables, 55/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1073 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1073 variables, 5/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1073 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 12/1085 variables, 7/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1085 variables, 12/423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1085 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 27/1112 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1112 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1112 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1112 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/1112 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1112/1112 variables, and 447 constraints, problems are : Problem set: 0 solved, 3 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 370/370 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1225ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 1046 steps, including 18 resets, run visited all 1 properties in 4 ms. (steps per millisecond=261 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 87 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (AND (OR (NOT p2) p1) (OR (NOT p0) p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 17 factoid took 660 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 773/773 transitions.
Applied a total of 0 rules in 19 ms. Remains 401 /401 variables (removed 0) and now considering 773/773 (removed 0) transitions.
// Phase 1: matrix 773 rows 401 cols
[2024-05-26 03:16:22] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:16:22] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-26 03:16:22] [INFO ] Invariant cache hit.
[2024-05-26 03:16:22] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:16:23] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
[2024-05-26 03:16:23] [INFO ] Redundant transitions in 8 ms returned []
Running 742 sub problems to find dead transitions.
[2024-05-26 03:16:23] [INFO ] Invariant cache hit.
[2024-05-26 03:16:23] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (OVERLAPS) 9/401 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 4 (OVERLAPS) 773/1174 variables, 401/458 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1174 variables, 17/475 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1174/1174 variables, and 475 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 401/401 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (OVERLAPS) 9/401 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 4 (OVERLAPS) 773/1174 variables, 401/458 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1174 variables, 17/475 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1174 variables, 742/1217 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1174/1174 variables, and 1217 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 401/401 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 0/0 constraints]
After SMT, in 60304ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 60317ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61140 ms. Remains : 401/401 places, 773/773 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 22 factoid took 219 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (113 resets) in 473 ms. (84 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 127 ms. (312 steps per ms) remains 1/3 properties
[2024-05-26 03:17:24] [INFO ] Invariant cache hit.
[2024-05-26 03:17:24] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/57 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 160/217 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 341/558 variables, 51/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/607 variables, 17/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 337/944 variables, 140/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/944 variables, 7/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/944 variables, 9/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/944 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 33/977 variables, 14/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/977 variables, 19/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/977 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 151/1128 variables, 58/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1128 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1128 variables, 5/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1128 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 13/1141 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1141 variables, 13/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1141 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 33/1174 variables, 23/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1174 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1174 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1174 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1174 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1174/1174 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 401/401 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/57 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 160/217 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 341/558 variables, 51/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 49/607 variables, 17/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 40/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 337/944 variables, 140/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/944 variables, 7/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/944 variables, 9/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/944 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 33/977 variables, 14/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/977 variables, 19/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/977 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 151/1128 variables, 58/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1128 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1128 variables, 5/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1128 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 13/1141 variables, 7/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1141 variables, 13/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1141 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 33/1174 variables, 23/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1174 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1174 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1174 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1174 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1174/1174 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 401/401 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 768ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 9462 steps, including 188 resets, run visited all 1 properties in 31 ms. (steps per millisecond=305 )
Parikh walk visited 1 properties in 31 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (AND (OR (NOT p2) p1) (OR (NOT p0) p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 22 factoid took 587 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 312 reset in 370 ms.
Product exploration explored 100000 steps with 309 reset in 522 ms.
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 773/773 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 773/773 (removed 0) transitions.
[2024-05-26 03:17:27] [INFO ] Invariant cache hit.
[2024-05-26 03:17:27] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-26 03:17:27] [INFO ] Invariant cache hit.
[2024-05-26 03:17:27] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:17:27] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2024-05-26 03:17:27] [INFO ] Redundant transitions in 9 ms returned []
Running 742 sub problems to find dead transitions.
[2024-05-26 03:17:27] [INFO ] Invariant cache hit.
[2024-05-26 03:17:27] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (OVERLAPS) 9/401 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 4 (OVERLAPS) 773/1174 variables, 401/458 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1174 variables, 17/475 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1174/1174 variables, and 475 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 401/401 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (OVERLAPS) 9/401 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 4 (OVERLAPS) 773/1174 variables, 401/458 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1174 variables, 17/475 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1174 variables, 742/1217 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1174/1174 variables, and 1217 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 401/401 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 0/0 constraints]
After SMT, in 60302ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60998 ms. Remains : 401/401 places, 773/773 transitions.
Treatment of property NoC3x3-PT-6A-LTLCardinality-11 finished in 196790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F((!p1&&X(X(!p1))))))'
Support contains 3 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 422 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 422 transition count 787
Applied a total of 20 rules in 13 ms. Remains 422 /432 variables (removed 10) and now considering 787/829 (removed 42) transitions.
// Phase 1: matrix 787 rows 422 cols
[2024-05-26 03:18:28] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:18:28] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-26 03:18:28] [INFO ] Invariant cache hit.
[2024-05-26 03:18:28] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:18:28] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Running 786 sub problems to find dead transitions.
[2024-05-26 03:18:28] [INFO ] Invariant cache hit.
[2024-05-26 03:18:28] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (OVERLAPS) 787/1209 variables, 422/479 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1209/1209 variables, and 496 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 422/422 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (OVERLAPS) 787/1209 variables, 422/479 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1209 variables, 786/1282 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-26 03:19:25] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1209/1209 variables, and 1283 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 422/422 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 1/1 constraints]
After SMT, in 60284ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Starting structural reductions in LTL mode, iteration 1 : 422/432 places, 787/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60944 ms. Remains : 422/432 places, 787/829 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 933 ms.
Product exploration explored 100000 steps with 50000 reset in 881 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6A-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6A-LTLCardinality-14 finished in 63042 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||X(G(p1))))))'
Support contains 2 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 829/829 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 423 transition count 790
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 423 transition count 790
Applied a total of 18 rules in 14 ms. Remains 423 /432 variables (removed 9) and now considering 790/829 (removed 39) transitions.
// Phase 1: matrix 790 rows 423 cols
[2024-05-26 03:19:31] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:19:31] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-26 03:19:31] [INFO ] Invariant cache hit.
[2024-05-26 03:19:31] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:19:31] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Running 789 sub problems to find dead transitions.
[2024-05-26 03:19:32] [INFO ] Invariant cache hit.
[2024-05-26 03:19:32] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 3 (OVERLAPS) 790/1213 variables, 423/480 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1213 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1213/1213 variables, and 497 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 423/423 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 789/789 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 789 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 3 (OVERLAPS) 790/1213 variables, 423/480 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1213 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1213 variables, 789/1286 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1213/1213 variables, and 1286 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 423/423 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 789/789 constraints, Known Traps: 0/0 constraints]
After SMT, in 60268ms problems are : Problem set: 0 solved, 789 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 423/432 places, 790/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60933 ms. Remains : 423/432 places, 790/829 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLCardinality-15 finished in 61075 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))||((X(p1) U ((p2&&X(p1))||X(G(p1)))) U (G((X(p1) U ((p2&&X(p1))||X(G(p1)))))||(X(!p3)&&(X(p1) U ((p2&&X(p1))||X(G(p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (F(p1) U p2))) U G(p1)))'
[2024-05-26 03:20:32] [INFO ] Flatten gal took : 46 ms
[2024-05-26 03:20:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-26 03:20:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 432 places, 829 transitions and 3112 arcs took 24 ms.
Total runtime 881362 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NoC3x3-PT-6A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 432
TRANSITIONS: 829
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.016s, Sys 0.000s]


SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1535
MODEL NAME: /home/mcc/execution/408/model
432 places, 829 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-6A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is NoC3x3-PT-6A, 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 r245-tall-171654350300635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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