fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r078-tall-165260110600646
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for FamilyReunion-COL-L00100M0010C005P005G002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16210.880 3600000.00 12159794.00 2385.70 FTTTTTFFFTF?TFFT 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.r078-tall-165260110600646.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 itstools
Input is FamilyReunion-COL-L00100M0010C005P005G002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110600646
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 8.9K Apr 30 09:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 30 09:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 30 09:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 09:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 11:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 30 11:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 30 10:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 30 10:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:48 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 140K 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654190675677

Running Version 202205111006
[2022-06-02 17:24:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 17:24:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 17:24:36] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-06-02 17:24:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-06-02 17:24:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 647 ms
[2022-06-02 17:24:37] [INFO ] Detected 5 constant HL places corresponding to 31 PT places.
[2022-06-02 17:24:37] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 40706 PT places and 36972.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-02 17:24:37] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 8 ms.
[2022-06-02 17:24:37] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
[2022-06-02 17:24:37] [INFO ] Flatten gal took : 49 ms
[2022-06-02 17:24:37] [INFO ] Flatten gal took : 8 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 6
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 3
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
[2022-06-02 17:24:37] [INFO ] Unfolded HLPN to a Petri net with 37039 places and 31114 transitions 89397 arcs in 178 ms.
[2022-06-02 17:24:37] [INFO ] Unfolded 15 HLPN properties in 10 ms.
Deduced a syphon composed of 101 places in 160 ms
Reduce places removed 122 places and 0 transitions.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1777 ms. (steps per millisecond=5 ) properties (out of 14) seen :4
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2453 ms. (steps per millisecond=4 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 847 ms. (steps per millisecond=11 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4291 ms. (steps per millisecond=2 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1633 ms. (steps per millisecond=6 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1069 ms. (steps per millisecond=9 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 31114 rows 36917 cols
[2022-06-02 17:24:58] [INFO ] Computed 8803 place invariants in 6105 ms
[2022-06-02 17:25:09] [INFO ] After 11112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-02 17:25:20] [INFO ] [Nat]Absence check using 108 positive place invariants in 272 ms returned sat
[2022-06-02 17:25:31] [INFO ] [Nat]Absence check using 108 positive and 8695 generalized place invariants in 11042 ms returned sat
[2022-06-02 17:25:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 17:25:34] [INFO ] After 25115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 26288 out of 36917 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 36917/36917 places, 31114/31114 transitions.
Graph (complete) has 56168 edges and 36917 vertex of which 36792 are kept as prefixes of interest. Removing 125 places using SCC suffix rule.74 ms
Discarding 125 places :
Also discarding 0 output transitions
Discarding 1313 places :
Implicit places reduction removed 1313 places
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 0 with 1414 rules applied. Total rules applied 1415 place count 35479 transition count 31013
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 1516 place count 35378 transition count 31013
Discarding 505 places :
Symmetric choice reduction at 2 with 505 rule applications. Total rules 2021 place count 34873 transition count 30508
Iterating global reduction 2 with 505 rules applied. Total rules applied 2526 place count 34873 transition count 30508
Applied a total of 2526 rules in 5608 ms. Remains 34873 /36917 variables (removed 2044) and now considering 30508/31114 (removed 606) transitions.
Finished structural reductions, in 1 iterations. Remains : 34873/36917 places, 30508/31114 transitions.
Interrupted random walk after 398886 steps, including 69 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 1
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 28918 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=5 ) properties seen 0
Interrupted Best-First random walk after 83678 steps, including 0 resets, run timeout after 5005 ms. (steps per millisecond=16 ) properties seen 1
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 43614 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=8 ) properties seen 0
Running SMT prover for 2 properties.
// Phase 1: matrix 30508 rows 34873 cols
[2022-06-02 17:26:30] [INFO ] Computed 7380 place invariants in 5201 ms
[2022-06-02 17:26:36] [INFO ] After 5825ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 17:26:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 47 ms returned sat
[2022-06-02 17:26:50] [INFO ] [Nat]Absence check using 10 positive and 7370 generalized place invariants in 8020 ms returned sat
[2022-06-02 17:29:13] [INFO ] After 138706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 17:29:22] [INFO ] After 148075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2431 ms.
[2022-06-02 17:29:25] [INFO ] After 168685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15316 ms.
Support contains 10120 out of 34873 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 34873/34873 places, 30508/30508 transitions.
Graph (complete) has 50399 edges and 34873 vertex of which 34766 are kept as prefixes of interest. Removing 107 places using SCC suffix rule.17 ms
Discarding 107 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Discarding 4545 places :
Implicit places reduction removed 4545 places
Drop transitions removed 7272 transitions
Trivial Post-agglo rules discarded 7272 transitions
Performed 7272 trivial Post agglomeration. Transition count delta: 7272
Iterating post reduction 0 with 11817 rules applied. Total rules applied 11818 place count 30221 transition count 23230
Reduce places removed 7272 places and 0 transitions.
Performed 1414 Post agglomeration using F-continuation condition.Transition count delta: 1414
Iterating post reduction 1 with 8686 rules applied. Total rules applied 20504 place count 22949 transition count 21816
Reduce places removed 1414 places and 0 transitions.
Iterating post reduction 2 with 1414 rules applied. Total rules applied 21918 place count 21535 transition count 21816
Performed 1717 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1717 Pre rules applied. Total rules applied 21918 place count 21535 transition count 20099
Deduced a syphon composed of 1717 places in 32 ms
Reduce places removed 1717 places and 0 transitions.
Iterating global reduction 3 with 3434 rules applied. Total rules applied 25352 place count 19818 transition count 20099
Discarding 606 places :
Implicit places reduction removed 606 places
Iterating post reduction 3 with 606 rules applied. Total rules applied 25958 place count 19212 transition count 20099
Discarding 1010 places :
Symmetric choice reduction at 4 with 1010 rule applications. Total rules 26968 place count 18202 transition count 19089
Iterating global reduction 4 with 1010 rules applied. Total rules applied 27978 place count 18202 transition count 19089
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 13 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 28180 place count 18101 transition count 18988
Applied a total of 28180 rules in 8065 ms. Remains 18101 /34873 variables (removed 16772) and now considering 18988/30508 (removed 11520) transitions.
Finished structural reductions, in 1 iterations. Remains : 18101/34873 places, 18988/30508 transitions.
Interrupted random walk after 730269 steps, including 189 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 1
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 28958 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=5 ) properties seen 0
Running SMT prover for 1 properties.
// Phase 1: matrix 18988 rows 18101 cols
[2022-06-02 17:30:24] [INFO ] Computed 2128 place invariants in 1095 ms
[2022-06-02 17:30:27] [INFO ] After 1985ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 17:30:30] [INFO ] [Nat]Absence check using 0 positive and 2128 generalized place invariants in 1309 ms returned sat
[2022-06-02 17:31:11] [INFO ] After 43908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 7880 out of 18101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 18101/18101 places, 18988/18988 transitions.
Graph (complete) has 27978 edges and 18101 vertex of which 18100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1919 transitions
Trivial Post-agglo rules discarded 1919 transitions
Performed 1919 trivial Post agglomeration. Transition count delta: 1919
Iterating post reduction 0 with 1919 rules applied. Total rules applied 1920 place count 18100 transition count 17069
Reduce places removed 1919 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 1 with 2020 rules applied. Total rules applied 3940 place count 16181 transition count 16968
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 4041 place count 16080 transition count 16968
Performed 808 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 808 Pre rules applied. Total rules applied 4041 place count 16080 transition count 16160
Deduced a syphon composed of 808 places in 10 ms
Ensure Unique test removed 202 places
Reduce places removed 1010 places and 0 transitions.
Iterating global reduction 3 with 1818 rules applied. Total rules applied 5859 place count 15070 transition count 16160
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 3 with 101 rules applied. Total rules applied 5960 place count 14969 transition count 16160
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 5965 place count 14964 transition count 15655
Iterating global reduction 4 with 5 rules applied. Total rules applied 5970 place count 14964 transition count 15655
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 4 with 101 rules applied. Total rules applied 6071 place count 14863 transition count 15655
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 6273 place count 14762 transition count 15554
Free-agglomeration rule (complex) applied 1212 times.
Iterating global reduction 5 with 1212 rules applied. Total rules applied 7485 place count 14762 transition count 14342
Reduce places removed 1212 places and 0 transitions.
Iterating post reduction 5 with 1212 rules applied. Total rules applied 8697 place count 13550 transition count 14342
Applied a total of 8697 rules in 5425 ms. Remains 13550 /18101 variables (removed 4551) and now considering 14342/18988 (removed 4646) transitions.
Finished structural reductions, in 1 iterations. Remains : 13550/18101 places, 14342/18988 transitions.
Incomplete random walk after 1000000 steps, including 363 resets, run finished after 21141 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 28486 steps, including 0 resets, run timeout after 5013 ms. (steps per millisecond=5 ) properties seen 0
Interrupted probabilistic random walk after 1727394 steps, run timeout after 78001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 1727394 steps, saw 623007 distinct states, run finished after 78002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14342 rows 13550 cols
[2022-06-02 17:33:01] [INFO ] Computed 1723 place invariants in 637 ms
[2022-06-02 17:33:04] [INFO ] After 1499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 17:33:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 139 ms returned sat
[2022-06-02 17:33:06] [INFO ] [Nat]Absence check using 3 positive and 1720 generalized place invariants in 830 ms returned sat
[2022-06-02 17:33:48] [INFO ] After 43964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 7880 out of 13550 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13550/13550 places, 14342/14342 transitions.
Applied a total of 0 rules in 781 ms. Remains 13550 /13550 variables (removed 0) and now considering 14342/14342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 13550/13550 places, 14342/14342 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 13550/13550 places, 14342/14342 transitions.
Applied a total of 0 rules in 735 ms. Remains 13550 /13550 variables (removed 0) and now considering 14342/14342 (removed 0) transitions.
// Phase 1: matrix 14342 rows 13550 cols
[2022-06-02 17:33:50] [INFO ] Computed 1723 place invariants in 625 ms
[2022-06-02 17:33:51] [INFO ] Implicit Places using invariants in 1774 ms returned []
Implicit Place search using SMT only with invariants took 1781 ms to find 0 implicit places.
// Phase 1: matrix 14342 rows 13550 cols
[2022-06-02 17:33:52] [INFO ] Computed 1723 place invariants in 634 ms
[2022-06-02 17:33:53] [INFO ] Dead Transitions using invariants and state equation in 1741 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 13550/13550 places, 14342/14342 transitions.
Incomplete random walk after 1000000 steps, including 363 resets, run finished after 21674 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 28666 steps, including 0 resets, run timeout after 5038 ms. (steps per millisecond=5 ) properties seen 0
Interrupted probabilistic random walk after 1684917 steps, run timeout after 78001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 1684917 steps, saw 613059 distinct states, run finished after 78001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14342 rows 13550 cols
[2022-06-02 17:35:38] [INFO ] Computed 1723 place invariants in 672 ms
[2022-06-02 17:35:41] [INFO ] After 1513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 17:35:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 129 ms returned sat
[2022-06-02 17:35:43] [INFO ] [Nat]Absence check using 3 positive and 1720 generalized place invariants in 838 ms returned sat
[2022-06-02 17:36:22] [INFO ] After 41219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 7880 out of 13550 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13550/13550 places, 14342/14342 transitions.
Applied a total of 0 rules in 739 ms. Remains 13550 /13550 variables (removed 0) and now considering 14342/14342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 13550/13550 places, 14342/14342 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 13550/13550 places, 14342/14342 transitions.
Applied a total of 0 rules in 721 ms. Remains 13550 /13550 variables (removed 0) and now considering 14342/14342 (removed 0) transitions.
// Phase 1: matrix 14342 rows 13550 cols
[2022-06-02 17:36:24] [INFO ] Computed 1723 place invariants in 650 ms
[2022-06-02 17:36:25] [INFO ] Implicit Places using invariants in 1742 ms returned []
Implicit Place search using SMT only with invariants took 1745 ms to find 0 implicit places.
// Phase 1: matrix 14342 rows 13550 cols
[2022-06-02 17:36:26] [INFO ] Computed 1723 place invariants in 610 ms
[2022-06-02 17:36:27] [INFO ] Dead Transitions using invariants and state equation in 1711 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 13550/13550 places, 14342/14342 transitions.
Applied a total of 0 rules in 655 ms. Remains 13550 /13550 variables (removed 0) and now considering 14342/14342 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 14342 rows 13550 cols
[2022-06-02 17:36:28] [INFO ] Computed 1723 place invariants in 612 ms
[2022-06-02 17:36:30] [INFO ] After 1365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 17:36:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 132 ms returned sat
[2022-06-02 17:36:32] [INFO ] [Nat]Absence check using 3 positive and 1720 generalized place invariants in 811 ms returned sat
[2022-06-02 17:37:16] [INFO ] After 45609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-06-02 17:37:16] [INFO ] Flatten gal took : 646 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8190165312325065141
[2022-06-02 17:37:17] [INFO ] Too many transitions (14342) to apply POR reductions. Disabling POR matrices.
[2022-06-02 17:37:17] [INFO ] Applying decomposition
[2022-06-02 17:37:18] [INFO ] Built C files in 715ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8190165312325065141
Running compilation step : cd /tmp/ltsmin8190165312325065141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-02 17:37:18] [INFO ] Flatten gal took : 794 ms
[2022-06-02 17:37:18] [INFO ] Flatten gal took : 770 ms
[2022-06-02 17:37:19] [INFO ] Input system was already deterministic with 14342 transitions.
[2022-06-02 17:37:27] [INFO ] Ran tautology test, simplified 0 / 1 in 9686 ms.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2900891263211116383.txt' '-o' '/tmp/graph2900891263211116383.bin' '-w' '/tmp/graph2900891263211116383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2900891263211116383.bin' '-l' '-1' '-v' '-w' '/tmp/graph2900891263211116383.weights' '-q' '0' '-e' '0.001'
[2022-06-02 17:37:29] [INFO ] Decomposing Gal with order
[2022-06-02 17:37:29] [INFO ] BMC solution for property FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-11(UNSAT) depth K=0 took 500 ms
[2022-06-02 17:37:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 17:37:33] [INFO ] BMC solution for property FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-11(UNSAT) depth K=1 took 2609 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 14342 rows 13550 cols
[2022-06-02 17:37:38] [INFO ] Computed 1723 place invariants in 940 ms
[2022-06-02 17:37:38] [INFO ] Computed 1723 place invariants in 959 ms
[2022-06-02 17:37:56] [INFO ] Removed a total of 4054 redundant transitions.
[2022-06-02 17:37:58] [INFO ] Flatten gal took : 26053 ms
[2022-06-02 17:38:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4804 labels/synchronizations in 1993 ms.
[2022-06-02 17:38:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14408137854524934705.gal : 264 ms
[2022-06-02 17:38:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16047169495169464270.prop : 108 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14408137854524934705.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16047169495169464270.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16047169495169464270.prop.
[2022-06-02 17:39:19] [INFO ] Proved 13550 variables to be positive in 101864 ms
Compilation finished in 174734 ms.
Running link step : cd /tmp/ltsmin8190165312325065141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 119 ms.
Running LTSmin : cd /tmp/ltsmin8190165312325065141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'FamilyReunionCOLL00100M0010C005P005G002ReachabilityCardinality11==true'
[2022-06-02 17:43:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesFamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-11
[2022-06-02 17:43:30] [INFO ] KInduction solution for property FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-11(SAT) depth K=0 took 251579 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 11
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :11 after 13
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :13 after 169
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :169 after 5070
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5070 after 5746
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5746 after 12844
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :12844 after 15548
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :15548 after 39208
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :39208 after 307580
Detected timeout of ITS tools.
[2022-06-02 18:02:19] [INFO ] Applying decomposition
[2022-06-02 18:02:20] [INFO ] Flatten gal took : 1270 ms
[2022-06-02 18:02:21] [INFO ] Decomposing Gal with order
[2022-06-02 18:02:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 18:02:42] [INFO ] Removed a total of 9666 redundant transitions.
[2022-06-02 18:02:43] [INFO ] Flatten gal took : 2041 ms
[2022-06-02 18:02:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 141 ms.
[2022-06-02 18:02:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15574762134312653913.gal : 248 ms
[2022-06-02 18:02:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16244007526345953214.prop : 26 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15574762134312653913.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16244007526345953214.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16244007526345953214.prop.
[2022-06-02 18:06:07] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 18:06:10] [WARNING] Unexpected error occurred while running SMT. Was verifying FamilyReunion-COL-L00100M0010C005P005G002-ReachabilityCardinality-11 K-induction depth 1
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 260
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :260 after 52728
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :52728 after 6.85464e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.85464e+06 after 1.06818e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.06818e+07 after 1.30238e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.30238e+07 after 3.11886e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.11886e+07 after 5.12384e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.12384e+07 after 2.00498e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.00498e+08 after 3.02975e+08

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-L00100M0010C005P005G002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00100M0010C005P005G002, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110600646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00100M0010C005P005G002.tgz
mv FamilyReunion-COL-L00100M0010C005P005G002 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;