Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815800383.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is FlexibleBarrier-PT-18b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815800383
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 3.8K Apr 4 19:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 19:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 4 08:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 08:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 3 21:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 3 21:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 3 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 3 13:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591401741090

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 00:02:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-06 00:02:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 00:02:24] [INFO ] Load time of PNML (sax parser for PT used): 444 ms
[2020-06-06 00:02:24] [INFO ] Transformed 4370 places.
[2020-06-06 00:02:24] [INFO ] Transformed 5037 transitions.
[2020-06-06 00:02:24] [INFO ] Found NUPN structural information;
[2020-06-06 00:02:24] [INFO ] Parsed PT model containing 4370 places and 5037 transitions in 566 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 129 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 83 resets, run finished after 211 ms. (steps per millisecond=47 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 5037 rows 4370 cols
[2020-06-06 00:02:25] [INFO ] Computed 20 place invariants in 322 ms
[2020-06-06 00:02:27] [INFO ] [Real]Absence check using 20 positive place invariants in 353 ms returned unsat
[2020-06-06 00:02:28] [INFO ] [Real]Absence check using 20 positive place invariants in 514 ms returned sat
[2020-06-06 00:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:02:32] [INFO ] [Real]Absence check using state equation in 3441 ms returned (error "Solver has unexpectedly terminated")
[2020-06-06 00:02:33] [INFO ] [Real]Absence check using 20 positive place invariants in 428 ms returned sat
[2020-06-06 00:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:02:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 00:02:37] [INFO ] [Real]Absence check using state equation in 3615 ms returned (error "Failed to check-sat")
[2020-06-06 00:02:39] [INFO ] [Real]Absence check using 20 positive place invariants in 513 ms returned sat
[2020-06-06 00:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:02:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 00:02:42] [INFO ] [Real]Absence check using state equation in 3214 ms returned (error "Failed to check-sat")
[2020-06-06 00:02:44] [INFO ] [Real]Absence check using 20 positive place invariants in 523 ms returned sat
[2020-06-06 00:02:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:02:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 00:02:47] [INFO ] [Real]Absence check using state equation in 3352 ms returned (error "Failed to check-sat")
[2020-06-06 00:02:49] [INFO ] [Real]Absence check using 20 positive place invariants in 521 ms returned sat
[2020-06-06 00:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:02:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 00:02:52] [INFO ] [Real]Absence check using state equation in 3334 ms returned (error "Failed to check-sat")
[2020-06-06 00:02:54] [INFO ] [Real]Absence check using 20 positive place invariants in 518 ms returned sat
[2020-06-06 00:02:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:02:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 00:02:57] [INFO ] [Real]Absence check using state equation in 3225 ms returned (error "Failed to check-sat")
[2020-06-06 00:02:58] [INFO ] [Real]Absence check using 20 positive place invariants in 460 ms returned unsat
[2020-06-06 00:03:00] [INFO ] [Real]Absence check using 20 positive place invariants in 501 ms returned sat
[2020-06-06 00:03:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:03:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 00:03:03] [INFO ] [Real]Absence check using state equation in 3275 ms returned (error "Failed to check-sat")
[2020-06-06 00:03:05] [INFO ] [Real]Absence check using 20 positive place invariants in 519 ms returned sat
[2020-06-06 00:03:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:03:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 00:03:08] [INFO ] [Real]Absence check using state equation in 3237 ms returned (error "Failed to check-sat")
[2020-06-06 00:03:10] [INFO ] [Real]Absence check using 20 positive place invariants in 511 ms returned sat
[2020-06-06 00:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:03:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 00:03:13] [INFO ] [Real]Absence check using state equation in 3311 ms returned (error "Failed to check-sat")
[2020-06-06 00:03:15] [INFO ] [Real]Absence check using 20 positive place invariants in 502 ms returned sat
[2020-06-06 00:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:03:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 00:03:18] [INFO ] [Real]Absence check using state equation in 3388 ms returned (error "Failed to check-sat")
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 55 out of 4370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 3461 edges and 4370 vertex of which 84 / 4370 are part of one of the 14 SCC in 44 ms
Free SCC test removed 70 places
Drop transitions removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Performed 735 Post agglomeration using F-continuation condition.Transition count delta: 735
Iterating post reduction 0 with 819 rules applied. Total rules applied 820 place count 4300 transition count 4218
Reduce places removed 735 places and 0 transitions.
Iterating post reduction 1 with 735 rules applied. Total rules applied 1555 place count 3565 transition count 4218
Performed 615 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 615 Pre rules applied. Total rules applied 1555 place count 3565 transition count 3603
Deduced a syphon composed of 615 places in 10 ms
Reduce places removed 615 places and 0 transitions.
Iterating global reduction 2 with 1230 rules applied. Total rules applied 2785 place count 2950 transition count 3603
Symmetric choice reduction at 2 with 1756 rule applications. Total rules 4541 place count 2950 transition count 3603
Deduced a syphon composed of 1756 places in 14 ms
Reduce places removed 1756 places and 1756 transitions.
Iterating global reduction 2 with 3512 rules applied. Total rules applied 8053 place count 1194 transition count 1847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 8055 place count 1194 transition count 1845
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8056 place count 1193 transition count 1845
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 8056 place count 1193 transition count 1833
Deduced a syphon composed of 12 places in 7 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 8080 place count 1181 transition count 1833
Symmetric choice reduction at 4 with 275 rule applications. Total rules 8355 place count 1181 transition count 1833
Deduced a syphon composed of 275 places in 9 ms
Reduce places removed 275 places and 275 transitions.
Iterating global reduction 4 with 550 rules applied. Total rules applied 8905 place count 906 transition count 1558
Ensure Unique test removed 267 transitions
Reduce isomorphic transitions removed 267 transitions.
Iterating post reduction 4 with 267 rules applied. Total rules applied 9172 place count 906 transition count 1291
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 5 with 208 rules applied. Total rules applied 9380 place count 802 transition count 1187
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 9388 place count 798 transition count 1187
Free-agglomeration rule applied 259 times.
Iterating global reduction 5 with 259 rules applied. Total rules applied 9647 place count 798 transition count 928
Reduce places removed 259 places and 0 transitions.
Iterating post reduction 5 with 259 rules applied. Total rules applied 9906 place count 539 transition count 928
Symmetric choice reduction at 6 with 24 rule applications. Total rules 9930 place count 539 transition count 928
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 24 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 9978 place count 515 transition count 904
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 10002 place count 515 transition count 880
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 10004 place count 515 transition count 880
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 10005 place count 515 transition count 880
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 10016 place count 515 transition count 869
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 10017 place count 514 transition count 868
Applied a total of 10017 rules in 1935 ms. Remains 514 /4370 variables (removed 3856) and now considering 868/5037 (removed 4169) transitions.
Finished structural reductions, in 1 iterations. Remains : 514/4370 places, 868/5037 transitions.
Incomplete random walk after 1000000 steps, including 13924 resets, run finished after 5815 ms. (steps per millisecond=171 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 0, 1, 1]
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1044 ms. (steps per millisecond=957 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1178 resets, run finished after 1150 ms. (steps per millisecond=869 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1117 resets, run finished after 1196 ms. (steps per millisecond=836 ) properties seen :[0, 0, 0]
[2020-06-06 00:03:30] [INFO ] Flow matrix only has 841 transitions (discarded 27 similar events)
// Phase 1: matrix 841 rows 514 cols
[2020-06-06 00:03:30] [INFO ] Computed 20 place invariants in 12 ms
[2020-06-06 00:03:30] [INFO ] [Real]Absence check using 20 positive place invariants in 32 ms returned sat
[2020-06-06 00:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:03:31] [INFO ] [Real]Absence check using state equation in 962 ms returned sat
[2020-06-06 00:03:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-06 00:03:31] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-06-06 00:03:31] [INFO ] Computed and/alt/rep : 850/2665/823 causal constraints in 120 ms.
[2020-06-06 00:03:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 00:03:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 40 ms returned sat
[2020-06-06 00:03:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 00:03:32] [INFO ] [Nat]Absence check using state equation in 1003 ms returned sat
[2020-06-06 00:03:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-06-06 00:03:33] [INFO ] Computed and/alt/rep : 850/2665/823 causal constraints in 112 ms.
[2020-06-06 00:03:37] [INFO ] Added : 318 causal constraints over 64 iterations in 4002 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2020-06-06 00:03:37] [INFO ] [Real]Absence check using 20 positive place invariants in 32 ms returned sat
[2020-06-06 00:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:03:38] [INFO ] [Real]Absence check using state equation in 1519 ms returned sat
[2020-06-06 00:03:38] [INFO ] [Real]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-06 00:03:39] [INFO ] Deduced a trap composed of 42 places in 206 ms
[2020-06-06 00:03:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2020-06-06 00:03:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 00:03:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 99 ms returned sat
[2020-06-06 00:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 00:03:41] [INFO ] [Nat]Absence check using state equation in 1454 ms returned sat
[2020-06-06 00:03:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-06 00:03:41] [INFO ] Computed and/alt/rep : 850/2665/823 causal constraints in 90 ms.
[2020-06-06 00:03:45] [INFO ] Added : 317 causal constraints over 64 iterations in 4746 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-06 00:03:46] [INFO ] [Real]Absence check using 20 positive place invariants in 54 ms returned sat
[2020-06-06 00:03:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 00:03:47] [INFO ] [Real]Absence check using state equation in 1060 ms returned sat
[2020-06-06 00:03:47] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-06 00:03:47] [INFO ] Deduced a trap composed of 42 places in 567 ms
[2020-06-06 00:03:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 656 ms
[2020-06-06 00:03:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 00:03:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 104 ms returned sat
[2020-06-06 00:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 00:03:49] [INFO ] [Nat]Absence check using state equation in 1476 ms returned sat
[2020-06-06 00:03:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-06-06 00:03:49] [INFO ] Computed and/alt/rep : 850/2665/823 causal constraints in 60 ms.
[2020-06-06 00:03:54] [INFO ] Added : 310 causal constraints over 64 iterations in 5058 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
Incomplete Parikh walk after 79200 steps, including 714 resets, run finished after 830 ms. (steps per millisecond=95 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 79900 steps, including 733 resets, run finished after 441 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 78400 steps, including 810 resets, run finished after 437 ms. (steps per millisecond=179 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 31 out of 514 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 514/514 places, 868/868 transitions.
Graph (trivial) has 328 edges and 514 vertex of which 4 / 514 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 512 transition count 859
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 15 place count 507 transition count 859
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 507 transition count 858
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 506 transition count 858
Symmetric choice reduction at 2 with 8 rule applications. Total rules 25 place count 506 transition count 858
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 41 place count 498 transition count 850
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 491 transition count 843
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 491 transition count 843
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 488 transition count 840
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 488 transition count 837
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 487 transition count 836
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 85 place count 487 transition count 820
Free-agglomeration rule applied 298 times with reduction of 2 identical transitions.
Iterating global reduction 4 with 298 rules applied. Total rules applied 383 place count 487 transition count 520
Reduce places removed 298 places and 0 transitions.
Drop transitions removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Iterating post reduction 4 with 445 rules applied. Total rules applied 828 place count 189 transition count 373
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 834 place count 189 transition count 367
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 836 place count 189 transition count 365
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 838 place count 187 transition count 365
Applied a total of 838 rules in 204 ms. Remains 187 /514 variables (removed 327) and now considering 365/868 (removed 503) transitions.
Finished structural reductions, in 1 iterations. Remains : 187/514 places, 365/868 transitions.
Finished random walk after 19700 steps, including 133 resets, run visited all 3 properties in 109 ms. (steps per millisecond=180 )
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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="FlexibleBarrier-PT-18b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is FlexibleBarrier-PT-18b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-158987815800383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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