About the Execution of ITS-Tools for FamilyReunion-COL-L00050M0005C002P002G001
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.r083-tall-162048875900859.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 FamilyReunion-COL-L00050M0005C002P002G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875900859
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Mar 22 18:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 24 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 137K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1620678798191
Running Version 0
[2021-05-10 20:33:19] [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]
[2021-05-10 20:33:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 20:33:19] [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.
[2021-05-10 20:33:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-10 20:33:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 649 ms
[2021-05-10 20:33:20] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2021-05-10 20:33:20] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2021-05-10 20:33:20] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions in 5 ms.
[2021-05-10 20:33:20] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_17739327358948296418.dot
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2021-05-10 20:33:20] [INFO ] Computed 33 place invariants in 11 ms
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-10 20:33:20] [INFO ] Unfolded HLPN to a Petri net with 12245 places and 10560 transitions in 84 ms.
[2021-05-10 20:33:20] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 66 rows 99 cols
[2021-05-10 20:33:20] [INFO ] Computed 33 place invariants in 7 ms
[2021-05-10 20:33:20] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2021-05-10 20:33:20] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-10 20:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:20] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-10 20:33:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:20] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:33:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:20] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-10 20:33:20] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-10 20:33:21] [INFO ] Added : 15 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 9 ms.
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-10 20:33:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-10 20:33:21] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-10 20:33:21] [INFO ] Added : 7 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 9 ms.
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-10 20:33:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-10 20:33:21] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-10 20:33:21] [INFO ] Added : 6 causal constraints over 2 iterations in 38 ms. Result :sat
Minimization took 8 ms.
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-10 20:33:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-10 20:33:21] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-10 20:33:21] [INFO ] Added : 18 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 9 ms.
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-10 20:33:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2021-05-10 20:33:21] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-10 20:33:21] [INFO ] Added : 54 causal constraints over 11 iterations in 68 ms. Result :sat
Minimization took 12 ms.
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-10 20:33:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-10 20:33:21] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-10 20:33:21] [INFO ] Added : 20 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 8 ms.
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-10 20:33:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:21] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:33:22] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-10 20:33:22] [INFO ] Added : 44 causal constraints over 9 iterations in 57 ms. Result :sat
Minimization took 11 ms.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:33:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-10 20:33:22] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-10 20:33:22] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-10 20:33:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-10 20:33:22] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-10 20:33:22] [INFO ] Added : 57 causal constraints over 12 iterations in 68 ms. Result :sat
Minimization took 12 ms.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-10 20:33:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-10 20:33:22] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-10 20:33:22] [INFO ] Added : 21 causal constraints over 5 iterations in 45 ms. Result :sat
Minimization took 9 ms.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-10 20:33:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-10 20:33:22] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-10 20:33:22] [INFO ] Added : 25 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 9 ms.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:33:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-10 20:33:22] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-10 20:33:22] [INFO ] Added : 31 causal constraints over 7 iterations in 41 ms. Result :sat
Minimization took 10 ms.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-10 20:33:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-10 20:33:22] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-10 20:33:22] [INFO ] Added : 25 causal constraints over 5 iterations in 31 ms. Result :sat
Minimization took 9 ms.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:33:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:22] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:23] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-10 20:33:23] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-10 20:33:23] [INFO ] Added : 65 causal constraints over 13 iterations in 77 ms. Result :sat
Minimization took 14 ms.
[2021-05-10 20:33:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:23] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-10 20:33:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:33:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 20:33:23] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2021-05-10 20:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:23] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-10 20:33:23] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-10 20:33:23] [INFO ] Added : 13 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [51, 51, 51, 51, 69, 51, 102, 1122, 2, 51, 51, 102, 51, 8, 51]
[2021-05-10 20:33:23] [INFO ] Unfolded HLPN to a Petri net with 12245 places and 10560 transitions in 35 ms.
[2021-05-10 20:33:23] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_8865097780390328452.dot
Deduced a syphon composed of 51 places in 60 ms
Reduce places removed 68 places and 0 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 736 ms. (steps per millisecond=13 ) properties (out of 15) seen :161
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
// Phase 1: matrix 10560 rows 12177 cols
[2021-05-10 20:33:26] [INFO ] Computed 2768 place invariants in 1483 ms
[2021-05-10 20:33:28] [INFO ] [Real]Absence check using 65 positive place invariants in 226 ms returned sat
[2021-05-10 20:33:29] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1247 ms returned sat
[2021-05-10 20:33:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:31] [INFO ] [Real]Absence check using state equation in 2333 ms returned unknown
[2021-05-10 20:33:33] [INFO ] [Real]Absence check using 65 positive place invariants in 222 ms returned sat
[2021-05-10 20:33:34] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1191 ms returned sat
[2021-05-10 20:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:36] [INFO ] [Real]Absence check using state equation in 2388 ms returned unknown
[2021-05-10 20:33:38] [INFO ] [Real]Absence check using 65 positive place invariants in 222 ms returned sat
[2021-05-10 20:33:39] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1239 ms returned sat
[2021-05-10 20:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:41] [INFO ] [Real]Absence check using state equation in 2319 ms returned unknown
[2021-05-10 20:33:43] [INFO ] [Real]Absence check using 65 positive place invariants in 221 ms returned sat
[2021-05-10 20:33:44] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1235 ms returned sat
[2021-05-10 20:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:46] [INFO ] [Real]Absence check using state equation in 2322 ms returned unknown
[2021-05-10 20:33:48] [INFO ] [Real]Absence check using 65 positive place invariants in 234 ms returned sat
[2021-05-10 20:33:49] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1231 ms returned sat
[2021-05-10 20:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:51] [INFO ] [Real]Absence check using state equation in 2329 ms returned unknown
[2021-05-10 20:33:53] [INFO ] [Real]Absence check using 65 positive place invariants in 217 ms returned sat
[2021-05-10 20:33:54] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1201 ms returned sat
[2021-05-10 20:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:33:56] [INFO ] [Real]Absence check using state equation in 2382 ms returned unknown
[2021-05-10 20:33:58] [INFO ] [Real]Absence check using 65 positive place invariants in 223 ms returned sat
[2021-05-10 20:33:59] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1210 ms returned sat
[2021-05-10 20:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:34:01] [INFO ] [Real]Absence check using state equation in 2410 ms returned unknown
[2021-05-10 20:34:03] [INFO ] [Real]Absence check using 65 positive place invariants in 224 ms returned sat
[2021-05-10 20:34:04] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1308 ms returned sat
[2021-05-10 20:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:34: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: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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)
[2021-05-10 20:34:08] [INFO ] [Real]Absence check using 65 positive place invariants in 222 ms returned sat
[2021-05-10 20:34:09] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1235 ms returned sat
[2021-05-10 20:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:34:11] [INFO ] [Real]Absence check using state equation in 2351 ms returned unknown
[2021-05-10 20:34:13] [INFO ] [Real]Absence check using 65 positive place invariants in 216 ms returned sat
[2021-05-10 20:34:14] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1199 ms returned sat
[2021-05-10 20:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:34:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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)
[2021-05-10 20:34:18] [INFO ] [Real]Absence check using 65 positive place invariants in 223 ms returned sat
[2021-05-10 20:34:19] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1240 ms returned sat
[2021-05-10 20:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:34:21] [INFO ] [Real]Absence check using state equation in 2372 ms returned unknown
[2021-05-10 20:34:23] [INFO ] [Real]Absence check using 65 positive place invariants in 221 ms returned sat
[2021-05-10 20:34:24] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1208 ms returned sat
[2021-05-10 20:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:34:26] [INFO ] [Real]Absence check using state equation in 2381 ms returned unknown
[2021-05-10 20:34:28] [INFO ] [Real]Absence check using 65 positive place invariants in 219 ms returned sat
[2021-05-10 20:34:28] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 704 ms returned unsat
[2021-05-10 20:34:30] [INFO ] [Real]Absence check using 65 positive place invariants in 220 ms returned sat
[2021-05-10 20:34:31] [INFO ] [Real]Absence check using 65 positive and 2703 generalized place invariants in 1246 ms returned sat
[2021-05-10 20:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:34:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
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) : [51, 51, 51, 51, 69, 51, 102, 1122, 51, 51, 102, 51, 2, 51] Max seen :[10, 15, 31, 10, 8, 8, 7, 11, 9, 10, 7, 10, 2, 21]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2346 out of 12177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 11028 are kept as prefixes of interest. Removing 1149 places using SCC suffix rule.48 ms
Discarding 1149 places :
Also discarding 1074 output transitions
Drop transitions removed 1074 transitions
Discarding 1224 places :
Implicit places reduction removed 1224 places
Drop transitions removed 1785 transitions
Trivial Post-agglo rules discarded 1785 transitions
Performed 1785 trivial Post agglomeration. Transition count delta: 1785
Iterating post reduction 0 with 3009 rules applied. Total rules applied 3010 place count 9804 transition count 7701
Reduce places removed 1785 places and 0 transitions.
Performed 408 Post agglomeration using F-continuation condition.Transition count delta: 408
Iterating post reduction 1 with 2193 rules applied. Total rules applied 5203 place count 8019 transition count 7293
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 2 with 408 rules applied. Total rules applied 5611 place count 7611 transition count 7293
Performed 612 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 612 Pre rules applied. Total rules applied 5611 place count 7611 transition count 6681
Deduced a syphon composed of 612 places in 17 ms
Ensure Unique test removed 408 places
Reduce places removed 1020 places and 0 transitions.
Iterating global reduction 3 with 1632 rules applied. Total rules applied 7243 place count 6591 transition count 6681
Discarding 204 places :
Implicit places reduction removed 204 places
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 204
Iterating post reduction 3 with 408 rules applied. Total rules applied 7651 place count 6387 transition count 6477
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 7855 place count 6183 transition count 6477
Discarding 510 places :
Symmetric choice reduction at 5 with 510 rule applications. Total rules 8365 place count 5673 transition count 5967
Iterating global reduction 5 with 510 rules applied. Total rules applied 8875 place count 5673 transition count 5967
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 5 with 204 rules applied. Total rules applied 9079 place count 5622 transition count 5814
Reduce places removed 153 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 6 with 204 rules applied. Total rules applied 9283 place count 5469 transition count 5763
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 7 with 51 rules applied. Total rules applied 9334 place count 5418 transition count 5763
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 9334 place count 5418 transition count 5712
Deduced a syphon composed of 51 places in 4 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 9436 place count 5367 transition count 5712
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 9440 place count 5363 transition count 5508
Iterating global reduction 8 with 4 rules applied. Total rules applied 9444 place count 5363 transition count 5508
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 8 with 255 rules applied. Total rules applied 9699 place count 5261 transition count 5355
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 9 with 51 rules applied. Total rules applied 9750 place count 5210 transition count 5355
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 51 Pre rules applied. Total rules applied 9750 place count 5210 transition count 5304
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 10 with 102 rules applied. Total rules applied 9852 place count 5159 transition count 5304
Performed 459 Post agglomeration using F-continuation condition.Transition count delta: 459
Deduced a syphon composed of 459 places in 2 ms
Ensure Unique test removed 306 places
Reduce places removed 765 places and 0 transitions.
Iterating global reduction 10 with 1224 rules applied. Total rules applied 11076 place count 4394 transition count 4845
Free-agglomeration rule (complex) applied 408 times.
Iterating global reduction 10 with 408 rules applied. Total rules applied 11484 place count 4394 transition count 4437
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 10 with 408 rules applied. Total rules applied 11892 place count 3986 transition count 4437
Applied a total of 11892 rules in 3585 ms. Remains 3986 /12177 variables (removed 8191) and now considering 4437/10560 (removed 6123) transitions.
Finished structural reductions, in 1 iterations. Remains : 3986/12177 places, 4437/10560 transitions.
// Phase 1: matrix 4437 rows 3986 cols
[2021-05-10 20:34:37] [INFO ] Computed 258 place invariants in 104 ms
Interrupted random walk after 528750 steps, including 470 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen :{0=19, 1=26, 2=30, 3=17, 4=15, 5=17, 6=14, 7=22, 8=17, 9=15, 10=17, 11=15, 12=21}
Incomplete Best-First random walk after 1000001 steps, including 21 resets, run finished after 3035 ms. (steps per millisecond=329 ) properties (out of 13) seen :132
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 710815 steps, including 15 resets, run timeout after 5001 ms. (steps per millisecond=142 ) properties seen :{0=1, 1=51, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-02 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 14 resets, run finished after 3052 ms. (steps per millisecond=327 ) properties (out of 11) seen :195
Interrupted Best-First random walk after 629139 steps, including 11 resets, run timeout after 5001 ms. (steps per millisecond=125 ) properties seen :{0=22, 1=13, 2=1, 3=51, 4=1, 5=22, 6=1, 7=1, 8=1, 9=1, 10=14}
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-05 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 697756 steps, including 16 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=51, 5=1, 6=1, 7=1, 8=1, 9=1}
Incomplete Best-First random walk after 1000001 steps, including 18 resets, run finished after 2767 ms. (steps per millisecond=361 ) properties (out of 10) seen :132
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-09 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 986838 steps, including 15 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :{0=21, 1=16, 2=1, 3=1, 4=22, 5=14, 6=51, 7=14, 8=16}
Incomplete Best-First random walk after 1000001 steps, including 17 resets, run finished after 4908 ms. (steps per millisecond=203 ) properties (out of 9) seen :182
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-12 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-10 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 4437 rows 3986 cols
[2021-05-10 20:35:42] [INFO ] Computed 258 place invariants in 53 ms
[2021-05-10 20:35:42] [INFO ] [Real]Absence check using 0 positive and 258 generalized place invariants in 93 ms returned sat
[2021-05-10 20:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:35:44] [INFO ] [Real]Absence check using state equation in 1749 ms returned sat
[2021-05-10 20:35:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:35:44] [INFO ] [Nat]Absence check using 0 positive and 258 generalized place invariants in 92 ms returned sat
[2021-05-10 20:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:35:46] [INFO ] [Nat]Absence check using state equation in 1739 ms returned sat
[2021-05-10 20:35:47] [INFO ] Computed and/alt/rep : 3723/6834/3723 causal constraints (skipped 408 transitions) in 321 ms.
[2021-05-10 20:35:55] [INFO ] Added : 186 causal constraints over 38 iterations in 8194 ms. Result :sat
[2021-05-10 20:35:55] [INFO ] [Real]Absence check using 0 positive and 258 generalized place invariants in 92 ms returned sat
[2021-05-10 20:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:35:57] [INFO ] [Real]Absence check using state equation in 1835 ms returned sat
[2021-05-10 20:35:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:35:58] [INFO ] [Nat]Absence check using 0 positive and 258 generalized place invariants in 92 ms returned sat
[2021-05-10 20:35:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:35:59] [INFO ] [Nat]Absence check using state equation in 1843 ms returned sat
[2021-05-10 20:36:00] [INFO ] Computed and/alt/rep : 3723/6834/3723 causal constraints (skipped 408 transitions) in 228 ms.
[2021-05-10 20:36:11] [INFO ] Added : 261 causal constraints over 53 iterations in 11014 ms. Result :sat
[2021-05-10 20:36:11] [INFO ] [Real]Absence check using 0 positive and 258 generalized place invariants in 91 ms returned sat
[2021-05-10 20:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:36:15] [INFO ] [Real]Absence check using state equation in 3471 ms returned unsat
[2021-05-10 20:36:15] [INFO ] [Real]Absence check using 0 positive and 258 generalized place invariants in 91 ms returned sat
[2021-05-10 20:36:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:36:18] [INFO ] [Real]Absence check using state equation in 2662 ms returned sat
[2021-05-10 20:36:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:36:18] [INFO ] [Nat]Absence check using 0 positive and 258 generalized place invariants in 91 ms returned sat
[2021-05-10 20:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:36:21] [INFO ] [Nat]Absence check using state equation in 2655 ms returned sat
[2021-05-10 20:36:21] [INFO ] Computed and/alt/rep : 3723/6834/3723 causal constraints (skipped 408 transitions) in 248 ms.
[2021-05-10 20:36:41] [INFO ] Added : 456 causal constraints over 92 iterations in 19400 ms. Result :sat
[2021-05-10 20:36:41] [INFO ] [Real]Absence check using 0 positive and 258 generalized place invariants in 91 ms returned sat
[2021-05-10 20:36:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:36:42] [INFO ] [Real]Absence check using state equation in 1158 ms returned unsat
[2021-05-10 20:36:43] [INFO ] [Real]Absence check using 0 positive and 258 generalized place invariants in 89 ms returned sat
[2021-05-10 20:36:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:36:48] [INFO ] [Real]Absence check using state equation in 5153 ms returned unsat
[2021-05-10 20:36:48] [INFO ] [Real]Absence check using 0 positive and 258 generalized place invariants in 90 ms returned sat
[2021-05-10 20:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:36:50] [INFO ] [Real]Absence check using state equation in 1854 ms returned sat
[2021-05-10 20:36:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:36:51] [INFO ] [Nat]Absence check using 0 positive and 258 generalized place invariants in 92 ms returned sat
[2021-05-10 20:36:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:36:53] [INFO ] [Nat]Absence check using state equation in 1844 ms returned sat
[2021-05-10 20:36:53] [INFO ] Computed and/alt/rep : 3723/6834/3723 causal constraints (skipped 408 transitions) in 227 ms.
[2021-05-10 20:37:09] [INFO ] Added : 390 causal constraints over 79 iterations in 16178 ms. Result :sat
Current structural bounds on expressions (after SMT) : [51, 51, 51, 102, 51, 51, 51] Max seen :[26, 17, 51, 15, 51, 51, 21]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-11 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-07 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 37100 steps, including 100 resets, run finished after 973 ms. (steps per millisecond=38 ) properties (out of 4) seen :61 could not realise parikh vector
Incomplete Parikh walk after 43700 steps, including 101 resets, run finished after 1145 ms. (steps per millisecond=38 ) properties (out of 4) seen :58 could not realise parikh vector
Incomplete Parikh walk after 26800 steps, including 99 resets, run finished after 707 ms. (steps per millisecond=37 ) properties (out of 4) seen :51 could not realise parikh vector
Incomplete Parikh walk after 14000 steps, including 98 resets, run finished after 349 ms. (steps per millisecond=40 ) properties (out of 4) seen :35 could not realise parikh vector
Support contains 969 out of 3986 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3986/3986 places, 4437/4437 transitions.
Graph (complete) has 6120 edges and 3986 vertex of which 3832 are kept as prefixes of interest. Removing 154 places using SCC suffix rule.2 ms
Discarding 154 places :
Also discarding 102 output transitions
Drop transitions removed 102 transitions
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 307 place count 3832 transition count 4029
Reduce places removed 306 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 612 Post agglomeration using F-continuation condition.Transition count delta: 612
Iterating post reduction 1 with 1020 rules applied. Total rules applied 1327 place count 3526 transition count 3315
Reduce places removed 612 places and 0 transitions.
Iterating post reduction 2 with 612 rules applied. Total rules applied 1939 place count 2914 transition count 3315
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 1939 place count 2914 transition count 3264
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 2092 place count 2812 transition count 3264
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 2092 place count 2812 transition count 3213
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 2194 place count 2761 transition count 3213
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 2551 place count 2404 transition count 2856
Iterating global reduction 3 with 357 rules applied. Total rules applied 2908 place count 2404 transition count 2856
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 3 with 153 rules applied. Total rules applied 3061 place count 2404 transition count 2703
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 3112 place count 2353 transition count 2703
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 5 with 255 rules applied. Total rules applied 3367 place count 2200 transition count 2601
Free-agglomeration rule (complex) applied 306 times.
Iterating global reduction 5 with 306 rules applied. Total rules applied 3673 place count 2200 transition count 2295
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 5 with 306 rules applied. Total rules applied 3979 place count 1894 transition count 2295
Applied a total of 3979 rules in 609 ms. Remains 1894 /3986 variables (removed 2092) and now considering 2295/4437 (removed 2142) transitions.
Finished structural reductions, in 1 iterations. Remains : 1894/3986 places, 2295/4437 transitions.
// Phase 1: matrix 2295 rows 1894 cols
[2021-05-10 20:37:13] [INFO ] Computed 104 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 1956 resets, run finished after 26337 ms. (steps per millisecond=37 ) properties (out of 4) seen :102
Interrupted Best-First random walk after 760540 steps, including 25 resets, run timeout after 5001 ms. (steps per millisecond=152 ) properties seen :{0=51, 1=1, 2=1, 3=1}
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-01 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 28 resets, run finished after 2469 ms. (steps per millisecond=405 ) properties (out of 3) seen :89
Interrupted Best-First random walk after 694480 steps, including 25 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen :{0=1, 1=1, 2=51}
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-15 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2295 rows 1894 cols
[2021-05-10 20:37:52] [INFO ] Computed 104 place invariants in 24 ms
[2021-05-10 20:37:52] [INFO ] [Real]Absence check using 0 positive and 104 generalized place invariants in 32 ms returned sat
[2021-05-10 20:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:37:53] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2021-05-10 20:37:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 20:37:53] [INFO ] [Nat]Absence check using 0 positive and 104 generalized place invariants in 33 ms returned sat
[2021-05-10 20:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 20:37:54] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2021-05-10 20:37:54] [INFO ] Computed and/alt/rep : 1581/3417/1581 causal constraints (skipped 408 transitions) in 122 ms.
[2021-05-10 20:38:00] [INFO ] Added : 251 causal constraints over 51 iterations in 5628 ms. Result :sat
Minimization took 1802 ms.
[2021-05-10 20:38:02] [INFO ] [Real]Absence check using 0 positive and 104 generalized place invariants in 31 ms returned sat
[2021-05-10 20:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 20:38:03] [INFO ] [Real]Absence check using state equation in 1864 ms returned unsat
Current structural bounds on expressions (after SMT) : [51, 51] Max seen :[22, 51]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-06 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 30600 steps, including 99 resets, run finished after 430 ms. (steps per millisecond=71 ) properties (out of 1) seen :51 could not realise parikh vector
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
BK_STOP 1620679087861
--------------------
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-L00050M0005C002P002G001"
export BK_EXAMINATION="UpperBounds"
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 FamilyReunion-COL-L00050M0005C002P002G001, 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 r083-tall-162048875900859"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00050M0005C002P002G001.tgz
mv FamilyReunion-COL-L00050M0005C002P002G001 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 ;