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

About the Execution of ITS-Tools for SafeBus-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 302860.00 0.00 0.00 ? 15 1 1 1 1 1 15 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r334-tall-171679080300437.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 SafeBus-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080300437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 28K Apr 12 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 202K Apr 12 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 961K Apr 12 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 12 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 88K Apr 12 16:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 488K Apr 12 16:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 378K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.5M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716831659331

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-27 17:41:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 17:41:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 17:41:00] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2024-05-27 17:41:00] [INFO ] Transformed 621 places.
[2024-05-27 17:41:00] [INFO ] Transformed 4771 transitions.
[2024-05-27 17:41:00] [INFO ] Found NUPN structural information;
[2024-05-27 17:41:00] [INFO ] Parsed PT model containing 621 places and 4771 transitions and 34549 arcs in 417 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 15 places and 0 transitions.
FORMULA SafeBus-PT-15-UpperBounds-01 15 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0] Max Struct:[15, 1, 1, 15, 1, 15, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA SafeBus-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[15, 1, 15, 1, 15, 1, 1, 1, 1, 1, 1]
[2024-05-27 17:41:00] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2024-05-27 17:41:01] [INFO ] Computed 65 invariants in 65 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[15, 1, 15, 1, 15, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 340 ms. (29 steps per ms)
FORMULA SafeBus-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-07 15 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 66 ms. (298 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 1] Max Struct:[15, 15]
[2024-05-27 17:41:01] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2024-05-27 17:41:01] [INFO ] Invariant cache hit.
[2024-05-27 17:41:01] [INFO ] [Real]Absence check using 32 positive place invariants in 20 ms returned sat
[2024-05-27 17:41:01] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 22 ms returned sat
[2024-05-27 17:41:02] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2024-05-27 17:41:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:41:02] [INFO ] [Nat]Absence check using 32 positive place invariants in 29 ms returned sat
[2024-05-27 17:41:02] [INFO ] [Nat]Absence check using 32 positive and 33 generalized place invariants in 20 ms returned sat
[2024-05-27 17:41:03] [INFO ] [Nat]Absence check using state equation in 886 ms returned sat
[2024-05-27 17:41:03] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 17:41:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 17:41:04] [INFO ] [Nat]Added 241 Read/Feed constraints in 800 ms returned sat
[2024-05-27 17:41:05] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 270 ms.
[2024-05-27 17:41:05] [INFO ] Added : 0 causal constraints over 0 iterations in 419 ms. Result :sat
Minimization took 574 ms.
[2024-05-27 17:41:05] [INFO ] [Real]Absence check using 32 positive place invariants in 16 ms returned sat
[2024-05-27 17:41:05] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[8, 1] Max Struct:[15, 1]
FORMULA SafeBus-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[15]
Support contains 15 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 606 transition count 4756
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 30 place count 591 transition count 4756
Applied a total of 30 rules in 2315 ms. Remains 591 /606 variables (removed 15) and now considering 4756/4771 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2328 ms. Remains : 591/606 places, 4756/4771 transitions.
[2024-05-27 17:41:08] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 591 cols
[2024-05-27 17:41:08] [INFO ] Computed 65 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 15848 ms. (63 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 3003 ms. (332 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[15]
[2024-05-27 17:41:27] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:41:27] [INFO ] Invariant cache hit.
[2024-05-27 17:41:27] [INFO ] [Real]Absence check using 32 positive place invariants in 14 ms returned sat
[2024-05-27 17:41:27] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 15 ms returned sat
[2024-05-27 17:41:27] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2024-05-27 17:41:27] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 17:41:28] [INFO ] [Real]Added 241 Read/Feed constraints in 361 ms returned sat
[2024-05-27 17:41:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:41:28] [INFO ] [Nat]Absence check using 32 positive place invariants in 18 ms returned sat
[2024-05-27 17:41:28] [INFO ] [Nat]Absence check using 32 positive and 33 generalized place invariants in 14 ms returned sat
[2024-05-27 17:41:28] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2024-05-27 17:41:29] [INFO ] [Nat]Added 241 Read/Feed constraints in 1342 ms returned sat
[2024-05-27 17:41:30] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 190 ms.
[2024-05-27 17:41:30] [INFO ] Added : 0 causal constraints over 0 iterations in 313 ms. Result :sat
Minimization took 4298 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[15]
Support contains 15 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 1060 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1060 ms. Remains : 591/591 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 865 ms. Remains 591 /591 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-05-27 17:41:38] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:41:38] [INFO ] Invariant cache hit.
[2024-05-27 17:41:43] [INFO ] Implicit Places using invariants in 4795 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 4805 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 576/591 places, 4756/4756 transitions.
Applied a total of 0 rules in 997 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6669 ms. Remains : 576/591 places, 4756/4756 transitions.
[2024-05-27 17:41:44] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2024-05-27 17:41:44] [INFO ] Computed 50 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[12] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 14173 ms. (70 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2614 ms. (382 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[15]
[2024-05-27 17:42:01] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:42:01] [INFO ] Invariant cache hit.
[2024-05-27 17:42:01] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-27 17:42:01] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 29 ms returned sat
[2024-05-27 17:42:01] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2024-05-27 17:42:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 17:42:01] [INFO ] [Real]Added 241 Read/Feed constraints in 345 ms returned sat
[2024-05-27 17:42:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:42:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-27 17:42:02] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 9 ms returned sat
[2024-05-27 17:42:02] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2024-05-27 17:42:03] [INFO ] [Nat]Added 241 Read/Feed constraints in 1491 ms returned sat
[2024-05-27 17:42:04] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 169 ms.
[2024-05-27 17:42:04] [INFO ] Added : 0 causal constraints over 0 iterations in 297 ms. Result :sat
Minimization took 4505 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[15]
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 897 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 897 ms. Remains : 576/576 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 884 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-05-27 17:42:10] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:42:10] [INFO ] Invariant cache hit.
[2024-05-27 17:42:14] [INFO ] Implicit Places using invariants in 3573 ms returned []
[2024-05-27 17:42:14] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:42:14] [INFO ] Invariant cache hit.
[2024-05-27 17:42:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 17:42:22] [INFO ] Implicit Places using invariants and state equation in 8818 ms returned []
Implicit Place search using SMT with State Equation took 12396 ms to find 0 implicit places.
[2024-05-27 17:42:23] [INFO ] Redundant transitions in 354 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-05-27 17:42:23] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:42:23] [INFO ] Invariant cache hit.
[2024-05-27 17:42:23] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 576/576 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 57875ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 57945ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71624 ms. Remains : 576/576 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 1780 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 2/2 properties
[2024-05-27 17:43:22] [INFO ] Flatten gal took : 552 ms
[2024-05-27 17:43:22] [INFO ] Flatten gal took : 218 ms
[2024-05-27 17:43:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11952400458093333924.gal : 82 ms
[2024-05-27 17:43:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1420105118695389190.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/ReachabilityCardinality11952400458093333924.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1420105118695389190.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/ReachabilityCardinality1420105118695389190.prop.
Interrupted probabilistic random walk after 103254 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 2
Probabilistic random walk after 103254 steps, saw 66841 distinct states, run finished after 3004 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-27 17:43:25] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:43:25] [INFO ] Invariant cache hit.
[2024-05-27 17:43:25] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 497/512 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 497/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
[2024-05-27 17:43:25] [INFO ] Deduced a trap composed of 287 places in 378 ms of which 27 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 1/529 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/529 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/572 variables, 31/560 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 60/620 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/620 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/574 variables, 2/622 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 2/624 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/624 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 16
At refinement iteration 12 (OVERLAPS) 1396/1970 variables, 574/1198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1970 variables, 240/1438 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1970 variables, 0/1438 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 3/1973 variables, 2/1440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1973 variables, 2/1442 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1973 variables, 1/1443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1973 variables, 1/1444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1973 variables, 0/1444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1973 variables, 0/1444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1973/1973 variables, and 1444 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1587 ms.
Refiners :[Domain max(s): 576/576 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 45
At refinement iteration 2 (OVERLAPS) 497/512 variables, 16/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 497/528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 1/529 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 17:43:27] [INFO ] Deduced a trap composed of 313 places in 338 ms of which 4 ms to minimize.
[2024-05-27 17:43:27] [INFO ] Deduced a trap composed of 313 places in 375 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 2/531 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/531 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/572 variables, 31/562 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 60/622 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 17:43:28] [INFO ] Deduced a trap composed of 61 places in 626 ms of which 4 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :45 after 152
[2024-05-27 17:43:28] [INFO ] Deduced a trap composed of 61 places in 607 ms of which 4 ms to minimize.
[2024-05-27 17:43:29] [INFO ] Deduced a trap composed of 74 places in 598 ms of which 4 ms to minimize.
[2024-05-27 17:43:30] [INFO ] Deduced a trap composed of 61 places in 630 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 4/626 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/626 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/574 variables, 2/628 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 2/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 0/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1396/1970 variables, 574/1204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :152 after 289
At refinement iteration 15 (INCLUDED_ONLY) 0/1970 variables, 240/1444 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1970 variables, 1/1445 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1970 variables, 0/1445 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1973 variables, 2/1447 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1973 variables, 2/1449 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1973 variables, 1/1450 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1973 variables, 1/1451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1973 variables, 0/1451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1973/1973 variables, and 1451 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5007 ms.
Refiners :[Domain max(s): 576/576 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 6671ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 960 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 963 ms. Remains : 576/576 places, 4756/4756 transitions.
RANDOM walk for 40000 steps (8 resets) in 944 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 139182 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 1
Probabilistic random walk after 139182 steps, saw 88893 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-27 17:43:36] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:43:36] [INFO ] Invariant cache hit.
[2024-05-27 17:43:36] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 497/512 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 497/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/572 variables, 31/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 60/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/574 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1396/1970 variables, 574/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1970 variables, 240/1437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1970 variables, 0/1437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/1973 variables, 2/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1973 variables, 2/1441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1973 variables, 1/1442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1973 variables, 1/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1973 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1973 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1973/1973 variables, and 1443 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1094 ms.
Refiners :[Domain max(s): 576/576 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 497/512 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 497/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :289 after 1076
[2024-05-27 17:43:37] [INFO ] Deduced a trap composed of 313 places in 375 ms of which 3 ms to minimize.
[2024-05-27 17:43:37] [INFO ] Deduced a trap composed of 339 places in 327 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/572 variables, 31/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 60/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 17:43:38] [INFO ] Deduced a trap composed of 74 places in 569 ms of which 3 ms to minimize.
[2024-05-27 17:43:39] [INFO ] Deduced a trap composed of 61 places in 555 ms of which 3 ms to minimize.
[2024-05-27 17:43:39] [INFO ] Deduced a trap composed of 61 places in 568 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 3/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/574 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 2/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1396/1970 variables, 574/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1970 variables, 240/1442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1970 variables, 1/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1970 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1973 variables, 2/1445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1973 variables, 2/1447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1973 variables, 1/1448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1973 variables, 1/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1973 variables, 0/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1973 variables, 0/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1973/1973 variables, and 1449 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3956 ms.
Refiners :[Domain max(s): 576/576 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 576/576 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 5106ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 697 ms.
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 964 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 964 ms. Remains : 576/576 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 995 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-05-27 17:43:43] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:43:43] [INFO ] Invariant cache hit.
[2024-05-27 17:43:47] [INFO ] Implicit Places using invariants in 3612 ms returned []
[2024-05-27 17:43:47] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:43:47] [INFO ] Invariant cache hit.
[2024-05-27 17:43:47] [INFO ] State equation strengthened by 241 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1076 after 4682
[2024-05-27 17:43:56] [INFO ] Implicit Places using invariants and state equation in 9040 ms returned []
Implicit Place search using SMT with State Equation took 12655 ms to find 0 implicit places.
[2024-05-27 17:43:56] [INFO ] Redundant transitions in 333 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-05-27 17:43:56] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:43:56] [INFO ] Invariant cache hit.
[2024-05-27 17:43:56] [INFO ] State equation strengthened by 241 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-27 17:44:13] [INFO ] Flatten gal took : 282 ms
[2024-05-27 17:44:13] [INFO ] Applying decomposition
[2024-05-27 17:44:13] [INFO ] Flatten gal took : 379 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/graph5318356008015462158.txt' '-o' '/tmp/graph5318356008015462158.bin' '-w' '/tmp/graph5318356008015462158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5318356008015462158.bin' '-l' '-1' '-v' '-w' '/tmp/graph5318356008015462158.weights' '-q' '0' '-e' '0.001'
[2024-05-27 17:44:14] [INFO ] Decomposing Gal with order
[2024-05-27 17:44:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 17:44:15] [INFO ] Removed a total of 908 redundant transitions.
[2024-05-27 17:44:15] [INFO ] Flatten gal took : 995 ms
[2024-05-27 17:44:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 807 labels/synchronizations in 90 ms.
[2024-05-27 17:44:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14379413644727395702.gal : 82 ms
[2024-05-27 17:44:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7090608244741376765.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14379413644727395702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7090608244741376765.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/ReachabilityCardinality7090608244741376765.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 20
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :20 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 48
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :48 after 56
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :56 after 90
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :90 after 148
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :148 after 3694
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3694 after 4020
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4020 after 4853
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4853 after 6687
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6687 after 113869
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 576/576 constraints. Problems are: Problem set: 0 solved, 4741 unsolved
SMT process timed out in 64813ms, After SMT, problems are : Problem set: 0 solved, 4741 unsolved
Search for dead transitions found 0 dead transitions in 64860ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78864 ms. Remains : 576/576 places, 4756/4756 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[12] Max Struct:[15]
Starting property specific reduction for SafeBus-PT-15-UpperBounds-00
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[15]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[15]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[15]
[2024-05-27 17:45:01] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:45:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[15]
RANDOM walk for 10000 steps (2 resets) in 147 ms. (67 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 28 ms. (344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[15]
[2024-05-27 17:45:01] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:45:01] [INFO ] Invariant cache hit.
[2024-05-27 17:45:02] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-27 17:45:02] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2024-05-27 17:45:02] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2024-05-27 17:45:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:45:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-27 17:45:02] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 9 ms returned sat
[2024-05-27 17:45:03] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2024-05-27 17:45:03] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 17:45:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 17:45:04] [INFO ] [Nat]Added 241 Read/Feed constraints in 1074 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[15]
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 997 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1000 ms. Remains : 576/576 places, 4756/4756 transitions.
[2024-05-27 17:45:05] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:45:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9] Max Struct:[15]
RANDOM walk for 1000000 steps (2 resets) in 14749 ms. (67 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2603 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[15]
[2024-05-27 17:45:22] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:45:22] [INFO ] Invariant cache hit.
[2024-05-27 17:45:22] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-27 17:45:22] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 10 ms returned sat
[2024-05-27 17:45:23] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2024-05-27 17:45:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 17:45:23] [INFO ] [Real]Added 241 Read/Feed constraints in 218 ms returned sat
[2024-05-27 17:45:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 17:45:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-27 17:45:23] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned sat
[2024-05-27 17:45:23] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2024-05-27 17:45:24] [INFO ] [Nat]Added 241 Read/Feed constraints in 1025 ms returned sat
[2024-05-27 17:45:25] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1352 transitions) in 170 ms.
[2024-05-27 17:45:25] [INFO ] Added : 0 causal constraints over 0 iterations in 296 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[15]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[15]
Support contains 15 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 979 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 979 ms. Remains : 576/576 places, 4756/4756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 4756/4756 transitions.
Applied a total of 0 rules in 1114 ms. Remains 576 /576 variables (removed 0) and now considering 4756/4756 (removed 0) transitions.
[2024-05-27 17:45:31] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:45:31] [INFO ] Invariant cache hit.
[2024-05-27 17:45:35] [INFO ] Implicit Places using invariants in 3590 ms returned []
[2024-05-27 17:45:35] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:45:35] [INFO ] Invariant cache hit.
[2024-05-27 17:45:35] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-27 17:45:44] [INFO ] Implicit Places using invariants and state equation in 8855 ms returned []
Implicit Place search using SMT with State Equation took 12447 ms to find 0 implicit places.
[2024-05-27 17:45:44] [INFO ] Redundant transitions in 167 ms returned []
Running 4741 sub problems to find dead transitions.
[2024-05-27 17:45:44] [INFO ] Flow matrix only has 1397 transitions (discarded 3359 similar events)
[2024-05-27 17:45:44] [INFO ] Invariant cache hit.
[2024-05-27 17:45:44] [INFO ] State equation strengthened by 241 read => feed constraints.

BK_STOP 1716831962191

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

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