fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LTSMin+red for FlexibleBarrier-PT-20a

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1376.411 346252.00 506706.00 698.70 FTFTTTFTFFFTFFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 12:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 12:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 321K May 18 16:42 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 FlexibleBarrier-PT-20a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-20a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717183950119

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:32:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:32:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:32:31] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-31 19:32:31] [INFO ] Transformed 243 places.
[2024-05-31 19:32:31] [INFO ] Transformed 1064 transitions.
[2024-05-31 19:32:31] [INFO ] Found NUPN structural information;
[2024-05-31 19:32:31] [INFO ] Parsed PT model containing 243 places and 1064 transitions and 5317 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 362 transitions
Reduce redundant transitions removed 362 transitions.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 702/702 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 243 transition count 682
Applied a total of 20 rules in 55 ms. Remains 243 /243 variables (removed 0) and now considering 682/702 (removed 20) transitions.
// Phase 1: matrix 682 rows 243 cols
[2024-05-31 19:32:31] [INFO ] Computed 22 invariants in 12 ms
[2024-05-31 19:32:32] [INFO ] Implicit Places using invariants in 470 ms returned [241, 242]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 507 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 241/243 places, 682/702 transitions.
Applied a total of 0 rules in 6 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 583 ms. Remains : 241/243 places, 682/702 transitions.
Support contains 11 out of 241 places after structural reductions.
[2024-05-31 19:32:32] [INFO ] Flatten gal took : 63 ms
[2024-05-31 19:32:32] [INFO ] Flatten gal took : 36 ms
[2024-05-31 19:32:32] [INFO ] Input system was already deterministic with 682 transitions.
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 7703 steps (0 resets) in 451 ms. (17 steps per ms) remains 0/7 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' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 241 cols
[2024-05-31 19:32:32] [INFO ] Computed 20 invariants in 3 ms
[2024-05-31 19:32:33] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 19:32:33] [INFO ] Invariant cache hit.
[2024-05-31 19:32:33] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2024-05-31 19:32:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (OVERLAPS) 0/923 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/923 variables, and 502 constraints, problems are : Problem set: 0 solved, 681 unsolved in 28772 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 681/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/923 variables, and 1183 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30028 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints]
After SMT, in 59533ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 59553ms
Finished structural reductions in LTL mode , in 1 iterations and 59815 ms. Remains : 241/241 places, 682/682 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-02
Product exploration explored 100000 steps with 372 reset in 885 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 1 ms.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-02 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(p2)&&p1))))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 5 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2024-05-31 19:33:34] [INFO ] Invariant cache hit.
[2024-05-31 19:33:34] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 19:33:34] [INFO ] Invariant cache hit.
[2024-05-31 19:33:34] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2024-05-31 19:33:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (OVERLAPS) 0/923 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/923 variables, and 502 constraints, problems are : Problem set: 0 solved, 681 unsolved in 29565 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 681/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/923 variables, and 1183 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30032 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in LTL mode , in 1 iterations and 60405 ms. Remains : 241/241 places, 682/682 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-07
Product exploration explored 100000 steps with 128 reset in 588 ms.
Product exploration explored 100000 steps with 139 reset in 606 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 p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 114 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40000 steps (8 resets) in 1540 ms. (25 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
[2024-05-31 19:34:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 23/25 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 216/241 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 216/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/923 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/923 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/923 variables, and 502 constraints, problems are : Problem set: 0 solved, 4 unsolved in 551 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf7 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Int declared 2/923 variables, and 2 constraints, problems are : Problem set: 4 solved, 0 unsolved in 18 ms.
Refiners :[Domain max(s): 2/241 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/241 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 598ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (G (OR p0 p2 (NOT p1))), (G (OR p0 p1)), (G (OR p0 p2 p1)), (G (OR (NOT p0) (NOT p1))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 28 factoid took 336 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 64 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2024-05-31 19:34:37] [INFO ] Invariant cache hit.
[2024-05-31 19:34:37] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 19:34:37] [INFO ] Invariant cache hit.
[2024-05-31 19:34:38] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2024-05-31 19:34:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (OVERLAPS) 0/923 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/923 variables, and 502 constraints, problems are : Problem set: 0 solved, 681 unsolved in 29485 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 681/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/923 variables, and 1183 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30033 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Finished structural reductions in LTL mode , in 1 iterations and 60442 ms. Remains : 241/241 places, 682/682 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 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 4679 steps (0 resets) in 44 ms. (103 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F p2)]
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 143 reset in 545 ms.
Product exploration explored 100000 steps with 153 reset in 567 ms.
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 2 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2024-05-31 19:35:40] [INFO ] Invariant cache hit.
[2024-05-31 19:35:40] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 19:35:40] [INFO ] Invariant cache hit.
[2024-05-31 19:35:40] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2024-05-31 19:35:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (OVERLAPS) 0/923 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/923 variables, and 502 constraints, problems are : Problem set: 0 solved, 681 unsolved in 29159 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 681/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/923 variables, and 1183 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30022 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints]
After SMT, in 59635ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 59642ms
Finished structural reductions in LTL mode , in 1 iterations and 59916 ms. Remains : 241/241 places, 682/682 transitions.
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-07 finished in 186258 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 (G(p0)||(p0&&G(!p1))))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Graph (trivial) has 309 edges and 241 vertex of which 224 / 241 are part of one of the 24 SCC in 2 ms
Free SCC test removed 200 places
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 24 transition count 41
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 222 place count 22 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 224 place count 20 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 224 place count 20 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 228 place count 18 transition count 37
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 230 place count 16 transition count 33
Iterating global reduction 3 with 2 rules applied. Total rules applied 232 place count 16 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 236 place count 16 transition count 29
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 239 place count 14 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 240 place count 13 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 254 place count 13 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 256 place count 13 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 258 place count 11 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 258 place count 11 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 264 place count 8 transition count 9
Applied a total of 264 rules in 68 ms. Remains 8 /241 variables (removed 233) and now considering 9/682 (removed 673) transitions.
// Phase 1: matrix 9 rows 8 cols
[2024-05-31 19:36:40] [INFO ] Computed 4 invariants in 0 ms
[2024-05-31 19:36:40] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-31 19:36:40] [INFO ] Invariant cache hit.
[2024-05-31 19:36:40] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-31 19:36:40] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-31 19:36:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/16 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 242ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 242ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/241 places, 9/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 591 ms. Remains : 8/241 places, 9/682 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-08
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-08 finished in 697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Graph (trivial) has 318 edges and 241 vertex of which 233 / 241 are part of one of the 21 SCC in 4 ms
Free SCC test removed 212 places
Ensure Unique test removed 441 transitions
Reduce isomorphic transitions removed 441 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 246 rules applied. Total rules applied 247 place count 9 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 249 place count 7 transition count 13
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 250 place count 6 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 251 place count 6 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 254 place count 6 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 256 place count 4 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 258 place count 3 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 259 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 261 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 262 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 263 place count 2 transition count 3
Applied a total of 263 rules in 12 ms. Remains 2 /241 variables (removed 239) and now considering 3/682 (removed 679) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 19:36:40] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 19:36:40] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 19:36:40] [INFO ] Invariant cache hit.
[2024-05-31 19:36:41] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-31 19:36:41] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-31 19:36:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 43ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 43ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/241 places, 3/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 2/241 places, 3/682 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-14 finished in 172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Applied a total of 0 rules in 9 ms. Remains 241 /241 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 241 cols
[2024-05-31 19:36:41] [INFO ] Computed 20 invariants in 2 ms
[2024-05-31 19:36:41] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 19:36:41] [INFO ] Invariant cache hit.
[2024-05-31 19:36:41] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2024-05-31 19:36:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (OVERLAPS) 0/923 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/923 variables, and 502 constraints, problems are : Problem set: 0 solved, 681 unsolved in 29140 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/923 variables, 241/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 681/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/923 variables, and 1183 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30020 ms.
Refiners :[Domain max(s): 241/241 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints]
After SMT, in 59701ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 59707ms
Finished structural reductions in LTL mode , in 1 iterations and 59968 ms. Remains : 241/241 places, 682/682 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 598 ms.
Product exploration explored 100000 steps with 33333 reset in 529 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-15 finished in 61292 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(p2)&&p1))))'
Found a Shortening insensitive property : FlexibleBarrier-PT-20a-LTLCardinality-07
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 241/241 places, 682/682 transitions.
Graph (trivial) has 316 edges and 241 vertex of which 235 / 241 are part of one of the 21 SCC in 2 ms
Free SCC test removed 214 places
Ensure Unique test removed 461 transitions
Reduce isomorphic transitions removed 461 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 225 rules applied. Total rules applied 226 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 227 place count 7 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 229 place count 6 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 233 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 233 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 235 place count 5 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 237 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 238 place count 4 transition count 5
Applied a total of 238 rules in 13 ms. Remains 4 /241 variables (removed 237) and now considering 5/682 (removed 677) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-31 19:37:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 19:37:42] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-31 19:37:42] [INFO ] Invariant cache hit.
[2024-05-31 19:37:42] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-05-31 19:37:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 10 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 12 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Starting structural reductions in LI_LTL mode, iteration 1 : 4/241 places, 5/682 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 133 ms. Remains : 4/241 places, 5/682 transitions.
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLCardinality-07
Product exploration explored 100000 steps with 5774 reset in 131 ms.
Stack based approach found an accepted trace after 26 steps with 2 reset with depth 6 and stack size 4 in 0 ms.
Treatment of property FlexibleBarrier-PT-20a-LTLCardinality-07 finished in 444 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-31 19:37:42] [INFO ] Flatten gal took : 26 ms
[2024-05-31 19:37:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 19:37:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 241 places, 682 transitions and 2105 arcs took 7 ms.
Total runtime 311629 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FlexibleBarrier-PT-20a-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717184296371

--------------------
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
mcc2024
ltl formula name FlexibleBarrier-PT-20a-LTLCardinality-07
ltl formula formula --ltl=/tmp/832/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 241 places, 682 transitions and 2105 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/832/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/832/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/832/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/832/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 242 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 242, there are 790 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~530724 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~908056 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~1670988 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~3195828 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~6159756 transitions
pnml2lts-mc( 3/ 4): ~80000 levels ~320000 states ~12158472 transitions
pnml2lts-mc( 3/ 4): ~160000 levels ~640000 states ~23899492 transitions
pnml2lts-mc( 3/ 4): ~320000 levels ~1280000 states ~46068708 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1898490
pnml2lts-mc( 0/ 4): unique transitions count: 72339710
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 18267860
pnml2lts-mc( 0/ 4): - claim success count: 1898496
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1898496
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1898496 states 72339760 transitions, fanout: 38.104
pnml2lts-mc( 0/ 4): Total exploration time 32.650 sec (32.350 sec minimum, 32.490 sec on average)
pnml2lts-mc( 0/ 4): States per second: 58147, Transitions per second: 2215613
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 260.6MB, 8.1 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/7.0%
pnml2lts-mc( 0/ 4): Stored 694 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 260.6MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-20a, 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 r496-tall-171640602700131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20a.tgz
mv FlexibleBarrier-PT-20a 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 ;