Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505100086.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 CANConstruction-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505100086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 15M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2023-11
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716234882282

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-20 19:54:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 19:54:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 19:54:44] [INFO ] Load time of PNML (sax parser for PT used): 761 ms
[2024-05-20 19:54:44] [INFO ] Transformed 21202 places.
[2024-05-20 19:54:44] [INFO ] Transformed 40800 transitions.
[2024-05-20 19:54:44] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 980 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (20 resets) in 5594 ms. (7 steps per ms) remains 10/16 properties
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 745 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1327 ms. (30 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 470 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
// Phase 1: matrix 40800 rows 21202 cols
[2024-05-20 19:54:48] [INFO ] Flatten gal took : 2381 ms
[2024-05-20 19:54:48] [INFO ] Computed 201 invariants in 671 ms
[2024-05-20 19:54:48] [INFO ] State equation strengthened by 19900 read => feed constraints.
[2024-05-20 19:54:49] [INFO ] Flatten gal took : 978 ms
[2024-05-20 19:54:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13287020464458691598.gal : 261 ms
All remaining problems are real, not stopping.
[2024-05-20 19:54:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality670980868352935372.prop : 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13287020464458691598.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality670980868352935372.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Problem CANConstruction-PT-100-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-100-ReachabilityCardinality-2024-12 is UNSAT
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 20866/21088 variables, 88/88 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 21088/62002 variables, and 88 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5062 ms.
Refiners :[Positive P Invariants (semi-flows): 88/101 constraints, Generalized P Invariants (flows): 0/100 constraints, State Equation: 0/21202 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 20937/21076 variables, 76/76 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Loading property file /tmp/ReachabilityCardinality670980868352935372.prop.
[2024-05-20 19:56:09] [INFO ] Deduced a trap composed of 5 places in 72607 ms of which 777 ms to minimize.
SMT process timed out in 82302ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 139 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 21202 transition count 40102
Reduce places removed 698 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 699 rules applied. Total rules applied 1397 place count 20504 transition count 40101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1398 place count 20503 transition count 40101
Performed 9830 Post agglomeration using F-continuation condition.Transition count delta: 9830
Deduced a syphon composed of 9830 places in 15 ms
Reduce places removed 9830 places and 0 transitions.
Iterating global reduction 3 with 19660 rules applied. Total rules applied 21058 place count 10673 transition count 30271
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 21154 place count 10577 transition count 30079
Iterating global reduction 3 with 96 rules applied. Total rules applied 21250 place count 10577 transition count 30079
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21251 place count 10577 transition count 30079
Applied a total of 21251 rules in 19749 ms. Remains 10577 /21202 variables (removed 10625) and now considering 30079/40800 (removed 10721) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19769 ms. Remains : 10577/21202 places, 30079/40800 transitions.
RANDOM walk for 40000 steps (54 resets) in 2691 ms. (14 steps per ms) remains 5/8 properties
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
// Phase 1: matrix 30079 rows 10577 cols
[2024-05-20 19:56:31] [INFO ] Computed 201 invariants in 228 ms
[2024-05-20 19:56:31] [INFO ] State equation strengthened by 29729 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10349/10428 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10428 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 48/10476 variables, 48/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10476 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 100/10576 variables, 100/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10576 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 30079/40655 variables, 10576/10777 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40655 variables, 29729/40506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40655 variables, 0/40506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/40656 variables, 1/40507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40656 variables, 0/40507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/40656 variables, 0/40507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40656/40656 variables, and 40507 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45065 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 10577/10577 constraints, ReadFeed: 29729/29729 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10349/10428 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 19:57:44] [INFO ] Deduced a trap composed of 2 places in 26980 ms of which 65 ms to minimize.
[2024-05-20 19:57:48] [INFO ] Deduced a trap composed of 104 places in 3738 ms of which 24 ms to minimize.
[2024-05-20 19:57:52] [INFO ] Deduced a trap composed of 104 places in 3625 ms of which 24 ms to minimize.
[2024-05-20 19:57:55] [INFO ] Deduced a trap composed of 105 places in 3399 ms of which 24 ms to minimize.
[2024-05-20 19:57:59] [INFO ] Deduced a trap composed of 104 places in 3319 ms of which 24 ms to minimize.
[2024-05-20 19:58:02] [INFO ] Deduced a trap composed of 104 places in 3149 ms of which 23 ms to minimize.
SMT process timed out in 91812ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 79 out of 10577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10577/10577 places, 30079/30079 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 10572 transition count 30069
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 10572 transition count 30069
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 11 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 50 place count 10552 transition count 30049
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 19 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 10547 transition count 30049
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 10547 transition count 30049
Applied a total of 61 rules in 23573 ms. Remains 10547 /10577 variables (removed 30) and now considering 30049/30079 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23574 ms. Remains : 10547/10577 places, 30049/30079 transitions.
RANDOM walk for 40000 steps (55 resets) in 2524 ms. (15 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 78870 steps, run timeout after 3002 ms. (steps per millisecond=26 ) properties seen :0 out of 5
Probabilistic random walk after 78870 steps, saw 73973 distinct states, run finished after 3019 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 30049 rows 10547 cols
[2024-05-20 19:58:30] [INFO ] Computed 201 invariants in 255 ms
[2024-05-20 19:58:30] [INFO ] State equation strengthened by 29759 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10319/10398 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10398 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 48/10446 variables, 48/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10446 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 100/10546 variables, 100/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10546 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 30049/40595 variables, 10546/10747 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40595 variables, 29759/40506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40595 variables, 0/40506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/40596 variables, 1/40507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40596 variables, 0/40507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/40596 variables, 0/40507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40596/40596 variables, and 40507 constraints, problems are : Problem set: 0 solved, 5 unsolved in 47519 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 10547/10547 constraints, ReadFeed: 29759/29759 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10319/10398 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-20 19:59:45] [INFO ] Deduced a trap composed of 2 places in 26150 ms of which 61 ms to minimize.
[2024-05-20 19:59:49] [INFO ] Deduced a trap composed of 108 places in 3524 ms of which 23 ms to minimize.
[2024-05-20 19:59:52] [INFO ] Deduced a trap composed of 110 places in 3374 ms of which 24 ms to minimize.
[2024-05-20 19:59:56] [INFO ] Deduced a trap composed of 104 places in 3258 ms of which 23 ms to minimize.
[2024-05-20 19:59:59] [INFO ] Deduced a trap composed of 110 places in 3138 ms of which 23 ms to minimize.
[2024-05-20 20:00:02] [INFO ] Deduced a trap composed of 105 places in 2949 ms of which 23 ms to minimize.
[2024-05-20 20:00:05] [INFO ] Deduced a trap composed of 105 places in 2743 ms of which 23 ms to minimize.
[2024-05-20 20:00:08] [INFO ] Deduced a trap composed of 104 places in 2448 ms of which 20 ms to minimize.
[2024-05-20 20:00:10] [INFO ] Deduced a trap composed of 104 places in 2587 ms of which 21 ms to minimize.
[2024-05-20 20:00:13] [INFO ] Deduced a trap composed of 104 places in 2389 ms of which 20 ms to minimize.
[2024-05-20 20:00:16] [INFO ] Deduced a trap composed of 104 places in 2706 ms of which 21 ms to minimize.
[2024-05-20 20:00:19] [INFO ] Deduced a trap composed of 104 places in 2689 ms of which 21 ms to minimize.
[2024-05-20 20:00:21] [INFO ] Deduced a trap composed of 104 places in 2741 ms of which 22 ms to minimize.
[2024-05-20 20:00:24] [INFO ] Deduced a trap composed of 104 places in 2727 ms of which 21 ms to minimize.
[2024-05-20 20:00:27] [INFO ] Deduced a trap composed of 104 places in 2706 ms of which 22 ms to minimize.
[2024-05-20 20:00:30] [INFO ] Deduced a trap composed of 110 places in 2626 ms of which 22 ms to minimize.
[2024-05-20 20:00:33] [INFO ] Deduced a trap composed of 110 places in 2624 ms of which 21 ms to minimize.
[2024-05-20 20:00:35] [INFO ] Deduced a trap composed of 109 places in 2639 ms of which 20 ms to minimize.
SMT process timed out in 125576ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 79 out of 10547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10547/10547 places, 30049/30049 transitions.
Applied a total of 0 rules in 4657 ms. Remains 10547 /10547 variables (removed 0) and now considering 30049/30049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4659 ms. Remains : 10547/10547 places, 30049/30049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10547/10547 places, 30049/30049 transitions.
Applied a total of 0 rules in 4745 ms. Remains 10547 /10547 variables (removed 0) and now considering 30049/30049 (removed 0) transitions.
[2024-05-20 20:00:45] [INFO ] Invariant cache hit.
[2024-05-20 20:00:57] [INFO ] Implicit Places using invariants in 11876 ms returned [5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 65, 71, 77, 83, 89, 95, 101, 107, 113, 119, 125, 131, 137, 143, 149, 155, 161, 167, 173, 179, 185, 191, 197, 203, 209, 215, 221, 227, 233, 239, 245, 251, 257, 263, 269, 275, 281, 287, 293, 299, 305, 311, 317, 323, 329, 335, 341, 347, 353, 359, 365, 371, 377, 383, 389, 395, 401, 407, 413, 419, 425, 431, 437, 443, 449, 455, 461, 467, 473, 479, 485, 491, 497, 503, 509, 515, 521, 527, 533, 539, 545, 551, 557, 563, 569, 575, 581, 587, 593, 600]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 11922 ms to find 100 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10447/10547 places, 30049/30049 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 199
Deduced a syphon composed of 199 places in 7 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 10248 transition count 29850
Applied a total of 398 rules in 405504 ms. Remains 10248 /10447 variables (removed 199) and now considering 29850/30049 (removed 199) transitions.
// Phase 1: matrix 29850 rows 10248 cols
[2024-05-20 20:07:44] [INFO ] Computed 101 invariants in 2224 ms
[2024-05-20 20:07:55] [INFO ] Implicit Places using invariants in 12744 ms returned []
Implicit Place search using SMT only with invariants took 12745 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 10248/10547 places, 29850/30049 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 434920 ms. Remains : 10248/10547 places, 29850/30049 transitions.
RANDOM walk for 40000 steps (78 resets) in 2499 ms. (16 steps per ms) remains 4/5 properties
FORMULA CANConstruction-PT-100-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
[2024-05-20 20:07:56] [INFO ] Invariant cache hit.
[2024-05-20 20:07:57] [INFO ] State equation strengthened by 29660 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10122/10196 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10196 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 51/10247 variables, 51/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10247 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 29850/40097 variables, 10247/10348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40097 variables, 29660/40008 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40097 variables, 0/40008 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/40098 variables, 1/40009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40098 variables, 0/40009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/40098 variables, 0/40009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40098/40098 variables, and 40009 constraints, problems are : Problem set: 0 solved, 4 unsolved in 46579 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 10248/10248 constraints, ReadFeed: 29660/29660 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10122/10196 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 20:09:10] [INFO ] Deduced a trap composed of 2 places in 24917 ms of which 60 ms to minimize.
[2024-05-20 20:09:36] [INFO ] Deduced a trap composed of 2 places in 25455 ms of which 55 ms to minimize.
[2024-05-20 20:09:39] [INFO ] Deduced a trap composed of 103 places in 2741 ms of which 20 ms to minimize.
[2024-05-20 20:09:41] [INFO ] Deduced a trap composed of 102 places in 2610 ms of which 20 ms to minimize.
[2024-05-20 20:09:44] [INFO ] Deduced a trap composed of 102 places in 2386 ms of which 18 ms to minimize.
[2024-05-20 20:09:46] [INFO ] Deduced a trap composed of 102 places in 2517 ms of which 19 ms to minimize.
[2024-05-20 20:09:49] [INFO ] Deduced a trap composed of 103 places in 2343 ms of which 20 ms to minimize.
[2024-05-20 20:09:51] [INFO ] Deduced a trap composed of 102 places in 2262 ms of which 18 ms to minimize.
[2024-05-20 20:09:54] [INFO ] Deduced a trap composed of 102 places in 2305 ms of which 19 ms to minimize.
[2024-05-20 20:09:56] [INFO ] Deduced a trap composed of 102 places in 2343 ms of which 28 ms to minimize.
[2024-05-20 20:09:59] [INFO ] Deduced a trap composed of 103 places in 2201 ms of which 21 ms to minimize.
[2024-05-20 20:10:01] [INFO ] Deduced a trap composed of 103 places in 1976 ms of which 17 ms to minimize.
[2024-05-20 20:10:03] [INFO ] Deduced a trap composed of 103 places in 1805 ms of which 17 ms to minimize.
[2024-05-20 20:10:05] [INFO ] Deduced a trap composed of 102 places in 1958 ms of which 17 ms to minimize.
[2024-05-20 20:10:07] [INFO ] Deduced a trap composed of 102 places in 1997 ms of which 17 ms to minimize.
[2024-05-20 20:10:09] [INFO ] Deduced a trap composed of 102 places in 2105 ms of which 17 ms to minimize.
[2024-05-20 20:10:11] [INFO ] Deduced a trap composed of 103 places in 1892 ms of which 17 ms to minimize.
[2024-05-20 20:10:13] [INFO ] Deduced a trap composed of 102 places in 2099 ms of which 17 ms to minimize.
[2024-05-20 20:10:15] [INFO ] Deduced a trap composed of 102 places in 1971 ms of which 17 ms to minimize.
SMT process timed out in 139460ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 74 out of 10248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10248/10248 places, 29850/29850 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 10243 transition count 29845
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 102
Applied a total of 10 rules in 530970 ms. Remains 10243 /10248 variables (removed 5) and now considering 29845/29850 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 530970 ms. Remains : 10243/10248 places, 29845/29850 transitions.
RANDOM walk for 40000 steps (80 resets) in 2399 ms. (16 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
Probabilistic random walk after 132197 steps, saw 131853 distinct states, run finished after 3010 ms. (steps per millisecond=43 ) properties seen :0
// Phase 1: matrix 29845 rows 10243 cols
[2024-05-20 20:19:13] [INFO ] Computed 101 invariants in 2224 ms
[2024-05-20 20:19:13] [INFO ] State equation strengthened by 29663 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10117/10191 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10191 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 51/10242 variables, 51/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10242 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 29845/40087 variables, 10242/10343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40087 variables, 29663/40006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40087 variables, 0/40006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/40088 variables, 1/40007 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40088 variables, 0/40007 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/40088 variables, 0/40007 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40088/40088 variables, and 40007 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45438 ms.
Refiners :[Positive P Invariants (semi-flows): 101/101 constraints, State Equation: 10243/10243 constraints, ReadFeed: 29663/29663 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10117/10191 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 20:20:25] [INFO ] Deduced a trap composed of 2 places in 25182 ms of which 55 ms to minimize.
[2024-05-20 20:20:28] [INFO ] Deduced a trap composed of 103 places in 2822 ms of which 20 ms to minimize.
[2024-05-20 20:20:31] [INFO ] Deduced a trap composed of 102 places in 2642 ms of which 21 ms to minimize.
[2024-05-20 20:20:34] [INFO ] Deduced a trap composed of 103 places in 2473 ms of which 19 ms to minimize.
[2024-05-20 20:20:37] [INFO ] Deduced a trap composed of 102 places in 2886 ms of which 21 ms to minimize.
[2024-05-20 20:20:39] [INFO ] Deduced a trap composed of 102 places in 2668 ms of which 21 ms to minimize.
[2024-05-20 20:20:42] [INFO ] Deduced a trap composed of 103 places in 2472 ms of which 20 ms to minimize.
[2024-05-20 20:20:44] [INFO ] Deduced a trap composed of 102 places in 2108 ms of which 19 ms to minimize.
[2024-05-20 20:20:46] [INFO ] Deduced a trap composed of 102 places in 1993 ms of which 18 ms to minimize.
[2024-05-20 20:20:48] [INFO ] Deduced a trap composed of 102 places in 1912 ms of which 17 ms to minimize.
[2024-05-20 20:20:50] [INFO ] Deduced a trap composed of 102 places in 1743 ms of which 16 ms to minimize.
[2024-05-20 20:20:52] [INFO ] Deduced a trap composed of 102 places in 1842 ms of which 22 ms to minimize.
[2024-05-20 20:20:54] [INFO ] Deduced a trap composed of 102 places in 1741 ms of which 16 ms to minimize.
[2024-05-20 20:20:56] [INFO ] Deduced a trap composed of 103 places in 2059 ms of which 19 ms to minimize.
[2024-05-20 20:20:58] [INFO ] Deduced a trap composed of 102 places in 1914 ms of which 16 ms to minimize.
[2024-05-20 20:21:00] [INFO ] Deduced a trap composed of 102 places in 1702 ms of which 15 ms to minimize.
[2024-05-20 20:21:02] [INFO ] Deduced a trap composed of 102 places in 1602 ms of which 20 ms to minimize.
[2024-05-20 20:21:04] [INFO ] Deduced a trap composed of 103 places in 1502 ms of which 14 ms to minimize.
[2024-05-20 20:21:05] [INFO ] Deduced a trap composed of 102 places in 1293 ms of which 14 ms to minimize.
[2024-05-20 20:21:06] [INFO ] Deduced a trap composed of 102 places in 1186 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10191 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 20:21:09] [INFO ] Deduced a trap composed of 103 places in 2172 ms of which 19 ms to minimize.
[2024-05-20 20:21:11] [INFO ] Deduced a trap composed of 102 places in 2096 ms of which 18 ms to minimize.
[2024-05-20 20:21:13] [INFO ] Deduced a trap composed of 102 places in 2208 ms of which 19 ms to minimize.
[2024-05-20 20:21:15] [INFO ] Deduced a trap composed of 103 places in 2101 ms of which 18 ms to minimize.
[2024-05-20 20:21:18] [INFO ] Deduced a trap composed of 102 places in 1981 ms of which 18 ms to minimize.
[2024-05-20 20:21:20] [INFO ] Deduced a trap composed of 102 places in 1847 ms of which 16 ms to minimize.
[2024-05-20 20:21:22] [INFO ] Deduced a trap composed of 102 places in 1880 ms of which 17 ms to minimize.
[2024-05-20 20:21:24] [INFO ] Deduced a trap composed of 102 places in 1798 ms of which 16 ms to minimize.
[2024-05-20 20:21:26] [INFO ] Deduced a trap composed of 102 places in 2028 ms of which 18 ms to minimize.
[2024-05-20 20:21:28] [INFO ] Deduced a trap composed of 102 places in 2258 ms of which 18 ms to minimize.
[2024-05-20 20:21:30] [INFO ] Deduced a trap composed of 102 places in 2018 ms of which 17 ms to minimize.
[2024-05-20 20:21:32] [INFO ] Deduced a trap composed of 102 places in 2121 ms of which 18 ms to minimize.
[2024-05-20 20:21:34] [INFO ] Deduced a trap composed of 103 places in 1844 ms of which 17 ms to minimize.
[2024-05-20 20:21:36] [INFO ] Deduced a trap composed of 102 places in 1903 ms of which 16 ms to minimize.
[2024-05-20 20:21:39] [INFO ] Deduced a trap composed of 103 places in 1950 ms of which 17 ms to minimize.
[2024-05-20 20:21:40] [INFO ] Deduced a trap composed of 102 places in 1827 ms of which 16 ms to minimize.
[2024-05-20 20:21:42] [INFO ] Deduced a trap composed of 102 places in 1644 ms of which 15 ms to minimize.
[2024-05-20 20:21:44] [INFO ] Deduced a trap composed of 103 places in 1913 ms of which 16 ms to minimize.
SMT process timed out in 153956ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 74 out of 10243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10243/10243 places, 29845/29845 transitions.
Detected timeout of ITS tools.
[2024-05-20 20:24:50] [INFO ] Flatten gal took : 860 ms
[2024-05-20 20:24:50] [INFO ] Applying decomposition
[2024-05-20 20:24:51] [INFO ] Flatten gal took : 931 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/graph8483848554970607402.txt' '-o' '/tmp/graph8483848554970607402.bin' '-w' '/tmp/graph8483848554970607402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8483848554970607402.bin' '-l' '-1' '-v' '-w' '/tmp/graph8483848554970607402.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:24:54] [INFO ] Decomposing Gal with order
[2024-05-20 20:24:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:25:07] [INFO ] Removed a total of 25297 redundant transitions.
[2024-05-20 20:25:08] [INFO ] Flatten gal took : 3097 ms
[2024-05-20 20:25:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 3703 labels/synchronizations in 1087 ms.
[2024-05-20 20:25:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11388464749905449542.gal : 333 ms
[2024-05-20 20:25:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6359834599420965629.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11388464749905449542.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6359834599420965629.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6359834599420965629.prop.
Applied a total of 0 rules in 321641 ms. Remains 10243 /10243 variables (removed 0) and now considering 29845/29845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321642 ms. Remains : 10243/10243 places, 29845/29845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10243/10243 places, 29845/29845 transitions.
Applied a total of 0 rules in 305750 ms. Remains 10243 /10243 variables (removed 0) and now considering 29845/29845 (removed 0) transitions.
[2024-05-20 20:32:12] [INFO ] Invariant cache hit.
[2024-05-20 20:32:22] [INFO ] Implicit Places using invariants in 10674 ms returned []
Implicit Place search using SMT only with invariants took 10677 ms to find 0 implicit places.
Running 29745 sub problems to find dead transitions.
[2024-05-20 20:32:23] [INFO ] Invariant cache hit.
[2024-05-20 20:32:24] [INFO ] State equation strengthened by 29663 read => feed constraints.

BK_STOP 1716237203757

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="CANConstruction-PT-100"
export BK_EXAMINATION="ReachabilityCardinality"
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 CANConstruction-PT-100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505100086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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