About the Execution of 2021-gold for FamilyReunion-COL-L00010M0001C001P001G001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 471.312 | 80021.00 | 90332.00 | 7004.90 | 11 2 11 11 11 11 11 2 11 11 2 2 11 11 11 11 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r089-tall-165260117800232.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r089-tall-165260117800232
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 7.7K Apr 30 08:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 08:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 30 08:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 30 08:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 134K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652726982900
Running Version 0
[2022-05-16 18:49:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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]
[2022-05-16 18:49:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:49:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-16 18:49:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 18:49:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 602 ms
[2022-05-16 18:49:48] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2022-05-16 18:49:48] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2022-05-16 18:49:48] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions in 4 ms.
[2022-05-16 18:49:48] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_3760327767720230532.dot
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 18:49:48] [INFO ] Computed 33 place invariants in 6 ms
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-16 18:49:48] [INFO ] Unfolded HLPN to a Petri net with 1486 places and 1234 transitions in 21 ms.
[2022-05-16 18:49:48] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 18:49:48] [INFO ] Computed 33 place invariants in 5 ms
[2022-05-16 18:49:48] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-05-16 18:49:48] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-16 18:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:48] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-05-16 18:49:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:49] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 18:49:49] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-16 18:49:49] [INFO ] Added : 10 causal constraints over 2 iterations in 60 ms. Result :sat
Minimization took 27 ms.
[2022-05-16 18:49:49] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 25 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:49] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-16 18:49:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:49] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-05-16 18:49:49] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 18:49:49] [INFO ] Added : 60 causal constraints over 12 iterations in 101 ms. Result :sat
Minimization took 12 ms.
[2022-05-16 18:49:49] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:49] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-05-16 18:49:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:49] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 18:49:49] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 18:49:49] [INFO ] Added : 2 causal constraints over 1 iterations in 54 ms. Result :sat
Minimization took 10 ms.
[2022-05-16 18:49:49] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:49] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 18:49:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:49] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 18:49:49] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 18:49:50] [INFO ] Added : 48 causal constraints over 10 iterations in 77 ms. Result :sat
Minimization took 14 ms.
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 18:49:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-16 18:49:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 18:49:50] [INFO ] Added : 23 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 9 ms.
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-16 18:49:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 18:49:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 18:49:50] [INFO ] Added : 44 causal constraints over 9 iterations in 76 ms. Result :sat
Minimization took 14 ms.
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 18:49:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 18:49:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 18:49:50] [INFO ] Added : 55 causal constraints over 11 iterations in 91 ms. Result :sat
Minimization took 14 ms.
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 18:49:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 18:49:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 18:49:50] [INFO ] Added : 65 causal constraints over 13 iterations in 93 ms. Result :sat
Minimization took 17 ms.
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:50] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 18:49:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 18:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 18:49:50] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 18:49:51] [INFO ] Added : 43 causal constraints over 9 iterations in 52 ms. Result :sat
Minimization took 12 ms.
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 18:49:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-16 18:49:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 18:49:51] [INFO ] Added : 45 causal constraints over 9 iterations in 69 ms. Result :sat
Minimization took 15 ms.
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 18:49:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 18:49:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 18:49:51] [INFO ] Added : 61 causal constraints over 13 iterations in 72 ms. Result :sat
Minimization took 15 ms.
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 18:49:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 18:49:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 18:49:51] [INFO ] Added : 52 causal constraints over 11 iterations in 68 ms. Result :sat
Minimization took 11 ms.
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 18:49:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 18:49:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 18:49:51] [INFO ] Added : 26 causal constraints over 6 iterations in 38 ms. Result :sat
Minimization took 10 ms.
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 18:49:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 18:49:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 18:49:51] [INFO ] Added : 6 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 6 ms.
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 18:49:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 18:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:51] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 18:49:51] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 18:49:52] [INFO ] Added : 29 causal constraints over 6 iterations in 40 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [11, 6, 11, 11, 55, 11, 11, 4, 22, 22, 2, 11, 11, 11, 11]
[2022-05-16 18:49:52] [INFO ] Unfolded HLPN to a Petri net with 1486 places and 1234 transitions in 14 ms.
[2022-05-16 18:49:52] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_12561827556763413263.dot
Deduced a syphon composed of 11 places in 16 ms
Reduce places removed 21 places and 0 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 15) seen :71
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :35
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-00 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :24
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-02 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :23
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-14 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1234 rows 1465 cols
[2022-05-16 18:49:52] [INFO ] Computed 332 place invariants in 68 ms
[2022-05-16 18:49:52] [INFO ] [Real]Absence check using 26 positive place invariants in 34 ms returned sat
[2022-05-16 18:49:52] [INFO ] [Real]Absence check using 26 positive and 306 generalized place invariants in 58 ms returned unsat
[2022-05-16 18:49:52] [INFO ] [Real]Absence check using 26 positive place invariants in 23 ms returned sat
[2022-05-16 18:49:52] [INFO ] [Real]Absence check using 26 positive and 306 generalized place invariants in 67 ms returned sat
[2022-05-16 18:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:53] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2022-05-16 18:49:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:49:53] [INFO ] [Nat]Absence check using 26 positive place invariants in 19 ms returned sat
[2022-05-16 18:49:53] [INFO ] [Nat]Absence check using 26 positive and 306 generalized place invariants in 65 ms returned sat
[2022-05-16 18:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:49:53] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2022-05-16 18:49:54] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 64 ms.
[2022-05-16 18:49:59] [INFO ] Deduced a trap composed of 35 places in 944 ms of which 6 ms to minimize.
[2022-05-16 18:49:59] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 18:50:00] [INFO ] [Real]Absence check using 26 positive place invariants in 19 ms returned sat
[2022-05-16 18:50:00] [INFO ] [Real]Absence check using 26 positive and 306 generalized place invariants in 73 ms returned sat
[2022-05-16 18:50:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:01] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2022-05-16 18:50:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:50:01] [INFO ] [Nat]Absence check using 26 positive place invariants in 21 ms returned sat
[2022-05-16 18:50:01] [INFO ] [Nat]Absence check using 26 positive and 306 generalized place invariants in 87 ms returned sat
[2022-05-16 18:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:01] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2022-05-16 18:50:02] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 89 ms.
[2022-05-16 18:50:06] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 18:50:06] [INFO ] [Real]Absence check using 26 positive place invariants in 20 ms returned sat
[2022-05-16 18:50:06] [INFO ] [Real]Absence check using 26 positive and 306 generalized place invariants in 76 ms returned sat
[2022-05-16 18:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:06] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2022-05-16 18:50:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:50:07] [INFO ] [Nat]Absence check using 26 positive place invariants in 18 ms returned sat
[2022-05-16 18:50:07] [INFO ] [Nat]Absence check using 26 positive and 306 generalized place invariants in 67 ms returned sat
[2022-05-16 18:50:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:07] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2022-05-16 18:50:07] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 67 ms.
[2022-05-16 18:50:12] [INFO ] Deduced a trap composed of 35 places in 574 ms of which 5 ms to minimize.
[2022-05-16 18:50:12] [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 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 18:50:12] [INFO ] [Real]Absence check using 26 positive place invariants in 25 ms returned sat
[2022-05-16 18:50:12] [INFO ] [Real]Absence check using 26 positive and 306 generalized place invariants in 71 ms returned sat
[2022-05-16 18:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:13] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2022-05-16 18:50:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:50:13] [INFO ] [Nat]Absence check using 26 positive place invariants in 21 ms returned sat
[2022-05-16 18:50:13] [INFO ] [Nat]Absence check using 26 positive and 306 generalized place invariants in 72 ms returned sat
[2022-05-16 18:50:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:14] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2022-05-16 18:50:14] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 57 ms.
[2022-05-16 18:50:18] [INFO ] Added : 315 causal constraints over 63 iterations in 4290 ms. Result :unknown
[2022-05-16 18:50:18] [INFO ] [Real]Absence check using 26 positive place invariants in 18 ms returned sat
[2022-05-16 18:50:18] [INFO ] [Real]Absence check using 26 positive and 306 generalized place invariants in 33 ms returned unsat
[2022-05-16 18:50:18] [INFO ] [Real]Absence check using 26 positive place invariants in 20 ms returned sat
[2022-05-16 18:50:18] [INFO ] [Real]Absence check using 26 positive and 306 generalized place invariants in 79 ms returned sat
[2022-05-16 18:50:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:19] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2022-05-16 18:50:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:50:19] [INFO ] [Nat]Absence check using 26 positive place invariants in 19 ms returned sat
[2022-05-16 18:50:19] [INFO ] [Nat]Absence check using 26 positive and 306 generalized place invariants in 70 ms returned sat
[2022-05-16 18:50:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:20] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2022-05-16 18:50:20] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 62 ms.
[2022-05-16 18:50:24] [INFO ] Deduced a trap composed of 35 places in 553 ms of which 2 ms to minimize.
[2022-05-16 18:50:24] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 18:50:25] [INFO ] [Real]Absence check using 26 positive place invariants in 20 ms returned sat
[2022-05-16 18:50:25] [INFO ] [Real]Absence check using 26 positive and 306 generalized place invariants in 71 ms returned sat
[2022-05-16 18:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:25] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2022-05-16 18:50:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:50:25] [INFO ] [Nat]Absence check using 26 positive place invariants in 20 ms returned sat
[2022-05-16 18:50:25] [INFO ] [Nat]Absence check using 26 positive and 306 generalized place invariants in 73 ms returned sat
[2022-05-16 18:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:26] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2022-05-16 18:50:26] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 62 ms.
[2022-05-16 18:50:30] [INFO ] Added : 320 causal constraints over 64 iterations in 4225 ms. Result :unknown
[2022-05-16 18:50:30] [INFO ] [Real]Absence check using 26 positive place invariants in 18 ms returned sat
[2022-05-16 18:50:30] [INFO ] [Real]Absence check using 26 positive and 306 generalized place invariants in 69 ms returned sat
[2022-05-16 18:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:31] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2022-05-16 18:50:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:50:31] [INFO ] [Nat]Absence check using 26 positive place invariants in 19 ms returned sat
[2022-05-16 18:50:31] [INFO ] [Nat]Absence check using 26 positive and 306 generalized place invariants in 69 ms returned sat
[2022-05-16 18:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:32] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2022-05-16 18:50:32] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 63 ms.
[2022-05-16 18:50:36] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 18:50:36] [INFO ] [Real]Absence check using 26 positive place invariants in 19 ms returned sat
[2022-05-16 18:50:36] [INFO ] [Real]Absence check using 26 positive and 306 generalized place invariants in 81 ms returned sat
[2022-05-16 18:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:37] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2022-05-16 18:50:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:50:37] [INFO ] [Nat]Absence check using 26 positive place invariants in 19 ms returned sat
[2022-05-16 18:50:37] [INFO ] [Nat]Absence check using 26 positive and 306 generalized place invariants in 73 ms returned sat
[2022-05-16 18:50:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:37] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2022-05-16 18:50:38] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 59 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-16 18:50:42] [INFO ] Deduced a trap composed of 35 places in 550 ms of which 5 ms to minimize.
[2022-05-16 18:50:42] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 18:50:42] [INFO ] [Real]Absence check using 26 positive place invariants in 19 ms returned sat
[2022-05-16 18:50:43] [INFO ] [Real]Absence check using 26 positive and 306 generalized place invariants in 76 ms returned sat
[2022-05-16 18:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:43] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2022-05-16 18:50:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:50:43] [INFO ] [Nat]Absence check using 26 positive place invariants in 20 ms returned sat
[2022-05-16 18:50:43] [INFO ] [Nat]Absence check using 26 positive and 306 generalized place invariants in 73 ms returned sat
[2022-05-16 18:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:44] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2022-05-16 18:50:44] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 63 ms.
[2022-05-16 18:50:49] [INFO ] Deduced a trap composed of 35 places in 586 ms of which 2 ms to minimize.
[2022-05-16 18:50:49] [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 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [2, 11, 55, 11, 11, 2, 22, 22, 11, 11, 11] Max seen :[2, 3, 8, 6, 4, 2, 4, 4, 4, 7, 3]
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 44000 steps, including 103 resets, run finished after 201 ms. (steps per millisecond=218 ) properties (out of 9) seen :34 could not realise parikh vector
Incomplete Parikh walk after 39400 steps, including 104 resets, run finished after 164 ms. (steps per millisecond=240 ) properties (out of 9) seen :35 could not realise parikh vector
Support contains 121 out of 1465 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Graph (complete) has 2215 edges and 1465 vertex of which 1238 are kept as prefixes of interest. Removing 227 places using SCC suffix rule.778 ms
Discarding 227 places :
Also discarding 200 output transitions
Drop transitions removed 200 transitions
Discarding 132 places :
Implicit places reduction removed 132 places
Drop transitions removed 363 transitions
Trivial Post-agglo rules discarded 363 transitions
Performed 363 trivial Post agglomeration. Transition count delta: 363
Iterating post reduction 0 with 495 rules applied. Total rules applied 496 place count 1106 transition count 671
Reduce places removed 363 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 1 with 407 rules applied. Total rules applied 903 place count 743 transition count 627
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 947 place count 699 transition count 627
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 947 place count 699 transition count 550
Deduced a syphon composed of 77 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1123 place count 600 transition count 550
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1145 place count 600 transition count 528
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1167 place count 578 transition count 528
Discarding 55 places :
Symmetric choice reduction at 5 with 55 rule applications. Total rules 1222 place count 523 transition count 473
Iterating global reduction 5 with 55 rules applied. Total rules applied 1277 place count 523 transition count 473
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 11 rules applied. Total rules applied 1288 place count 523 transition count 462
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1299 place count 512 transition count 462
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 33 Pre rules applied. Total rules applied 1299 place count 512 transition count 429
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 1365 place count 479 transition count 429
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1367 place count 477 transition count 407
Iterating global reduction 7 with 2 rules applied. Total rules applied 1369 place count 477 transition count 407
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 7 with 44 rules applied. Total rules applied 1413 place count 444 transition count 396
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 22 Pre rules applied. Total rules applied 1413 place count 444 transition count 374
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 1457 place count 422 transition count 374
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1468 place count 411 transition count 363
Iterating global reduction 8 with 11 rules applied. Total rules applied 1479 place count 411 transition count 363
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 8 with 44 rules applied. Total rules applied 1523 place count 400 transition count 330
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1545 place count 378 transition count 330
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 10 with 44 rules applied. Total rules applied 1589 place count 356 transition count 308
Free-agglomeration rule (complex) applied 44 times.
Iterating global reduction 10 with 44 rules applied. Total rules applied 1633 place count 356 transition count 264
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 10 with 44 rules applied. Total rules applied 1677 place count 312 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1678 place count 311 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1679 place count 310 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1680 place count 309 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1681 place count 308 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1682 place count 307 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1683 place count 306 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1684 place count 305 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1685 place count 304 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1686 place count 303 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1687 place count 302 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1688 place count 301 transition count 253
Applied a total of 1688 rules in 1028 ms. Remains 301 /1465 variables (removed 1164) and now considering 253/1234 (removed 981) transitions.
Finished structural reductions, in 1 iterations. Remains : 301/1465 places, 253/1234 transitions.
// Phase 1: matrix 253 rows 301 cols
[2022-05-16 18:50:50] [INFO ] Computed 80 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 5319 resets, run finished after 3614 ms. (steps per millisecond=276 ) properties (out of 9) seen :75
Incomplete Best-First random walk after 1000001 steps, including 360 resets, run finished after 834 ms. (steps per millisecond=1199 ) properties (out of 9) seen :63
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-03 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 491 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 8) seen :59
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-05 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 477 resets, run finished after 828 ms. (steps per millisecond=1207 ) properties (out of 7) seen :48
Incomplete Best-First random walk after 1000000 steps, including 476 resets, run finished after 820 ms. (steps per millisecond=1219 ) properties (out of 7) seen :47
Incomplete Best-First random walk after 1000001 steps, including 417 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 7) seen :54
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-12 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 583 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 6) seen :34
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-15 11 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 253 rows 301 cols
[2022-05-16 18:50:58] [INFO ] Computed 80 place invariants in 16 ms
[2022-05-16 18:50:59] [INFO ] [Real]Absence check using 0 positive and 80 generalized place invariants in 11 ms returned sat
[2022-05-16 18:50:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:59] [INFO ] [Real]Absence check using state equation in 63 ms returned unsat
[2022-05-16 18:50:59] [INFO ] [Real]Absence check using 0 positive and 80 generalized place invariants in 11 ms returned sat
[2022-05-16 18:50:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:59] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-16 18:50:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:50:59] [INFO ] [Nat]Absence check using 0 positive and 80 generalized place invariants in 11 ms returned sat
[2022-05-16 18:50:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:50:59] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2022-05-16 18:50:59] [INFO ] Computed and/alt/rep : 198/330/198 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-16 18:50:59] [INFO ] Added : 133 causal constraints over 27 iterations in 458 ms. Result :sat
Minimization took 77 ms.
[2022-05-16 18:50:59] [INFO ] [Real]Absence check using 0 positive and 80 generalized place invariants in 11 ms returned sat
[2022-05-16 18:50:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:51:00] [INFO ] [Real]Absence check using state equation in 56 ms returned unsat
[2022-05-16 18:51:00] [INFO ] [Real]Absence check using 0 positive and 80 generalized place invariants in 10 ms returned sat
[2022-05-16 18:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:51:00] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
[2022-05-16 18:51:00] [INFO ] [Real]Absence check using 0 positive and 80 generalized place invariants in 10 ms returned sat
[2022-05-16 18:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:51:00] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-16 18:51:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:51:00] [INFO ] [Nat]Absence check using 0 positive and 80 generalized place invariants in 10 ms returned sat
[2022-05-16 18:51:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:51:00] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-16 18:51:00] [INFO ] Computed and/alt/rep : 198/330/198 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-16 18:51:00] [INFO ] Added : 11 causal constraints over 3 iterations in 69 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [11, 11, 11, 11, 11] Max seen :[11, 7, 11, 11, 10]
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-09 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-08 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-04 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 2200 steps, including 94 resets, run finished after 6 ms. (steps per millisecond=366 ) properties (out of 2) seen :11 could not realise parikh vector
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-13 11 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 17600 steps, including 99 resets, run finished after 41 ms. (steps per millisecond=429 ) properties (out of 1) seen :11 could not realise parikh vector
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-06 11 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
BK_STOP 1652727062921
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="FamilyReunion-COL-L00010M0001C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r089-tall-165260117800232"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00010M0001C001P001G001.tgz
mv FamilyReunion-COL-L00010M0001C001P001G001 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;