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.r179-tall-171640601000181.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 greatspnxred
Input is FunctionPointer-PT-a008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601000181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 11 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 34K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716431017202

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:23:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 02:23:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:23:38] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2024-05-23 02:23:38] [INFO ] Transformed 40 places.
[2024-05-23 02:23:38] [INFO ] Transformed 70 transitions.
[2024-05-23 02:23:38] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a008-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 8, 0] Max Struct:[+inf, +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, 1, 8, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:23:38] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2024-05-23 02:23:38] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 8, 0] Max Struct:[8, 8, +inf, 1, +inf, +inf, 1, 1, +inf, +inf, 1, 8, +inf]
FORMULA FunctionPointer-PT-a008-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a008-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10011 steps (36 resets) in 30 ms. (322 steps per ms)
FORMULA FunctionPointer-PT-a008-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-01 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (23 resets) in 54 ms. (1091 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13, 61, 59, 13, 5, 62] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:23:38] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-23 02:23:38] [INFO ] Invariant cache hit.
[2024-05-23 02:23:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:23:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:23:38] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:23:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:23:38] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:23:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:23:38] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 02:23:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:38] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 7 ms to minimize.
[2024-05-23 02:23:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-23 02:23:38] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 5 ms.
[2024-05-23 02:23:39] [INFO ] Added : 20 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 13 ms.
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:23:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-23 02:23:39] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2024-05-23 02:23:39] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 8 ms.
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:23:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-23 02:23:39] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 02:23:39] [INFO ] Added : 13 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 9 ms.
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:23:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-23 02:23:39] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 02:23:39] [INFO ] Added : 19 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 13 ms.
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:23:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-23 02:23:39] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 5 ms.
[2024-05-23 02:23:39] [INFO ] Added : 13 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:23:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:39] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-23 02:23:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-23 02:23:39] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 02:23:39] [INFO ] Added : 18 causal constraints over 6 iterations in 40 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13, 61, 59, 13, 5, 62] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13, 61, 59, 14, 8, 62] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 31 transition count 63
Applied a total of 4 rules in 22 ms. Remains 31 /34 variables (removed 3) and now considering 63/66 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 31/34 places, 63/66 transitions.
[2024-05-23 02:23:40] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 22=1, 33=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 22=1, 33=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :[6, 2147483647, 2147483647, 6, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[13, +inf, +inf, 14, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:23:40] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
// Phase 1: matrix 44 rows 31 cols
[2024-05-23 02:23:40] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[13, +inf, +inf, 14, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 836 ms. (1194 steps per ms)
FORMULA FunctionPointer-PT-a008-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 2000001 steps (4 resets) in 744 ms. (2684 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13, 14] Max Struct:[+inf, +inf]
[2024-05-23 02:23:41] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-23 02:23:41] [INFO ] Invariant cache hit.
[2024-05-23 02:23:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:23:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:23:41] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:23:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:41] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-23 02:23:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-23 02:23:41] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 4 ms.
[2024-05-23 02:23:42] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-23 02:23:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-23 02:23:42] [INFO ] Added : 20 causal constraints over 4 iterations in 72 ms. Result :sat
Minimization took 10 ms.
[2024-05-23 02:23:42] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 02:23:42] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:23:42] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:42] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:23:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:42] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-23 02:23:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-23 02:23:42] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 4 ms.
[2024-05-23 02:23:42] [INFO ] Added : 19 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13, 14] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13, 14] Max Struct:[+inf, +inf]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 63/63 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 59
Applied a total of 4 rules in 7 ms. Remains 30 /31 variables (removed 1) and now considering 59/63 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 30/31 places, 59/63 transitions.
[2024-05-23 02:23:42] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :[7, 8]
Current structural bounds on expressions (after cover walk) : Max Seen:[13, 14] Max Struct:[+inf, +inf]
[2024-05-23 02:23:42] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
// Phase 1: matrix 42 rows 30 cols
[2024-05-23 02:23:42] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[13, 14] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 624 ms. (1600 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 653 ms. (3058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13, 14] Max Struct:[+inf, +inf]
[2024-05-23 02:23:43] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:43] [INFO ] Invariant cache hit.
[2024-05-23 02:23:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:23:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:23:43] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:23:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:23:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:23:43] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-23 02:23:43] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-23 02:23:43] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-23 02:23:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 101 ms
[2024-05-23 02:23:43] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 3 ms.
[2024-05-23 02:23:43] [INFO ] Added : 22 causal constraints over 6 iterations in 27 ms. Result :sat
Minimization took 12 ms.
[2024-05-23 02:23:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:23:43] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:23:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:43] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-23 02:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2024-05-23 02:23:43] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 3 ms.
[2024-05-23 02:23:43] [INFO ] Added : 20 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13, 14] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13, 14] Max Struct:[+inf, +inf]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-23 02:23:43] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:43] [INFO ] Invariant cache hit.
[2024-05-23 02:23:44] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-23 02:23:44] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:44] [INFO ] Invariant cache hit.
[2024-05-23 02:23:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:23:44] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-23 02:23:44] [INFO ] Redundant transitions in 0 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-23 02:23:44] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:44] [INFO ] Invariant cache hit.
[2024-05-23 02:23:44] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1063ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1068ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1163 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-23 02:23:45] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :[7, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[13, 14] Max Struct:[+inf, +inf]
RANDOM walk for 40005 steps (8 resets) in 371 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 578958 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 2
Probabilistic random walk after 578958 steps, saw 383536 distinct states, run finished after 3007 ms. (steps per millisecond=192 ) properties seen :0
[2024-05-23 02:23:48] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:48] [INFO ] Invariant cache hit.
[2024-05-23 02:23:48] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 27/66 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/72 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 2 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 27/66 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/72 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/72 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 43 constraints, problems are : Problem set: 0 solved, 2 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 8031 steps, including 88 resets, run visited all 1 properties in 17 ms. (steps per millisecond=472 )
Parikh walk visited 2 properties in 62 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[13, 14] Max Struct:[+inf, +inf]
Starting property specific reduction for FunctionPointer-PT-a008-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:23:48] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[+inf]
[2024-05-23 02:23:48] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:48] [INFO ] Invariant cache hit.
[2024-05-23 02:23:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:23:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:23:48] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:23:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:23:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:48] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:23:48] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-23 02:23:48] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-23 02:23:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 75 ms
[2024-05-23 02:23:48] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 4 ms.
[2024-05-23 02:23:48] [INFO ] Added : 22 causal constraints over 6 iterations in 26 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-23 02:23:48] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[12] Max Struct:[+inf]
[2024-05-23 02:23:48] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[12] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 669 ms. (1492 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 328 ms. (3039 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[+inf]
[2024-05-23 02:23:49] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:49] [INFO ] Invariant cache hit.
[2024-05-23 02:23:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:23:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:23:49] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:23:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 02:23:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:49] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-23 02:23:49] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-23 02:23:50] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-23 02:23:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 93 ms
[2024-05-23 02:23:50] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 4 ms.
[2024-05-23 02:23:50] [INFO ] Added : 22 causal constraints over 6 iterations in 27 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-23 02:23:50] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:50] [INFO ] Invariant cache hit.
[2024-05-23 02:23:50] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 02:23:50] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:50] [INFO ] Invariant cache hit.
[2024-05-23 02:23:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:23:50] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-23 02:23:50] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-23 02:23:50] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:50] [INFO ] Invariant cache hit.
[2024-05-23 02:23:50] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 955ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 956ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1047 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-23 02:23:51] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[9]
Current structural bounds on expressions (after cover walk) : Max Seen:[12] Max Struct:[+inf]
RANDOM walk for 33820 steps (8 resets) in 42 ms. (786 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[12] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-a008-UpperBounds-02 in 2607 ms.
Starting property specific reduction for FunctionPointer-PT-a008-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:23:51] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[+inf]
[2024-05-23 02:23:51] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:51] [INFO ] Invariant cache hit.
[2024-05-23 02:23:51] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:23:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:23:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:23:51] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:51] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 02:23:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:51] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-23 02:23:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-23 02:23:51] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 4 ms.
[2024-05-23 02:23:51] [INFO ] Added : 20 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-23 02:23:51] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[8]
Current structural bounds on expressions (after cover walk) : Max Seen:[11] Max Struct:[+inf]
[2024-05-23 02:23:51] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 621 ms. (1607 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 331 ms. (3012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[+inf]
[2024-05-23 02:23:52] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:52] [INFO ] Invariant cache hit.
[2024-05-23 02:23:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:23:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:23:52] [INFO ] [Real]Added 8 Read/Feed constraints in 16 ms returned sat
[2024-05-23 02:23:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:23:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:23:52] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:23:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:23:52] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-23 02:23:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-23 02:23:52] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 4 ms.
[2024-05-23 02:23:52] [INFO ] Added : 20 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-23 02:23:52] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:52] [INFO ] Invariant cache hit.
[2024-05-23 02:23:52] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-23 02:23:52] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:52] [INFO ] Invariant cache hit.
[2024-05-23 02:23:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:23:52] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-23 02:23:52] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-23 02:23:52] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-23 02:23:52] [INFO ] Invariant cache hit.
[2024-05-23 02:23:52] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1096ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1099ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1244 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-23 02:23:53] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :[8]
Current structural bounds on expressions (after cover walk) : Max Seen:[11] Max Struct:[+inf]
RANDOM walk for 40007 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 14470 steps (3 resets) in 15 ms. (904 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[11] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-a008-UpperBounds-10 in 2797 ms.
[2024-05-23 02:23:54] [INFO ] Flatten gal took : 25 ms
[2024-05-23 02:23:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-23 02:23:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 59 transitions and 238 arcs took 3 ms.
Total runtime 15845 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-a008

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 30
TRANSITIONS: 59
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 776
MODEL NAME: /home/mcc/execution/411/model
30 places, 59 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 9 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716431034777

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="FunctionPointer-PT-a008"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FunctionPointer-PT-a008, 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 r179-tall-171640601000181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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