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

About the Execution of ITS-Tools for Szymanski-PT-a02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
439.823 38913.00 60935.00 137.60 FFFTFFTFTFTFFTTF 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.r400-tall-171690533200811.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 itstools
Input is Szymanski-PT-a02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690533200811
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 101K 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 Szymanski-PT-a02-LTLCardinality-00
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-01
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-02
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-03
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-04
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-05
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-06
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-07
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-08
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-09
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-10
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-11
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-12
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-13
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-14
FORMULA_NAME Szymanski-PT-a02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717085745265

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 16:15:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 16:15:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 16:15:46] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-30 16:15:46] [INFO ] Transformed 61 places.
[2024-05-30 16:15:46] [INFO ] Transformed 224 transitions.
[2024-05-30 16:15:46] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 47 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 47 transition count 212
Applied a total of 3 rules in 23 ms. Remains 47 /49 variables (removed 2) and now considering 212/216 (removed 4) transitions.
[2024-05-30 16:15:46] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
// Phase 1: matrix 78 rows 47 cols
[2024-05-30 16:15:46] [INFO ] Computed 2 invariants in 8 ms
[2024-05-30 16:15:47] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-30 16:15:47] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2024-05-30 16:15:47] [INFO ] Invariant cache hit.
[2024-05-30 16:15:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 16:15:47] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-05-30 16:15:47] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2024-05-30 16:15:47] [INFO ] Invariant cache hit.
[2024-05-30 16:15:47] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-30 16:15:48] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 9 ms to minimize.
[2024-05-30 16:15:48] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
[2024-05-30 16:15:48] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 16:15:48] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-30 16:15:48] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-30 16:15:49] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 78/125 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 64 constraints, problems are : Problem set: 0 solved, 210 unsolved in 4116 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 78/125 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 210/274 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 274 constraints, problems are : Problem set: 0 solved, 210 unsolved in 3897 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 6/6 constraints]
After SMT, in 8147ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 8166ms
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 212/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8518 ms. Remains : 47/49 places, 212/216 transitions.
Support contains 23 out of 47 places after structural reductions.
[2024-05-30 16:15:55] [INFO ] Flatten gal took : 35 ms
[2024-05-30 16:15:55] [INFO ] Flatten gal took : 19 ms
[2024-05-30 16:15:55] [INFO ] Input system was already deterministic with 212 transitions.
Support contains 21 out of 47 places (down from 23) after GAL structural reductions.
RANDOM walk for 40001 steps (117 resets) in 1067 ms. (37 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40004 steps (41 resets) in 108 ms. (367 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (12 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (37 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
[2024-05-30 16:15:56] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2024-05-30 16:15:56] [INFO ] Invariant cache hit.
[2024-05-30 16:15:56] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/47 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-30 16:15:56] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 4 (OVERLAPS) 78/125 variables, 47/50 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 9/59 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/59 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/59 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 59 constraints, problems are : Problem set: 3 solved, 1 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/47 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-30 16:15:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-30 16:15:56] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-30 16:15:56] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Int declared 47/125 variables, and 6 constraints, problems are : Problem set: 4 solved, 0 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/47 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 245ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
FORMULA Szymanski-PT-a02-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 36 stable transitions
Graph (complete) has 370 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 U (G(p0)||(p0&&G(p1)))))))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 212/212 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 44 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 44 transition count 204
Applied a total of 5 rules in 4 ms. Remains 44 /47 variables (removed 3) and now considering 204/212 (removed 8) transitions.
[2024-05-30 16:15:56] [INFO ] Flow matrix only has 76 transitions (discarded 128 similar events)
// Phase 1: matrix 76 rows 44 cols
[2024-05-30 16:15:56] [INFO ] Computed 1 invariants in 2 ms
[2024-05-30 16:15:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 16:15:56] [INFO ] Flow matrix only has 76 transitions (discarded 128 similar events)
[2024-05-30 16:15:56] [INFO ] Invariant cache hit.
[2024-05-30 16:15:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 16:15:56] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-30 16:15:56] [INFO ] Flow matrix only has 76 transitions (discarded 128 similar events)
[2024-05-30 16:15:56] [INFO ] Invariant cache hit.
[2024-05-30 16:15:56] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 76/120 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/120 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 54 constraints, problems are : Problem set: 0 solved, 202 unsolved in 2562 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 76/120 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 202/256 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/120 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 256 constraints, problems are : Problem set: 0 solved, 202 unsolved in 3153 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 5807ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 5809ms
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 204/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5971 ms. Remains : 44/47 places, 204/212 transitions.
Stuttering acceptance computed with spot in 329 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-a02-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-a02-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a02-LTLCardinality-00 finished in 6363 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||G(p1)))))'
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 212/212 transitions.
Graph (complete) has 370 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 44 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 44 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 17 place count 44 transition count 192
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 19 place count 42 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 42 transition count 184
Applied a total of 21 rules in 28 ms. Remains 42 /47 variables (removed 5) and now considering 184/212 (removed 28) transitions.
[2024-05-30 16:16:02] [INFO ] Flow matrix only has 71 transitions (discarded 113 similar events)
// Phase 1: matrix 71 rows 42 cols
[2024-05-30 16:16:02] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 16:16:03] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 16:16:03] [INFO ] Flow matrix only has 71 transitions (discarded 113 similar events)
[2024-05-30 16:16:03] [INFO ] Invariant cache hit.
[2024-05-30 16:16:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 16:16:03] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-30 16:16:03] [INFO ] Redundant transitions in 6 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-30 16:16:03] [INFO ] Flow matrix only has 71 transitions (discarded 113 similar events)
[2024-05-30 16:16:03] [INFO ] Invariant cache hit.
[2024-05-30 16:16:03] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 71/113 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 0/113 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 52 constraints, problems are : Problem set: 0 solved, 182 unsolved in 1871 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 71/113 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 182/234 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 0/113 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 234 constraints, problems are : Problem set: 0 solved, 182 unsolved in 3198 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 5135ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 5138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/47 places, 184/212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5301 ms. Remains : 42/47 places, 184/212 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-a02-LTLCardinality-02
Stuttering criterion allowed to conclude after 5678 steps with 32 reset in 42 ms.
FORMULA Szymanski-PT-a02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a02-LTLCardinality-02 finished in 5451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 212/212 transitions.
Graph (complete) has 370 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 43 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 23 place count 43 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 42 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 42 transition count 180
Applied a total of 25 rules in 23 ms. Remains 42 /47 variables (removed 5) and now considering 180/212 (removed 32) transitions.
[2024-05-30 16:16:08] [INFO ] Flow matrix only has 70 transitions (discarded 110 similar events)
// Phase 1: matrix 70 rows 42 cols
[2024-05-30 16:16:08] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 16:16:08] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 16:16:08] [INFO ] Flow matrix only has 70 transitions (discarded 110 similar events)
[2024-05-30 16:16:08] [INFO ] Invariant cache hit.
[2024-05-30 16:16:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 16:16:08] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-30 16:16:08] [INFO ] Redundant transitions in 5 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-30 16:16:08] [INFO ] Flow matrix only has 70 transitions (discarded 110 similar events)
[2024-05-30 16:16:08] [INFO ] Invariant cache hit.
[2024-05-30 16:16:08] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 70/112 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 0/112 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 52 constraints, problems are : Problem set: 0 solved, 178 unsolved in 1437 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 70/112 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 178/230 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 0/112 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 230 constraints, problems are : Problem set: 0 solved, 178 unsolved in 2843 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 4329ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 4332ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/47 places, 180/212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4476 ms. Remains : 42/47 places, 180/212 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Szymanski-PT-a02-LTLCardinality-07
Stuttering criterion allowed to conclude after 261 steps with 2 reset in 6 ms.
FORMULA Szymanski-PT-a02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a02-LTLCardinality-07 finished in 4599 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))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 212/212 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 43 transition count 200
Applied a total of 7 rules in 6 ms. Remains 43 /47 variables (removed 4) and now considering 200/212 (removed 12) transitions.
[2024-05-30 16:16:13] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2024-05-30 16:16:13] [INFO ] Computed 1 invariants in 4 ms
[2024-05-30 16:16:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 16:16:13] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2024-05-30 16:16:13] [INFO ] Invariant cache hit.
[2024-05-30 16:16:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 16:16:13] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-30 16:16:13] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2024-05-30 16:16:13] [INFO ] Invariant cache hit.
[2024-05-30 16:16:13] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 75/118 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/118 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 53 constraints, problems are : Problem set: 0 solved, 198 unsolved in 2171 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 75/118 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 198/251 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/118 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 251 constraints, problems are : Problem set: 0 solved, 198 unsolved in 3231 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 5470ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 5472ms
Starting structural reductions in LTL mode, iteration 1 : 43/47 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5590 ms. Remains : 43/47 places, 200/212 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Szymanski-PT-a02-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 8 stabilizing places and 32 stable transitions
Computed a total of 8 stabilizing places and 32 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-a02-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-a02-LTLCardinality-08 finished in 6110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 212/212 transitions.
Graph (complete) has 370 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 42 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 25 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 40 transition count 172
Applied a total of 29 rules in 16 ms. Remains 40 /47 variables (removed 7) and now considering 172/212 (removed 40) transitions.
[2024-05-30 16:16:19] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
// Phase 1: matrix 68 rows 40 cols
[2024-05-30 16:16:19] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 16:16:19] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 16:16:19] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2024-05-30 16:16:19] [INFO ] Invariant cache hit.
[2024-05-30 16:16:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 16:16:19] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-30 16:16:19] [INFO ] Redundant transitions in 1 ms returned []
Running 170 sub problems to find dead transitions.
[2024-05-30 16:16:19] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2024-05-30 16:16:19] [INFO ] Invariant cache hit.
[2024-05-30 16:16:19] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 68/108 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 0/108 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 50 constraints, problems are : Problem set: 0 solved, 170 unsolved in 1646 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 68/108 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 170/220 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/108 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 220 constraints, problems are : Problem set: 0 solved, 170 unsolved in 2903 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
After SMT, in 4600ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 4602ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/47 places, 172/212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4764 ms. Remains : 40/47 places, 172/212 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-a02-LTLCardinality-15
Stuttering criterion allowed to conclude after 61816 steps with 3289 reset in 118 ms.
FORMULA Szymanski-PT-a02-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a02-LTLCardinality-15 finished in 5025 ms.
All properties solved by simple procedures.
Total runtime 37670 ms.

BK_STOP 1717085784178

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Szymanski-PT-a02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Szymanski-PT-a02, 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 r400-tall-171690533200811"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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