About the Execution of ITS-Tools for Szymanski-PT-b02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11137.195 | 356260.00 | 505054.00 | 811.90 | 1 1 1 0 1 0 0 1 1 1 1 1 0 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690533300861.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Szymanski-PT-b02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690533300861
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 15:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 15:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Szymanski-PT-b02-UpperBounds-00
FORMULA_NAME Szymanski-PT-b02-UpperBounds-01
FORMULA_NAME Szymanski-PT-b02-UpperBounds-02
FORMULA_NAME Szymanski-PT-b02-UpperBounds-03
FORMULA_NAME Szymanski-PT-b02-UpperBounds-04
FORMULA_NAME Szymanski-PT-b02-UpperBounds-05
FORMULA_NAME Szymanski-PT-b02-UpperBounds-06
FORMULA_NAME Szymanski-PT-b02-UpperBounds-07
FORMULA_NAME Szymanski-PT-b02-UpperBounds-08
FORMULA_NAME Szymanski-PT-b02-UpperBounds-09
FORMULA_NAME Szymanski-PT-b02-UpperBounds-10
FORMULA_NAME Szymanski-PT-b02-UpperBounds-11
FORMULA_NAME Szymanski-PT-b02-UpperBounds-12
FORMULA_NAME Szymanski-PT-b02-UpperBounds-13
FORMULA_NAME Szymanski-PT-b02-UpperBounds-14
FORMULA_NAME Szymanski-PT-b02-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717089021270
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-30 17:10:22] [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-30 17:10:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 17:10:22] [INFO ] Load time of PNML (sax parser for PT used): 391 ms
[2024-05-30 17:10:22] [INFO ] Transformed 568 places.
[2024-05-30 17:10:22] [INFO ] Transformed 8320 transitions.
[2024-05-30 17:10:22] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 533 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b02-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-30 17:10:23] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-05-30 17:10:23] [INFO ] Computed 3 invariants in 59 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (3 resets) in 99 ms. (100 steps per ms)
FORMULA Szymanski-PT-b02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (15 resets) in 196 ms. (355 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-05-30 17:10:23] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-05-30 17:10:23] [INFO ] Invariant cache hit.
[2024-05-30 17:10:23] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-30 17:10:23] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 13 ms returned sat
[2024-05-30 17:10:24] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2024-05-30 17:10:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:10:24] [INFO ] [Real]Added 147 Read/Feed constraints in 137 ms returned sat
[2024-05-30 17:10:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:10:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 17:10:24] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 17:10:25] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2024-05-30 17:10:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:10:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 1050 ms returned unknown
[2024-05-30 17:10:26] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 17:10:26] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-30 17:10:26] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2024-05-30 17:10:27] [INFO ] [Real]Added 147 Read/Feed constraints in 297 ms returned sat
[2024-05-30 17:10:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:10:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2024-05-30 17:10:27] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 17:10:27] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2024-05-30 17:10:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:10:28] [INFO ] [Nat]Added 147 Read/Feed constraints in 1044 ms returned unknown
[2024-05-30 17:10:28] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 17:10:28] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 17:10:29] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2024-05-30 17:10:29] [INFO ] [Real]Added 147 Read/Feed constraints in 303 ms returned sat
[2024-05-30 17:10:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:10:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 17:10:29] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 17:10:30] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2024-05-30 17:10:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:10:31] [INFO ] [Nat]Added 147 Read/Feed constraints in 1058 ms returned unknown
[2024-05-30 17:10:31] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 17:10:31] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 17:10:31] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2024-05-30 17:10:32] [INFO ] [Real]Added 147 Read/Feed constraints in 346 ms returned sat
[2024-05-30 17:10:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:10:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 17:10:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 17:10:32] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2024-05-30 17:10:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:10:33] [INFO ] [Nat]Added 147 Read/Feed constraints in 1050 ms returned unknown
[2024-05-30 17:10:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-30 17:10:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 17:10:34] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2024-05-30 17:10:34] [INFO ] [Real]Added 147 Read/Feed constraints in 60 ms returned sat
[2024-05-30 17:10:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:10:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-30 17:10:34] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 17:10:34] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-05-30 17:10:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:10:35] [INFO ] [Nat]Added 147 Read/Feed constraints in 1044 ms returned unknown
[2024-05-30 17:10:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-30 17:10:35] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 17:10:36] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2024-05-30 17:10:36] [INFO ] [Real]Added 147 Read/Feed constraints in 130 ms returned sat
[2024-05-30 17:10:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:10:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-30 17:10:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 17:10:36] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2024-05-30 17:10:37] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:10:38] [INFO ] [Nat]Added 147 Read/Feed constraints in 1047 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 306 transition count 7938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 305 transition count 7810
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 305 transition count 7810
Applied a total of 129 rules in 504 ms. Remains 305 /308 variables (removed 3) and now considering 7810/8064 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 519 ms. Remains : 305/308 places, 7810/8064 transitions.
[2024-05-30 17:10:38] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2024-05-30 17:10:38] [INFO ] Computed 1 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2775 ms. (360 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 5981 ms. (1003 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-05-30 17:10:47] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-30 17:10:47] [INFO ] Invariant cache hit.
[2024-05-30 17:10:47] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-30 17:10:47] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2024-05-30 17:10:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:10:47] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 17:10:48] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2024-05-30 17:10:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:10:52] [INFO ] [Nat]Added 147 Read/Feed constraints in 4246 ms returned sat
[2024-05-30 17:10:53] [INFO ] Deduced a trap composed of 134 places in 624 ms of which 23 ms to minimize.
[2024-05-30 17:10:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 789 ms
[2024-05-30 17:10:53] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2595 transitions) in 559 ms.
[2024-05-30 17:10:54] [INFO ] Added : 0 causal constraints over 0 iterations in 761 ms. Result :sat
Minimization took 4519 ms.
[2024-05-30 17:10:58] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 17:10:59] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2024-05-30 17:10:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:10:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-30 17:10:59] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2024-05-30 17:11:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:11:08] [INFO ] [Nat]Added 147 Read/Feed constraints in 9042 ms returned unknown
[2024-05-30 17:11:08] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-30 17:11:09] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2024-05-30 17:11:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:11:09] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-30 17:11:09] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2024-05-30 17:11:14] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:11:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 5483 ms returned sat
[2024-05-30 17:11:15] [INFO ] Deduced a trap composed of 167 places in 510 ms of which 3 ms to minimize.
[2024-05-30 17:11:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 635 ms
[2024-05-30 17:11:16] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2595 transitions) in 937 ms.
[2024-05-30 17:11:16] [INFO ] Added : 0 causal constraints over 0 iterations in 1097 ms. Result :sat
Minimization took 4501 ms.
[2024-05-30 17:11:21] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 17:11:21] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2024-05-30 17:11:22] [INFO ] [Real]Added 147 Read/Feed constraints in 76 ms returned sat
[2024-05-30 17:11:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:11:22] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 17:11:22] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2024-05-30 17:11:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 3755 ms returned sat
[2024-05-30 17:11:26] [INFO ] Deduced a trap composed of 45 places in 389 ms of which 2 ms to minimize.
[2024-05-30 17:11:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 510 ms
[2024-05-30 17:11:27] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2595 transitions) in 352 ms.
[2024-05-30 17:11:27] [INFO ] Added : 0 causal constraints over 0 iterations in 529 ms. Result :sat
Minimization took 4507 ms.
[2024-05-30 17:11:31] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-30 17:11:32] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2024-05-30 17:11:32] [INFO ] [Real]Added 147 Read/Feed constraints in 173 ms returned sat
[2024-05-30 17:11:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:11:32] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 17:11:33] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2024-05-30 17:11:34] [INFO ] [Nat]Added 147 Read/Feed constraints in 1230 ms returned sat
[2024-05-30 17:11:34] [INFO ] Deduced a trap composed of 72 places in 531 ms of which 5 ms to minimize.
[2024-05-30 17:11:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 669 ms
[2024-05-30 17:11:35] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2595 transitions) in 354 ms.
[2024-05-30 17:11:35] [INFO ] Added : 0 causal constraints over 0 iterations in 513 ms. Result :sat
Minimization took 4532 ms.
[2024-05-30 17:11:40] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-30 17:11:40] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2024-05-30 17:11:40] [INFO ] [Real]Added 147 Read/Feed constraints in 110 ms returned sat
[2024-05-30 17:11:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 17:11:40] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-30 17:11:41] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2024-05-30 17:11:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 17:11:50] [INFO ] [Nat]Added 147 Read/Feed constraints in 9043 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 242 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 296 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2024-05-30 17:11:50] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-30 17:11:50] [INFO ] Invariant cache hit.
[2024-05-30 17:11:51] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-30 17:11:51] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-30 17:11:51] [INFO ] Invariant cache hit.
[2024-05-30 17:11:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:12:28] [INFO ] Performed 96/305 implicitness test of which 0 returned IMPLICIT in 36 seconds.
[2024-05-30 17:13:03] [INFO ] Performed 105/305 implicitness test of which 0 returned IMPLICIT in 71 seconds.
[2024-05-30 17:13:27] [INFO ] Implicit Places using invariants and state equation in 96475 ms returned []
Implicit Place search using SMT with State Equation took 96967 ms to find 0 implicit places.
[2024-05-30 17:13:28] [INFO ] Redundant transitions in 910 ms returned []
Running 7808 sub problems to find dead transitions.
[2024-05-30 17:13:28] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-30 17:13:28] [INFO ] Invariant cache hit.
[2024-05-30 17:13:29] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2911 variables, and 1 constraints, problems are : Problem set: 0 solved, 7808 unsolved in 30150 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7808/7808 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7808 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2911 variables, and 1 constraints, problems are : Problem set: 0 solved, 7808 unsolved in 30096 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7808 constraints, Known Traps: 0/0 constraints]
After SMT, in 87677ms problems are : Problem set: 0 solved, 7808 unsolved
Search for dead transitions found 0 dead transitions in 87813ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186060 ms. Remains : 305/305 places, 7810/7810 transitions.
RANDOM walk for 40002 steps (8 resets) in 1996 ms. (20 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 180 ms. (221 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 169 ms. (235 steps per ms) remains 8/10 properties
[2024-05-30 17:14:57] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2024-05-30 17:14:57] [INFO ] Invariant cache hit.
[2024-05-30 17:14:58] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 301/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 17:14:58] [INFO ] Flatten gal took : 1110 ms
[2024-05-30 17:14:58] [INFO ] Deduced a trap composed of 72 places in 626 ms of which 3 ms to minimize.
[2024-05-30 17:14:58] [INFO ] Flatten gal took : 541 ms
[2024-05-30 17:14:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality359622906283345331.gal : 85 ms
[2024-05-30 17:14:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13509975448844596423.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/ReachabilityCardinality359622906283345331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13509975448844596423.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
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Loading property file /tmp/ReachabilityCardinality13509975448844596423.prop.
At refinement iteration 4 (OVERLAPS) 2606/2911 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2911 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 55
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :55 after 196
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :196 after 383
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :383 after 812
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :812 after 1300
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2911 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2911/2911 variables, and 454 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5012 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 301/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 17:15:03] [INFO ] Deduced a trap composed of 45 places in 432 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2606/2911 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1300 after 2780
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :2780 after 6764
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :6764 after 9763
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2911/2911 variables, and 455 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 10062ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 305 transition count 7808
Applied a total of 2 rules in 197 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7810 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 305/305 places, 7808/7810 transitions.
RANDOM walk for 40002 steps (8 resets) in 419 ms. (95 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :9763 after 22118
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 118831 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 8
Probabilistic random walk after 118831 steps, saw 41674 distinct states, run finished after 3004 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-30 17:15:11] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-30 17:15:11] [INFO ] Computed 3 invariants in 15 ms
[2024-05-30 17:15:11] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 17:15:12] [INFO ] Deduced a trap composed of 78 places in 476 ms of which 3 ms to minimize.
[2024-05-30 17:15:13] [INFO ] Deduced a trap composed of 103 places in 486 ms of which 3 ms to minimize.
[2024-05-30 17:15:13] [INFO ] Deduced a trap composed of 134 places in 537 ms of which 2 ms to minimize.
[2024-05-30 17:15:14] [INFO ] Deduced a trap composed of 134 places in 747 ms of which 3 ms to minimize.
[2024-05-30 17:15:15] [INFO ] Deduced a trap composed of 130 places in 611 ms of which 2 ms to minimize.
[2024-05-30 17:15:15] [INFO ] Deduced a trap composed of 129 places in 427 ms of which 2 ms to minimize.
[2024-05-30 17:15:16] [INFO ] Deduced a trap composed of 45 places in 408 ms of which 3 ms to minimize.
[2024-05-30 17:15:16] [INFO ] Deduced a trap composed of 138 places in 704 ms of which 2 ms to minimize.
[2024-05-30 17:15:17] [INFO ] Deduced a trap composed of 44 places in 472 ms of which 2 ms to minimize.
[2024-05-30 17:15:17] [INFO ] Deduced a trap composed of 72 places in 406 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 17:15:18] [INFO ] Deduced a trap composed of 130 places in 403 ms of which 2 ms to minimize.
[2024-05-30 17:15:18] [INFO ] Deduced a trap composed of 129 places in 412 ms of which 2 ms to minimize.
[2024-05-30 17:15:18] [INFO ] Deduced a trap composed of 137 places in 248 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 17:15:19] [INFO ] Deduced a trap composed of 146 places in 318 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2604/2909 variables, 305/322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 147/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 469 constraints, problems are : Problem set: 0 solved, 8 unsolved in 16992 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :22118 after 46465
Detected timeout of ITS tools.
[2024-05-30 17:15:49] [INFO ] Flatten gal took : 206 ms
[2024-05-30 17:15:49] [INFO ] Applying decomposition
[2024-05-30 17:15:49] [INFO ] Flatten gal took : 202 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/graph3562205605017289369.txt' '-o' '/tmp/graph3562205605017289369.bin' '-w' '/tmp/graph3562205605017289369.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3562205605017289369.bin' '-l' '-1' '-v' '-w' '/tmp/graph3562205605017289369.weights' '-q' '0' '-e' '0.001'
[2024-05-30 17:15:50] [INFO ] Decomposing Gal with order
[2024-05-30 17:15:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 17:15:51] [INFO ] Removed a total of 18113 redundant transitions.
[2024-05-30 17:15:51] [INFO ] Flatten gal took : 765 ms
[2024-05-30 17:15:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 1088 labels/synchronizations in 287 ms.
[2024-05-30 17:15:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1813027535652962229.gal : 36 ms
[2024-05-30 17:15:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6104930123411114198.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/ReachabilityCardinality1813027535652962229.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6104930123411114198.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality6104930123411114198.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :5 after 28
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :28 after 236
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :236 after 365
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :365 after 403
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :403 after 405
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :405 after 405
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :405 after 730
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :730 after 4260
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13617 after 14103
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 469 constraints, problems are : Problem set: 6 solved, 2 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 14/14 constraints]
After SMT, in 62092ms problems are : Problem set: 6 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 227 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40001 steps (8 resets) in 267 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 130937 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 130937 steps, saw 45770 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-30 17:16:17] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:16:17] [INFO ] Invariant cache hit.
[2024-05-30 17:16:17] [INFO ] State equation strengthened by 147 read => feed constraints.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
After SMT solving in domain Real declared 1/2909 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Szymanski-PT-b02-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b02-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b02-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b02-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b02-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b02-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 6 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 355058 ms.
BK_STOP 1717089377530
--------------------
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="Szymanski-PT-b02"
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 Szymanski-PT-b02, 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 r400-tall-171690533300861"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b02.tgz
mv Szymanski-PT-b02 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 '
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 ;