About the Execution of ITS-Tools for JoinFreeModules-PT-0200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12587.768 | 261171.00 | 293095.00 | 629.90 | FTFTFTTFFTFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r121-tall-162075407000446.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 itstools
Input is JoinFreeModules-PT-0200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407000446
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 111K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 26 06:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 06:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 24 10:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 24 10:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.2M May 5 16:51 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 JoinFreeModules-PT-0200-ReachabilityCardinality-00
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-01
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-02
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-03
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-04
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-05
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-06
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-07
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-08
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-09
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1620845948122
Running Version 0
[2021-05-12 18:59:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 18:59:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 18:59:09] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2021-05-12 18:59:09] [INFO ] Transformed 1001 places.
[2021-05-12 18:59:09] [INFO ] Transformed 1601 transitions.
[2021-05-12 18:59:09] [INFO ] Parsed PT model containing 1001 places and 1601 transitions in 191 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 1 places and 0 transitions.
Incomplete random walk after 10072 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=65 ) properties (out of 16) seen :1
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Probabilistic random walk after 1000001 steps, saw 994760 distinct states, run finished after 18891 ms. (steps per millisecond=52 ) properties seen :{}
Running SMT prover for 15 properties.
// Phase 1: matrix 1601 rows 1000 cols
[2021-05-12 18:59:29] [INFO ] Computed 200 place invariants in 28 ms
[2021-05-12 18:59:29] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2021-05-12 18:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:59:29] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2021-05-12 18:59:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:59:30] [INFO ] [Nat]Absence check using 200 positive place invariants in 44 ms returned sat
[2021-05-12 18:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:59:31] [INFO ] [Nat]Absence check using state equation in 1580 ms returned sat
[2021-05-12 18:59:31] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 6 ms to minimize.
[2021-05-12 18:59:31] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2021-05-12 18:59:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2021-05-12 18:59:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2021-05-12 18:59:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
[2021-05-12 18:59:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2021-05-12 18:59:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2021-05-12 18:59:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2021-05-12 18:59:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2021-05-12 18:59:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 18:59:32] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2021-05-12 18:59:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 990 ms
[2021-05-12 18:59:32] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 116 ms.
[2021-05-12 18:59:35] [INFO ] Deduced a trap composed of 3 places in 415 ms of which 1 ms to minimize.
[2021-05-12 18:59:35] [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 close... while checking expression at index 0
[2021-05-12 18:59:35] [INFO ] [Real]Absence check using 200 positive place invariants in 41 ms returned sat
[2021-05-12 18:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:59:36] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2021-05-12 18:59:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:59:36] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2021-05-12 18:59:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:59:39] [INFO ] [Nat]Absence check using state equation in 3155 ms returned sat
[2021-05-12 18:59:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2021-05-12 18:59:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 18:59:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2021-05-12 18:59:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2021-05-12 18:59:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2021-05-12 18:59:39] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2021-05-12 18:59:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 18:59:40] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:59:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2021-05-12 18:59:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 2 ms to minimize.
[2021-05-12 18:59:40] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:59:40] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:59:40] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:59:40] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 18:59:40] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:59:40] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:59:40] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1305 ms
[2021-05-12 18:59:40] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 96 ms.
[2021-05-12 18:59:41] [INFO ] Deduced a trap composed of 3 places in 445 ms of which 1 ms to minimize.
[2021-05-12 18:59:41] [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 close... while checking expression at index 1
[2021-05-12 18:59:41] [INFO ] [Real]Absence check using 200 positive place invariants in 41 ms returned sat
[2021-05-12 18:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:59:42] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2021-05-12 18:59:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:59:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2021-05-12 18:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:59:44] [INFO ] [Nat]Absence check using state equation in 1747 ms returned sat
[2021-05-12 18:59:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2021-05-12 18:59:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 18:59:44] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:59:44] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:59:44] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2021-05-12 18:59:44] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
[2021-05-12 18:59:44] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 18:59:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 18:59:44] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 18:59:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 765 ms
[2021-05-12 18:59:44] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 95 ms.
[2021-05-12 18:59:47] [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 close... while checking expression at index 2
[2021-05-12 18:59:47] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2021-05-12 18:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:59:47] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2021-05-12 18:59:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:59:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2021-05-12 18:59:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:59:49] [INFO ] [Nat]Absence check using state equation in 1485 ms returned sat
[2021-05-12 18:59:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2021-05-12 18:59:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2021-05-12 18:59:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 18:59:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 18:59:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2021-05-12 18:59:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2021-05-12 18:59:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 18:59:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2021-05-12 18:59:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 18:59:50] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:59:50] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:59:50] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 18:59:50] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:59:50] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:59:50] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:59:50] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 18:59:50] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 18:59:50] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1273 ms
[2021-05-12 18:59:50] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 87 ms.
[2021-05-12 18:59:52] [INFO ] Added : 40 causal constraints over 8 iterations in 2117 ms. Result :unknown
[2021-05-12 18:59:52] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2021-05-12 18:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:59:53] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2021-05-12 18:59:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:59:53] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2021-05-12 18:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:59:55] [INFO ] [Nat]Absence check using state equation in 1786 ms returned sat
[2021-05-12 18:59:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2021-05-12 18:59:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 7 ms to minimize.
[2021-05-12 18:59:55] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-12 18:59:55] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 18:59:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2021-05-12 18:59:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2021-05-12 18:59:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2021-05-12 18:59:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2021-05-12 18:59:55] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 634 ms
[2021-05-12 18:59:56] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 100 ms.
[2021-05-12 18:59:58] [INFO ] Deduced a trap composed of 3 places in 447 ms of which 1 ms to minimize.
[2021-05-12 18:59:58] [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 close... while checking expression at index 4
[2021-05-12 18:59:59] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2021-05-12 18:59:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:59:59] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2021-05-12 18:59:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:59:59] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2021-05-12 18:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:01] [INFO ] [Nat]Absence check using state equation in 1897 ms returned sat
[2021-05-12 19:00:01] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 19:00:01] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 19:00:01] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 19:00:01] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 19:00:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 5 ms to minimize.
[2021-05-12 19:00:01] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 19:00:01] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 19:00:02] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 19:00:02] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 19:00:02] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 19:00:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 701 ms
[2021-05-12 19:00:02] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 94 ms.
[2021-05-12 19:00:04] [INFO ] Deduced a trap composed of 3 places in 414 ms of which 1 ms to minimize.
[2021-05-12 19:00:04] [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 close... while checking expression at index 5
[2021-05-12 19:00:05] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2021-05-12 19:00:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:05] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2021-05-12 19:00:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:00:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2021-05-12 19:00:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:07] [INFO ] [Nat]Absence check using state equation in 1832 ms returned sat
[2021-05-12 19:00:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2021-05-12 19:00:07] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 19:00:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 19:00:07] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 19:00:07] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 19:00:08] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 19:00:08] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 19:00:08] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 19:00:08] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 19:00:08] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 19:00:08] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 19:00:08] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 19:00:08] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 19:00:08] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 19:00:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1229 ms
[2021-05-12 19:00:08] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 90 ms.
[2021-05-12 19:00:10] [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 close... while checking expression at index 6
[2021-05-12 19:00:10] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2021-05-12 19:00:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:11] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2021-05-12 19:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:00:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 38 ms returned sat
[2021-05-12 19:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:13] [INFO ] [Nat]Absence check using state equation in 2428 ms returned sat
[2021-05-12 19:00:13] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2021-05-12 19:00:13] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2021-05-12 19:00:13] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 19:00:13] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 19:00:14] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 19:00:14] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 19:00:14] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 19:00:14] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 19:00:14] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 19:00:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 659 ms
[2021-05-12 19:00:14] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 91 ms.
[2021-05-12 19:00:16] [INFO ] Added : 105 causal constraints over 21 iterations in 1766 ms. Result :unknown
[2021-05-12 19:00:16] [INFO ] [Real]Absence check using 200 positive place invariants in 70 ms returned sat
[2021-05-12 19:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:16] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2021-05-12 19:00:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:00:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2021-05-12 19:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:18] [INFO ] [Nat]Absence check using state equation in 1735 ms returned sat
[2021-05-12 19:00:18] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 19:00:18] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 19:00:18] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 19:00:18] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 19:00:18] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 19:00:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 359 ms
[2021-05-12 19:00:19] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 91 ms.
[2021-05-12 19:00:22] [INFO ] Deduced a trap composed of 3 places in 431 ms of which 1 ms to minimize.
[2021-05-12 19:00:22] [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 close... while checking expression at index 8
[2021-05-12 19:00:22] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2021-05-12 19:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:22] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2021-05-12 19:00:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:00:22] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2021-05-12 19:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:24] [INFO ] [Nat]Absence check using state equation in 1713 ms returned sat
[2021-05-12 19:00:24] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2021-05-12 19:00:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2021-05-12 19:00:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 19:00:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2021-05-12 19:00:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 19:00:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2021-05-12 19:00:25] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 19:00:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2021-05-12 19:00:25] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 19:00:25] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 19:00:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 19:00:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 795 ms
[2021-05-12 19:00:25] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 73 ms.
[2021-05-12 19:00:28] [INFO ] Deduced a trap composed of 3 places in 443 ms of which 1 ms to minimize.
[2021-05-12 19:00:28] [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 close... while checking expression at index 9
[2021-05-12 19:00:28] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2021-05-12 19:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:28] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2021-05-12 19:00:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:00:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2021-05-12 19:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:30] [INFO ] [Nat]Absence check using state equation in 1772 ms returned sat
[2021-05-12 19:00:30] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2021-05-12 19:00:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2021-05-12 19:00:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2021-05-12 19:00:31] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2021-05-12 19:00:31] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2021-05-12 19:00:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2021-05-12 19:00:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2021-05-12 19:00:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2021-05-12 19:00:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2021-05-12 19:00:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 827 ms
[2021-05-12 19:00:31] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 75 ms.
[2021-05-12 19:00:34] [INFO ] Added : 125 causal constraints over 25 iterations in 2287 ms. Result :unknown
[2021-05-12 19:00:34] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2021-05-12 19:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:34] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2021-05-12 19:00:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:00:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2021-05-12 19:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:36] [INFO ] [Nat]Absence check using state equation in 1983 ms returned sat
[2021-05-12 19:00:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2021-05-12 19:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2021-05-12 19:00:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2021-05-12 19:00:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2021-05-12 19:00:37] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2021-05-12 19:00:37] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 19:00:37] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 19:00:37] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 19:00:37] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 19:00:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 657 ms
[2021-05-12 19:00:37] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 77 ms.
[2021-05-12 19:00:40] [INFO ] Deduced a trap composed of 3 places in 428 ms of which 1 ms to minimize.
[2021-05-12 19:00:40] [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 close... while checking expression at index 11
[2021-05-12 19:00:40] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2021-05-12 19:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:40] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2021-05-12 19:00:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:00:40] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2021-05-12 19:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:42] [INFO ] [Nat]Absence check using state equation in 1339 ms returned sat
[2021-05-12 19:00:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2021-05-12 19:00:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2021-05-12 19:00:42] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 19:00:42] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 19:00:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2021-05-12 19:00:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2021-05-12 19:00:42] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 19:00:42] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 19:00:42] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2021-05-12 19:00:42] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2021-05-12 19:00:42] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 19:00:43] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 898 ms
[2021-05-12 19:00:43] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 74 ms.
[2021-05-12 19:00:46] [INFO ] Deduced a trap composed of 3 places in 411 ms of which 1 ms to minimize.
[2021-05-12 19:00:46] [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 close... while checking expression at index 12
[2021-05-12 19:00:46] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2021-05-12 19:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:46] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2021-05-12 19:00:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:00:46] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2021-05-12 19:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:49] [INFO ] [Nat]Absence check using state equation in 2863 ms returned sat
[2021-05-12 19:00:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2021-05-12 19:00:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 19:00:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2021-05-12 19:00:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 19:00:49] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 19:00:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 19:00:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 478 ms
[2021-05-12 19:00:50] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 82 ms.
[2021-05-12 19:00:51] [INFO ] Added : 80 causal constraints over 16 iterations in 1550 ms. Result :unknown
[2021-05-12 19:00:51] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2021-05-12 19:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:52] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2021-05-12 19:00:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:00:52] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2021-05-12 19:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:00:53] [INFO ] [Nat]Absence check using state equation in 1125 ms returned sat
[2021-05-12 19:00:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2021-05-12 19:00:53] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 19:00:53] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 19:00:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 19:00:53] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2021-05-12 19:00:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 19:00:53] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 19:00:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 506 ms
[2021-05-12 19:00:54] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 73 ms.
[2021-05-12 19:00:57] [INFO ] Added : 200 causal constraints over 40 iterations in 3243 ms. Result :unknown
Fused 15 Parikh solutions to 6 different solutions.
Interrupted Parikh walk after 1347781 steps, including 64 resets, run timeout after 30001 ms. (steps per millisecond=44 ) properties (out of 15) seen :10
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Interrupted Parikh walk after 1355472 steps, including 68 resets, run timeout after 30001 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Interrupted Parikh walk after 1362314 steps, including 70 resets, run timeout after 30001 ms. (steps per millisecond=45 ) properties (out of 5) seen :1
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Interrupted Parikh walk after 1376967 steps, including 69 resets, run timeout after 30001 ms. (steps per millisecond=45 ) properties (out of 4) seen :2
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 35 are kept as prefixes of interest. Removing 965 places using SCC suffix rule.4 ms
Discarding 965 places :
Also discarding 1544 output transitions
Drop transitions removed 1544 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 35 transition count 56
Applied a total of 2 rules in 20 ms. Remains 35 /1000 variables (removed 965) and now considering 56/1601 (removed 1545) transitions.
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 19:02:57] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 19:02:57] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/1000 places, 56/1601 transitions.
[2021-05-12 19:02:57] [INFO ] Flatten gal took : 26 ms
[2021-05-12 19:02:57] [INFO ] Flatten gal took : 7 ms
[2021-05-12 19:02:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4763519689401383227.gal : 4 ms
[2021-05-12 19:02:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2918464866075986057.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4763519689401383227.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2918464866075986057.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4763519689401383227.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2918464866075986057.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2918464866075986057.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 10755
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10755 after 19900
Reachability property JoinFreeModules-PT-0200-ReachabilityCardinality-01 is true.
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :19900 after 4.87563e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.87563e+06 after 1.06334e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.06334e+07 after 1.92442e+07
Detected timeout of ITS tools.
[2021-05-12 19:03:12] [INFO ] Flatten gal took : 5 ms
[2021-05-12 19:03:12] [INFO ] Applying decomposition
[2021-05-12 19:03:12] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10621435827986194714.txt, -o, /tmp/graph10621435827986194714.bin, -w, /tmp/graph10621435827986194714.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10621435827986194714.bin, -l, -1, -v, -w, /tmp/graph10621435827986194714.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 19:03:12] [INFO ] Decomposing Gal with order
[2021-05-12 19:03:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 19:03:12] [INFO ] Flatten gal took : 27 ms
[2021-05-12 19:03:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 19:03:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality224608361714215013.gal : 2 ms
[2021-05-12 19:03:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6768188230890393025.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality224608361714215013.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6768188230890393025.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality224608361714215013.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6768188230890393025.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6768188230890393025.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3104 after 10755
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :10755 after 19900
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :19900 after 4.87563e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.87563e+06 after 1.45683e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11793660497122664880
[2021-05-12 19:03:27] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11793660497122664880
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11793660497122664880]
Compilation finished in 296 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11793660497122664880]
Link finished in 47 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, JoinFreeModulesPT0200ReachabilityCardinality07==true], workingDir=/tmp/ltsmin11793660497122664880]
LTSmin run took 307 ms.
Found Violation
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
All properties solved without resorting to model-checking.
BK_STOP 1620846209293
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="JoinFreeModules-PT-0200"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-0200, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075407000446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0200.tgz
mv JoinFreeModules-PT-0200 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;