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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 606465.00 0.00 0.00 ??FT??F?T???TFFF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690533300865.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-b04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690533300865
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:31 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 3.7M 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-b04-CTLCardinality-2024-00
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2024-01
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2024-02
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2024-03
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2024-04
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2024-05
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2024-06
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2024-07
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2024-08
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2024-09
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2024-10
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2024-11
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2023-12
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2023-13
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2023-14
FORMULA_NAME Szymanski-PT-b04-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717089715203

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 17:21:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 17:21:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 17:21:56] [INFO ] Load time of PNML (sax parser for PT used): 330 ms
[2024-05-30 17:21:56] [INFO ] Transformed 568 places.
[2024-05-30 17:21:56] [INFO ] Transformed 8320 transitions.
[2024-05-30 17:21:56] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 467 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Szymanski-PT-b04-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 305 transition count 7936
Applied a total of 4 rules in 225 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2024-05-30 17:21:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 17:21:57] [INFO ] Computed 1 invariants in 53 ms
[2024-05-30 17:21:58] [INFO ] Implicit Places using invariants in 883 ms returned []
[2024-05-30 17:21:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:21:58] [INFO ] Invariant cache hit.
[2024-05-30 17:21:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:22:29] [INFO ] Performed 297/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-30 17:22:33] [INFO ] Implicit Places using invariants and state equation in 35111 ms returned []
Implicit Place search using SMT with State Equation took 36027 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:22:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:22:33] [INFO ] Invariant cache hit.
[2024-05-30 17:22:33] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30173 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30091 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 88111ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 88207ms
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124515 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 50 out of 305 places after structural reductions.
[2024-05-30 17:24:02] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-30 17:24:02] [INFO ] Flatten gal took : 402 ms
[2024-05-30 17:24:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Szymanski-PT-b04-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 17:24:02] [INFO ] Flatten gal took : 280 ms
[2024-05-30 17:24:03] [INFO ] Input system was already deterministic with 7936 transitions.
Support contains 38 out of 305 places (down from 50) after GAL structural reductions.
RANDOM walk for 40008 steps (10 resets) in 1449 ms. (27 steps per ms) remains 20/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
[2024-05-30 17:24:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:24:03] [INFO ] Invariant cache hit.
[2024-05-30 17:24:03] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 282/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 11 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 11 solved, 6 unsolved in 2506 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 294/305 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 11 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 11 solved, 6 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 7587ms problems are : Problem set: 11 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 894 ms.
Support contains 8 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 370 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 305/305 places, 7808/7936 transitions.
RANDOM walk for 40010 steps (8 resets) in 248 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
[2024-05-30 17:24:12] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-30 17:24:13] [INFO ] Computed 3 invariants in 32 ms
[2024-05-30 17:24:13] [INFO ] State equation strengthened by 147 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
At refinement iteration 1 (OVERLAPS) 279/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 17:24:13] [INFO ] Deduced a trap composed of 132 places in 489 ms of which 19 ms to minimize.
[2024-05-30 17:24:14] [INFO ] Deduced a trap composed of 157 places in 500 ms of which 3 ms to minimize.
[2024-05-30 17:24:14] [INFO ] Deduced a trap composed of 75 places in 440 ms of which 14 ms to minimize.
[2024-05-30 17:24:15] [INFO ] Deduced a trap composed of 129 places in 411 ms of which 18 ms to minimize.
[2024-05-30 17:24:15] [INFO ] Deduced a trap composed of 79 places in 506 ms of which 11 ms to minimize.
[2024-05-30 17:24:16] [INFO ] Deduced a trap composed of 72 places in 406 ms of which 2 ms to minimize.
[2024-05-30 17:24:16] [INFO ] Deduced a trap composed of 134 places in 400 ms of which 2 ms to minimize.
[2024-05-30 17:24:16] [INFO ] Deduced a trap composed of 130 places in 394 ms of which 2 ms to minimize.
[2024-05-30 17:24:17] [INFO ] Deduced a trap composed of 129 places in 389 ms of which 2 ms to minimize.
[2024-05-30 17:24:17] [INFO ] Deduced a trap composed of 137 places in 258 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2604/2909 variables, 305/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 147/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 465 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6059 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 279/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 17:24:19] [INFO ] Deduced a trap composed of 195 places in 330 ms of which 2 ms to minimize.
[2024-05-30 17:24:19] [INFO ] Deduced a trap composed of 103 places in 298 ms of which 2 ms to minimize.
[2024-05-30 17:24:20] [INFO ] Deduced a trap composed of 132 places in 301 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 19/305 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 17:24:24] [INFO ] Deduced a trap composed of 138 places in 357 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 473 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8470 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 14621ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40006 steps (8 resets) in 227 ms. (175 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 160654 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 4
Probabilistic random walk after 160654 steps, saw 57798 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-30 17:24:31] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:24:31] [INFO ] Invariant cache hit.
[2024-05-30 17:24:31] [INFO ] State equation strengthened by 147 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
At refinement iteration 1 (OVERLAPS) 279/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 17:24:31] [INFO ] Deduced a trap composed of 132 places in 395 ms of which 2 ms to minimize.
[2024-05-30 17:24:32] [INFO ] Deduced a trap composed of 157 places in 463 ms of which 2 ms to minimize.
[2024-05-30 17:24:32] [INFO ] Deduced a trap composed of 75 places in 453 ms of which 3 ms to minimize.
[2024-05-30 17:24:32] [INFO ] Deduced a trap composed of 129 places in 451 ms of which 2 ms to minimize.
[2024-05-30 17:24:33] [INFO ] Deduced a trap composed of 79 places in 408 ms of which 2 ms to minimize.
[2024-05-30 17:24:33] [INFO ] Deduced a trap composed of 72 places in 395 ms of which 2 ms to minimize.
[2024-05-30 17:24:34] [INFO ] Deduced a trap composed of 134 places in 396 ms of which 2 ms to minimize.
[2024-05-30 17:24:34] [INFO ] Deduced a trap composed of 130 places in 386 ms of which 2 ms to minimize.
[2024-05-30 17:24:34] [INFO ] Deduced a trap composed of 129 places in 380 ms of which 2 ms to minimize.
[2024-05-30 17:24:35] [INFO ] Deduced a trap composed of 137 places in 255 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2604/2909 variables, 305/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 147/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 465 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6008 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 279/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 17:24:37] [INFO ] Deduced a trap composed of 195 places in 376 ms of which 2 ms to minimize.
[2024-05-30 17:24:37] [INFO ] Deduced a trap composed of 103 places in 340 ms of which 2 ms to minimize.
[2024-05-30 17:24:38] [INFO ] Deduced a trap composed of 132 places in 318 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 19/305 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 17:24:42] [INFO ] Deduced a trap composed of 138 places in 353 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 473 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8704 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 14744ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 193 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-30 17:24:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:24:46] [INFO ] Invariant cache hit.
[2024-05-30 17:24:46] [INFO ] Implicit Places using invariants in 599 ms returned []
[2024-05-30 17:24:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:24:46] [INFO ] Invariant cache hit.
[2024-05-30 17:24:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:25:15] [INFO ] Implicit Places using invariants and state equation in 28519 ms returned []
Implicit Place search using SMT with State Equation took 29128 ms to find 0 implicit places.
[2024-05-30 17:25:16] [INFO ] Redundant transitions in 867 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-05-30 17:25:16] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:25:16] [INFO ] Invariant cache hit.
[2024-05-30 17:25:16] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 17:26:17] [INFO ] Deduced a trap composed of 138 places in 479 ms of which 2 ms to minimize.
[2024-05-30 17:26:19] [INFO ] Deduced a trap composed of 31 places in 439 ms of which 2 ms to minimize.
[2024-05-30 17:26:19] [INFO ] Deduced a trap composed of 106 places in 419 ms of which 2 ms to minimize.
[2024-05-30 17:26:20] [INFO ] Deduced a trap composed of 104 places in 453 ms of which 2 ms to minimize.
[2024-05-30 17:26:20] [INFO ] Deduced a trap composed of 37 places in 362 ms of which 2 ms to minimize.
[2024-05-30 17:26:21] [INFO ] Deduced a trap composed of 59 places in 371 ms of which 2 ms to minimize.
[2024-05-30 17:26:21] [INFO ] Deduced a trap composed of 42 places in 368 ms of which 5 ms to minimize.
[2024-05-30 17:26:21] [INFO ] Deduced a trap composed of 50 places in 342 ms of which 2 ms to minimize.
[2024-05-30 17:26:22] [INFO ] Deduced a trap composed of 42 places in 333 ms of which 2 ms to minimize.
[2024-05-30 17:26:22] [INFO ] Deduced a trap composed of 47 places in 320 ms of which 2 ms to minimize.
[2024-05-30 17:26:22] [INFO ] Deduced a trap composed of 62 places in 433 ms of which 2 ms to minimize.
[2024-05-30 17:26:23] [INFO ] Deduced a trap composed of 78 places in 419 ms of which 3 ms to minimize.
[2024-05-30 17:26:23] [INFO ] Deduced a trap composed of 48 places in 388 ms of which 2 ms to minimize.
[2024-05-30 17:26:24] [INFO ] Deduced a trap composed of 75 places in 352 ms of which 2 ms to minimize.
[2024-05-30 17:26:24] [INFO ] Deduced a trap composed of 42 places in 283 ms of which 2 ms to minimize.
[2024-05-30 17:26:24] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 2 ms to minimize.
[2024-05-30 17:26:25] [INFO ] Deduced a trap composed of 50 places in 410 ms of which 2 ms to minimize.
[2024-05-30 17:26:25] [INFO ] Deduced a trap composed of 97 places in 411 ms of which 2 ms to minimize.
[2024-05-30 17:26:26] [INFO ] Deduced a trap composed of 64 places in 321 ms of which 2 ms to minimize.
[2024-05-30 17:26:26] [INFO ] Deduced a trap composed of 72 places in 385 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 17:26:30] [INFO ] Deduced a trap composed of 44 places in 411 ms of which 2 ms to minimize.
[2024-05-30 17:26:31] [INFO ] Deduced a trap composed of 57 places in 383 ms of which 1 ms to minimize.
[2024-05-30 17:26:31] [INFO ] Deduced a trap composed of 57 places in 382 ms of which 2 ms to minimize.
[2024-05-30 17:26:32] [INFO ] Deduced a trap composed of 72 places in 375 ms of which 2 ms to minimize.
[2024-05-30 17:26:32] [INFO ] Deduced a trap composed of 115 places in 390 ms of which 2 ms to minimize.
[2024-05-30 17:26:33] [INFO ] Deduced a trap composed of 114 places in 446 ms of which 2 ms to minimize.
[2024-05-30 17:26:33] [INFO ] Deduced a trap composed of 101 places in 342 ms of which 2 ms to minimize.
[2024-05-30 17:26:33] [INFO ] Deduced a trap composed of 114 places in 424 ms of which 5 ms to minimize.
[2024-05-30 17:26:34] [INFO ] Deduced a trap composed of 113 places in 422 ms of which 2 ms to minimize.
[2024-05-30 17:26:35] [INFO ] Deduced a trap composed of 125 places in 468 ms of which 2 ms to minimize.
[2024-05-30 17:26:35] [INFO ] Deduced a trap composed of 58 places in 379 ms of which 2 ms to minimize.
[2024-05-30 17:26:41] [INFO ] Deduced a trap composed of 86 places in 394 ms of which 2 ms to minimize.
[2024-05-30 17:26:42] [INFO ] Deduced a trap composed of 78 places in 306 ms of which 2 ms to minimize.
[2024-05-30 17:26:42] [INFO ] Deduced a trap composed of 120 places in 419 ms of which 3 ms to minimize.
[2024-05-30 17:26:42] [INFO ] Deduced a trap composed of 134 places in 249 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 38 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 35/35 constraints]
After SMT, in 87617ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 87686ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117897 ms. Remains : 305/305 places, 7808/7808 transitions.
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
FORMULA Szymanski-PT-b04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 17:26:44] [INFO ] Flatten gal took : 208 ms
[2024-05-30 17:26:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Szymanski-PT-b04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 17:26:44] [INFO ] Flatten gal took : 198 ms
[2024-05-30 17:26:44] [INFO ] Input system was already deterministic with 7936 transitions.
Support contains 21 out of 305 places (down from 26) after GAL structural reductions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 280 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 17:26:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 17:26:45] [INFO ] Computed 1 invariants in 22 ms
[2024-05-30 17:26:45] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-30 17:26:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:26:45] [INFO ] Invariant cache hit.
[2024-05-30 17:26:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:27:08] [INFO ] Implicit Places using invariants and state equation in 22589 ms returned []
Implicit Place search using SMT with State Equation took 23025 ms to find 0 implicit places.
[2024-05-30 17:27:08] [INFO ] Redundant transitions in 641 ms returned []
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:27:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:27:08] [INFO ] Invariant cache hit.
[2024-05-30 17:27:08] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30098 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30090 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 89040ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 89106ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 113081 ms. Remains : 305/305 places, 7936/7936 transitions.
[2024-05-30 17:28:38] [INFO ] Flatten gal took : 165 ms
[2024-05-30 17:28:38] [INFO ] Flatten gal took : 202 ms
[2024-05-30 17:28:38] [INFO ] Input system was already deterministic with 7936 transitions.
[2024-05-30 17:28:38] [INFO ] Flatten gal took : 175 ms
[2024-05-30 17:28:38] [INFO ] Flatten gal took : 174 ms
[2024-05-30 17:28:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality16070674378218474234.gal : 81 ms
[2024-05-30 17:28:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality14906338862316894953.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16070674378218474234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14906338862316894953.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 17:29:09] [INFO ] Flatten gal took : 173 ms
[2024-05-30 17:29:09] [INFO ] Applying decomposition
[2024-05-30 17:29:09] [INFO ] Flatten gal took : 180 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4922547035683287836.txt' '-o' '/tmp/graph4922547035683287836.bin' '-w' '/tmp/graph4922547035683287836.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4922547035683287836.bin' '-l' '-1' '-v' '-w' '/tmp/graph4922547035683287836.weights' '-q' '0' '-e' '0.001'
[2024-05-30 17:29:09] [INFO ] Decomposing Gal with order
[2024-05-30 17:29:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 17:29:10] [INFO ] Removed a total of 18190 redundant transitions.
[2024-05-30 17:29:10] [INFO ] Flatten gal took : 705 ms
[2024-05-30 17:29:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 1279 labels/synchronizations in 309 ms.
[2024-05-30 17:29:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality1953306661258673672.gal : 29 ms
[2024-05-30 17:29:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality18321102404010543210.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1953306661258673672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18321102404010543210.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 39 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 17:29:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:29:41] [INFO ] Invariant cache hit.
[2024-05-30 17:29:42] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-30 17:29:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:29:42] [INFO ] Invariant cache hit.
[2024-05-30 17:29:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:30:07] [INFO ] Implicit Places using invariants and state equation in 25011 ms returned []
Implicit Place search using SMT with State Equation took 25468 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:30:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:30:07] [INFO ] Invariant cache hit.
[2024-05-30 17:30:07] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30093 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30085 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 88352ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 88414ms
Finished structural reductions in LTL mode , in 1 iterations and 113935 ms. Remains : 305/305 places, 7936/7936 transitions.
[2024-05-30 17:31:36] [INFO ] Flatten gal took : 267 ms
[2024-05-30 17:31:36] [INFO ] Flatten gal took : 254 ms
[2024-05-30 17:31:36] [INFO ] Input system was already deterministic with 7936 transitions.
[2024-05-30 17:31:36] [INFO ] Flatten gal took : 174 ms
[2024-05-30 17:31:37] [INFO ] Flatten gal took : 185 ms
[2024-05-30 17:31:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality2549878004824727676.gal : 26 ms
[2024-05-30 17:31:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality17411307504138588230.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2549878004824727676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17411307504138588230.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.

BK_STOP 1717090321668

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-b04"
export BK_EXAMINATION="CTLCardinality"
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-b04, examination is CTLCardinality"
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-171690533300865"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b04.tgz
mv Szymanski-PT-b04 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;