fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853100391
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for NoC3x3-PT-4B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.920 3600000.00 83881.00 83.00 FTTTFTFFFFTTFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853100391.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is NoC3x3-PT-4B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853100391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 3.1K Apr 8 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 8 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 18:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 6 03:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 6 03:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 608K 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 NoC3x3-PT-4B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-4B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591144295031

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:31:37] [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-03 00:31:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:31:37] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2020-06-03 00:31:37] [INFO ] Transformed 2328 places.
[2020-06-03 00:31:37] [INFO ] Transformed 2701 transitions.
[2020-06-03 00:31:37] [INFO ] Found NUPN structural information;
[2020-06-03 00:31:37] [INFO ] Parsed PT model containing 2328 places and 2701 transitions in 280 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 88 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 76 ms. (steps per millisecond=131 ) properties seen :[1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0]
FORMULA NoC3x3-PT-4B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-4B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-4B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2701 rows 2328 cols
[2020-06-03 00:31:38] [INFO ] Computed 66 place invariants in 101 ms
[2020-06-03 00:31:39] [INFO ] [Real]Absence check using 66 positive place invariants in 279 ms returned sat
[2020-06-03 00:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:31:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s866 (- t1440 t1441))") while checking expression at index 0
[2020-06-03 00:31:43] [INFO ] [Real]Absence check using 66 positive place invariants in 192 ms returned sat
[2020-06-03 00:31:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:31:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:31:48] [INFO ] [Real]Absence check using state equation in 4221 ms returned (error "Failed to check-sat")
[2020-06-03 00:31:48] [INFO ] [Real]Absence check using 66 positive place invariants in 180 ms returned sat
[2020-06-03 00:31:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:31:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:31:53] [INFO ] [Real]Absence check using state equation in 4498 ms returned (error "Failed to check-sat")
[2020-06-03 00:31:54] [INFO ] [Real]Absence check using 66 positive place invariants in 229 ms returned sat
[2020-06-03 00:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:31:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:31:58] [INFO ] [Real]Absence check using state equation in 3995 ms returned (error "Failed to check-sat")
[2020-06-03 00:31:58] [INFO ] [Real]Absence check using 66 positive place invariants in 126 ms returned unsat
[2020-06-03 00:31:59] [INFO ] [Real]Absence check using 66 positive place invariants in 242 ms returned sat
[2020-06-03 00:31:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:32:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:32:03] [INFO ] [Real]Absence check using state equation in 4457 ms returned (error "Failed to check-sat")
[2020-06-03 00:32:04] [INFO ] [Real]Absence check using 66 positive place invariants in 203 ms returned sat
[2020-06-03 00:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:32:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:32:08] [INFO ] [Real]Absence check using state equation in 4496 ms returned (error "Failed to check-sat")
[2020-06-03 00:32:09] [INFO ] [Real]Absence check using 66 positive place invariants in 186 ms returned sat
[2020-06-03 00:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:32:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 00:32:13] [INFO ] [Real]Absence check using state equation in 4548 ms returned (error "Failed to check-sat")
[2020-06-03 00:32:14] [INFO ] [Real]Absence check using 66 positive place invariants in 224 ms returned sat
[2020-06-03 00:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:32:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (= s1138 (- t2306 t1202))") while checking expression at index 8
FORMULA NoC3x3-PT-4B-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 32 out of 2328 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Graph (trivial) has 2240 edges and 2328 vertex of which 1172 / 2328 are part of one of the 31 SCC in 28 ms
Free SCC test removed 1141 places
Drop transitions removed 1373 transitions
Reduce isomorphic transitions removed 1373 transitions.
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Iterating post reduction 0 with 1559 rules applied. Total rules applied 1560 place count 1187 transition count 1142
Reduce places removed 186 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 216 rules applied. Total rules applied 1776 place count 1001 transition count 1112
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1783 place count 994 transition count 1112
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1783 place count 994 transition count 1110
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1787 place count 992 transition count 1110
Symmetric choice reduction at 3 with 319 rule applications. Total rules 2106 place count 992 transition count 1110
Deduced a syphon composed of 319 places in 7 ms
Reduce places removed 319 places and 319 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 2744 place count 673 transition count 791
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2746 place count 673 transition count 789
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 2746 place count 673 transition count 730
Deduced a syphon composed of 59 places in 7 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 2864 place count 614 transition count 730
Symmetric choice reduction at 4 with 30 rule applications. Total rules 2894 place count 614 transition count 730
Deduced a syphon composed of 30 places in 4 ms
Reduce places removed 30 places and 30 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 2954 place count 584 transition count 700
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 3212 place count 455 transition count 571
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 3215 place count 455 transition count 568
Performed 9 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 3233 place count 446 transition count 630
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3235 place count 446 transition count 628
Free-agglomeration rule applied 176 times.
Iterating global reduction 6 with 176 rules applied. Total rules applied 3411 place count 446 transition count 452
Reduce places removed 176 places and 0 transitions.
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Discarding 33 places :
Also discarding 0 output transitions
Graph (complete) has 783 edges and 270 vertex of which 237 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.11 ms
Iterating post reduction 6 with 218 rules applied. Total rules applied 3629 place count 237 transition count 411
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 7 with 44 rules applied. Total rules applied 3673 place count 237 transition count 367
Symmetric choice reduction at 8 with 8 rule applications. Total rules 3681 place count 237 transition count 367
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 3697 place count 229 transition count 359
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 3703 place count 229 transition count 359
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 3705 place count 229 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3706 place count 229 transition count 358
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 3714 place count 229 transition count 350
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3716 place count 227 transition count 350
Applied a total of 3716 rules in 743 ms. Remains 227 /2328 variables (removed 2101) and now considering 350/2701 (removed 2351) transitions.
Finished structural reductions, in 1 iterations. Remains : 227/2328 places, 350/2701 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2411 ms. (steps per millisecond=414 ) properties seen :[0, 0, 1, 0, 1, 0, 0, 0]
FORMULA NoC3x3-PT-4B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1069 ms. (steps per millisecond=935 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 959 ms. (steps per millisecond=1042 ) properties seen :[0, 1, 0, 1, 0, 0]
FORMULA NoC3x3-PT-4B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1266 ms. (steps per millisecond=789 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 926 ms. (steps per millisecond=1079 ) properties seen :[0, 0, 1, 0]
FORMULA NoC3x3-PT-4B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 857 ms. (steps per millisecond=1166 ) properties seen :[0, 0, 0]
[2020-06-03 00:32:27] [INFO ] Flow matrix only has 334 transitions (discarded 16 similar events)
// Phase 1: matrix 334 rows 227 cols
[2020-06-03 00:32:27] [INFO ] Computed 57 place invariants in 2 ms
[2020-06-03 00:32:27] [INFO ] [Real]Absence check using 57 positive place invariants in 36 ms returned sat
[2020-06-03 00:32:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:32:27] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2020-06-03 00:32:27] [INFO ] State equation strengthened by 137 read => feed constraints.
[2020-06-03 00:32:27] [INFO ] [Real]Added 137 Read/Feed constraints in 40 ms returned sat
[2020-06-03 00:32:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:32:27] [INFO ] [Nat]Absence check using 57 positive place invariants in 97 ms returned sat
[2020-06-03 00:32:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:32:28] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2020-06-03 00:32:28] [INFO ] [Nat]Added 137 Read/Feed constraints in 34 ms returned sat
[2020-06-03 00:32:28] [INFO ] Computed and/alt/rep : 342/2640/326 causal constraints in 65 ms.
[2020-06-03 00:32:30] [INFO ] Added : 310 causal constraints over 62 iterations in 2808 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 49 ms.
[2020-06-03 00:32:31] [INFO ] [Real]Absence check using 57 positive place invariants in 81 ms returned sat
[2020-06-03 00:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:32:31] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2020-06-03 00:32:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:32:31] [INFO ] [Nat]Absence check using 57 positive place invariants in 75 ms returned sat
[2020-06-03 00:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:32:32] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2020-06-03 00:32:32] [INFO ] [Nat]Added 137 Read/Feed constraints in 14 ms returned sat
[2020-06-03 00:32:32] [INFO ] Computed and/alt/rep : 342/2640/326 causal constraints in 19 ms.
[2020-06-03 00:32:34] [INFO ] Added : 299 causal constraints over 60 iterations in 2066 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-06-03 00:32:34] [INFO ] [Real]Absence check using 57 positive place invariants in 37 ms returned sat
[2020-06-03 00:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:32:34] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-06-03 00:32:34] [INFO ] [Real]Added 137 Read/Feed constraints in 25 ms returned sat
[2020-06-03 00:32:34] [INFO ] Computed and/alt/rep : 342/2640/326 causal constraints in 54 ms.
[2020-06-03 00:32:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:32:34] [INFO ] [Nat]Absence check using 57 positive place invariants in 82 ms returned sat
[2020-06-03 00:32:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:32:35] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2020-06-03 00:32:35] [INFO ] [Nat]Added 137 Read/Feed constraints in 17 ms returned sat
[2020-06-03 00:32:35] [INFO ] Computed and/alt/rep : 342/2640/326 causal constraints in 77 ms.
[2020-06-03 00:32:37] [INFO ] Added : 306 causal constraints over 62 iterations in 2223 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
Incomplete Parikh walk after 45500 steps, including 345 resets, run finished after 201 ms. (steps per millisecond=226 ) properties seen :[1, 0, 1] could not realise parikh vector
FORMULA NoC3x3-PT-4B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-4B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 746 steps, including 6 resets, run visited all 1 properties in 3 ms. (steps per millisecond=248 )
FORMULA NoC3x3-PT-4B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_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="NoC3x3-PT-4B"
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 NoC3x3-PT-4B, 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 r174-csrt-158987853100391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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