Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713900701.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPt-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713900701
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.9M Mar 5 18:23 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 ShieldPPPt-PT-100B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679223789051

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-19 11:03:11] [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]
[2023-03-19 11:03:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 11:03:11] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2023-03-19 11:03:12] [INFO ] Transformed 7803 places.
[2023-03-19 11:03:12] [INFO ] Transformed 7103 transitions.
[2023-03-19 11:03:12] [INFO ] Found NUPN structural information;
[2023-03-19 11:03:12] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 689 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
FORMULA ShieldPPPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 7103 rows 7803 cols
[2023-03-19 11:03:12] [INFO ] Computed 1101 place invariants in 101 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 15) seen :6
FORMULA ShieldPPPt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
[2023-03-19 11:03:12] [INFO ] Invariant cache hit.
[2023-03-19 11:03:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 1587 ms returned sat
[2023-03-19 11:03:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:18] [INFO ] [Real]Absence check using state equation in 1894 ms returned unknown
[2023-03-19 11:03:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 1051 ms returned sat
[2023-03-19 11:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:23] [INFO ] [Real]Absence check using state equation in 2620 ms returned unknown
[2023-03-19 11:03:25] [INFO ] [Real]Absence check using 1101 positive place invariants in 1046 ms returned sat
[2023-03-19 11:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:28] [INFO ] [Real]Absence check using state equation in 2748 ms returned unknown
[2023-03-19 11:03:30] [INFO ] [Real]Absence check using 1101 positive place invariants in 871 ms returned sat
[2023-03-19 11:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:33] [INFO ] [Real]Absence check using state equation in 2880 ms returned unknown
[2023-03-19 11:03:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 1175 ms returned sat
[2023-03-19 11:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:38] [INFO ] [Real]Absence check using state equation in 2592 ms returned unknown
[2023-03-19 11:03:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 1033 ms returned sat
[2023-03-19 11:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:43] [INFO ] [Real]Absence check using state equation in 2749 ms returned unknown
[2023-03-19 11:03:45] [INFO ] [Real]Absence check using 1101 positive place invariants in 1071 ms returned sat
[2023-03-19 11:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:48] [INFO ] [Real]Absence check using state equation in 2501 ms returned unknown
[2023-03-19 11:03:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 1041 ms returned sat
[2023-03-19 11:03:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:53] [INFO ] [Real]Absence check using state equation in 2790 ms returned unknown
[2023-03-19 11:03:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 905 ms returned sat
[2023-03-19 11:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:03:58] [INFO ] [Real]Absence check using state equation in 2803 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1895 transitions
Trivial Post-agglo rules discarded 1895 transitions
Performed 1895 trivial Post agglomeration. Transition count delta: 1895
Iterating post reduction 0 with 1895 rules applied. Total rules applied 1895 place count 7803 transition count 5208
Reduce places removed 1895 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1897 rules applied. Total rules applied 3792 place count 5908 transition count 5206
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 3797 place count 5907 transition count 5202
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 3801 place count 5903 transition count 5202
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 399 Pre rules applied. Total rules applied 3801 place count 5903 transition count 4803
Deduced a syphon composed of 399 places in 28 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 4 with 798 rules applied. Total rules applied 4599 place count 5504 transition count 4803
Discarding 698 places :
Symmetric choice reduction at 4 with 698 rule applications. Total rules 5297 place count 4806 transition count 4105
Iterating global reduction 4 with 698 rules applied. Total rules applied 5995 place count 4806 transition count 4105
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 299 Pre rules applied. Total rules applied 5995 place count 4806 transition count 3806
Deduced a syphon composed of 299 places in 19 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 4 with 598 rules applied. Total rules applied 6593 place count 4507 transition count 3806
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 9 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 4 with 3396 rules applied. Total rules applied 9989 place count 2809 transition count 2108
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10191 place count 2708 transition count 2108
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 29 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10393 place count 2607 transition count 2108
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 6 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 10583 place count 2512 transition count 2108
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10584 place count 2512 transition count 2107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 10585 place count 2511 transition count 2107
Partial Free-agglomeration rule applied 297 times.
Drop transitions removed 297 transitions
Iterating global reduction 5 with 297 rules applied. Total rules applied 10882 place count 2511 transition count 2107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10883 place count 2510 transition count 2106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10884 place count 2509 transition count 2106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10884 place count 2509 transition count 2104
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10888 place count 2507 transition count 2104
Applied a total of 10888 rules in 3566 ms. Remains 2507 /7803 variables (removed 5296) and now considering 2104/7103 (removed 4999) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3568 ms. Remains : 2507/7803 places, 2104/7103 transitions.
// Phase 1: matrix 2104 rows 2507 cols
[2023-03-19 11:04:01] [INFO ] Computed 1100 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 14804 ms. (steps per millisecond=67 ) properties (out of 9) seen :1
FORMULA ShieldPPPt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 437801 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 0
Interrupted Best-First random walk after 449586 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 462246 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 0
Interrupted Best-First random walk after 463281 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 0
Interrupted Best-First random walk after 447088 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 442795 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 440981 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 439566 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 0
[2023-03-19 11:04:56] [INFO ] Invariant cache hit.
[2023-03-19 11:04:57] [INFO ] [Real]Absence check using 1100 positive place invariants in 263 ms returned sat
[2023-03-19 11:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:04:58] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2023-03-19 11:04:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:04:58] [INFO ] [Nat]Absence check using 1100 positive place invariants in 247 ms returned sat
[2023-03-19 11:04:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:05:00] [INFO ] [Nat]Absence check using state equation in 1247 ms returned sat
[2023-03-19 11:05:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 11:05:00] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-19 11:05:00] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 4 ms to minimize.
[2023-03-19 11:05:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 505 ms
[2023-03-19 11:05:00] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 199 ms.
[2023-03-19 11:05:20] [INFO ] Added : 595 causal constraints over 119 iterations in 20167 ms.(timeout) Result :sat
Minimization took 330 ms.
[2023-03-19 11:05:21] [INFO ] [Real]Absence check using 1100 positive place invariants in 267 ms returned sat
[2023-03-19 11:05:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:05:23] [INFO ] [Real]Absence check using state equation in 1452 ms returned sat
[2023-03-19 11:05:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:05:24] [INFO ] [Nat]Absence check using 1100 positive place invariants in 434 ms returned sat
[2023-03-19 11:05:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:05:25] [INFO ] [Nat]Absence check using state equation in 1214 ms returned sat
[2023-03-19 11:05:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-19 11:05:25] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 110 ms.
[2023-03-19 11:05:45] [INFO ] Added : 655 causal constraints over 131 iterations in 20048 ms.(timeout) Result :sat
Minimization took 389 ms.
[2023-03-19 11:05:46] [INFO ] [Real]Absence check using 1100 positive place invariants in 219 ms returned sat
[2023-03-19 11:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:05:47] [INFO ] [Real]Absence check using state equation in 1102 ms returned sat
[2023-03-19 11:05:48] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-19 11:05:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:05:48] [INFO ] [Nat]Absence check using 1100 positive place invariants in 263 ms returned sat
[2023-03-19 11:05:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:05:49] [INFO ] [Nat]Absence check using state equation in 1190 ms returned sat
[2023-03-19 11:05:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-19 11:05:50] [INFO ] Deduced a trap composed of 6 places in 355 ms of which 2 ms to minimize.
[2023-03-19 11:05:50] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 1 ms to minimize.
[2023-03-19 11:05:51] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 11 ms to minimize.
[2023-03-19 11:05:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1362 ms
[2023-03-19 11:05:51] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 188 ms.
[2023-03-19 11:06:11] [INFO ] Added : 615 causal constraints over 123 iterations in 20030 ms.(timeout) Result :sat
Minimization took 332 ms.
[2023-03-19 11:06:12] [INFO ] [Real]Absence check using 1100 positive place invariants in 273 ms returned sat
[2023-03-19 11:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:06:13] [INFO ] [Real]Absence check using state equation in 1318 ms returned sat
[2023-03-19 11:06:13] [INFO ] [Real]Added 3 Read/Feed constraints in 26 ms returned sat
[2023-03-19 11:06:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:06:14] [INFO ] [Nat]Absence check using 1100 positive place invariants in 238 ms returned sat
[2023-03-19 11:06:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:06:15] [INFO ] [Nat]Absence check using state equation in 1246 ms returned sat
[2023-03-19 11:06:15] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-19 11:06:16] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2023-03-19 11:06:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 508 ms
[2023-03-19 11:06:16] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 174 ms.
[2023-03-19 11:06:36] [INFO ] Added : 670 causal constraints over 134 iterations in 20099 ms.(timeout) Result :sat
Minimization took 338 ms.
[2023-03-19 11:06:37] [INFO ] [Real]Absence check using 1100 positive place invariants in 391 ms returned sat
[2023-03-19 11:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:06:38] [INFO ] [Real]Absence check using state equation in 1237 ms returned sat
[2023-03-19 11:06:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:06:39] [INFO ] [Nat]Absence check using 1100 positive place invariants in 301 ms returned sat
[2023-03-19 11:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:06:40] [INFO ] [Nat]Absence check using state equation in 1478 ms returned sat
[2023-03-19 11:06:40] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2023-03-19 11:06:41] [INFO ] Deduced a trap composed of 5 places in 346 ms of which 1 ms to minimize.
[2023-03-19 11:06:41] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 0 ms to minimize.
[2023-03-19 11:06:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 785 ms
[2023-03-19 11:06:41] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 111 ms.
[2023-03-19 11:07:01] [INFO ] Added : 650 causal constraints over 130 iterations in 20032 ms.(timeout) Result :sat
Minimization took 309 ms.
[2023-03-19 11:07:02] [INFO ] [Real]Absence check using 1100 positive place invariants in 261 ms returned sat
[2023-03-19 11:07:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:07:03] [INFO ] [Real]Absence check using state equation in 1127 ms returned sat
[2023-03-19 11:07:03] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-19 11:07:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:07:04] [INFO ] [Nat]Absence check using 1100 positive place invariants in 229 ms returned sat
[2023-03-19 11:07:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:07:05] [INFO ] [Nat]Absence check using state equation in 1144 ms returned sat
[2023-03-19 11:07:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-19 11:07:06] [INFO ] Deduced a trap composed of 6 places in 374 ms of which 1 ms to minimize.
[2023-03-19 11:07:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 580 ms
[2023-03-19 11:07:06] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 138 ms.
[2023-03-19 11:07:26] [INFO ] Added : 645 causal constraints over 129 iterations in 20048 ms.(timeout) Result :sat
Minimization took 348 ms.
[2023-03-19 11:07:27] [INFO ] [Real]Absence check using 1100 positive place invariants in 230 ms returned sat
[2023-03-19 11:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:07:28] [INFO ] [Real]Absence check using state equation in 1611 ms returned sat
[2023-03-19 11:07:29] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-19 11:07:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:07:29] [INFO ] [Nat]Absence check using 1100 positive place invariants in 199 ms returned sat
[2023-03-19 11:07:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:07:30] [INFO ] [Nat]Absence check using state equation in 1005 ms returned sat
[2023-03-19 11:07:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-19 11:07:30] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2023-03-19 11:07:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2023-03-19 11:07:31] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 109 ms.
[2023-03-19 11:07:51] [INFO ] Added : 720 causal constraints over 144 iterations in 20134 ms.(timeout) Result :sat
Minimization took 349 ms.
[2023-03-19 11:07:52] [INFO ] [Real]Absence check using 1100 positive place invariants in 300 ms returned sat
[2023-03-19 11:07:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 11:07:53] [INFO ] [Real]Absence check using state equation in 1075 ms returned sat
[2023-03-19 11:07:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 11:07:53] [INFO ] [Nat]Absence check using 1100 positive place invariants in 221 ms returned sat
[2023-03-19 11:07:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 11:07:54] [INFO ] [Nat]Absence check using state equation in 987 ms returned sat
[2023-03-19 11:07:54] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-19 11:07:55] [INFO ] Deduced a trap composed of 6 places in 482 ms of which 1 ms to minimize.
[2023-03-19 11:07:55] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 1 ms to minimize.
[2023-03-19 11:07:55] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2023-03-19 11:07:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1215 ms
[2023-03-19 11:07:56] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 104 ms.
[2023-03-19 11:08:16] [INFO ] Added : 720 causal constraints over 144 iterations in 20185 ms.(timeout) Result :sat
Minimization took 355 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ShieldPPPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 309615 ms.

BK_STOP 1679224101187

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="ShieldPPPt-PT-100B"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-100B, 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 r389-oct2-167903713900701"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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