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-165260110600654.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-L00200M0020C010P010G005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110600654
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.7K Apr 30 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 30 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 10:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 10:52 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.8K 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.1K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 30 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 30 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 30 15:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 30 15:51 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 146K 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-L00200M0020C010P010G005-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654190790788

Running Version 202205111006
[2022-06-02 17:26:31] [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:26:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 17:26:32] [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:26:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-06-02 17:26:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 707 ms
[2022-06-02 17:26:32] [INFO ] Detected 5 constant HL places corresponding to 56 PT places.
[2022-06-02 17:26:32] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 144109 PT places and 134480.0 transition bindings in 40 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2022-06-02 17:26:32] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 8 ms.
[2022-06-02 17:26:32] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 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:26:32] [INFO ] Flatten gal took : 27 ms
[2022-06-02 17:26:32] [INFO ] Flatten gal took : 9 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 11
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 6
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:26:33] [INFO ] Unfolded HLPN to a Petri net with 128969 places and 110159 transitions 316597 arcs in 543 ms.
[2022-06-02 17:26:33] [INFO ] Unfolded 16 HLPN properties in 11 ms.
Deduced a syphon composed of 201 places in 346 ms
Reduce places removed 237 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6697 ms. (steps per millisecond=1 ) properties (out of 16) seen :6
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 10) seen :0
Interrupted Best-First random walk after 5545 steps, including 1 resets, run timeout after 5266 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 9894 steps, including 2 resets, run timeout after 5122 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 7940 steps, including 2 resets, run timeout after 5051 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 7620 steps, including 2 resets, run timeout after 5139 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 10 properties.
// Phase 1: matrix 110159 rows 128732 cols
[2022-06-02 17:29:04] [WARNING] Invariant computation timed out after 120 seconds.
[2022-06-02 17:29:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 17:29:30] [INFO ] After 25254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 75857 out of 128732 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 128732/128732 places, 110159/110159 transitions.
Graph (complete) has 198208 edges and 128732 vertex of which 128519 are kept as prefixes of interest. Removing 213 places using SCC suffix rule.175 ms
Discarding 213 places :
Also discarding 0 output transitions
[2022-06-02 17:29:38] [INFO ] Computed 30573 place invariants in 154011 ms
Discarding 17085 places :
Implicit places reduction removed 17085 places
Performed 4221 Post agglomeration using F-continuation condition.Transition count delta: 4221
Iterating post reduction 0 with 21306 rules applied. Total rules applied 21307 place count 111434 transition count 105938
Reduce places removed 4221 places and 0 transitions.
Iterating post reduction 1 with 4221 rules applied. Total rules applied 25528 place count 107213 transition count 105938
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 402 Pre rules applied. Total rules applied 25528 place count 107213 transition count 105536
Deduced a syphon composed of 402 places in 179 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 2 with 804 rules applied. Total rules applied 26332 place count 106811 transition count 105536
Applied a total of 26332 rules in 24578 ms. Remains 106811 /128732 variables (removed 21921) and now considering 105536/110159 (removed 4623) transitions.
Finished structural reductions, in 1 iterations. Remains : 106811/128732 places, 105536/110159 transitions.
Interrupted random walk after 89294 steps, including 8 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen 4
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 447788 steps, including 1 resets, run timeout after 5004 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 761372 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=152 ) properties seen 0
Interrupted Best-First random walk after 316912 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=63 ) properties seen 0
Interrupted Best-First random walk after 93838 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=18 ) properties seen 0
Interrupted Best-First random walk after 5760 steps, including 0 resets, run timeout after 5185 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 7752 steps, including 0 resets, run timeout after 5067 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 6 properties.
// Phase 1: matrix 105536 rows 106811 cols
[2022-06-02 17:31:41] [INFO ] Computed 13275 place invariants in 45619 ms
[2022-06-02 17:32:21] [INFO ] After 40717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-02 17:33:02] [INFO ] [Nat]Absence check using 601 positive place invariants in 3079 ms returned sat
[2022-06-02 17:33:48] [INFO ] [Nat]Absence check using 601 positive and 12674 generalized place invariants in 46075 ms returned sat
[2022-06-02 17:34:32] [INFO ] After 37376ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2022-06-02 17:36:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 17:36:42] [INFO ] After 260746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30955 out of 106811 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 106811/106811 places, 105536/105536 transitions.
Graph (complete) has 159002 edges and 106811 vertex of which 106364 are kept as prefixes of interest. Removing 447 places using SCC suffix rule.65 ms
Discarding 447 places :
Also discarding 212 output transitions
Drop transitions removed 212 transitions
Discarding 4623 places :
Implicit places reduction removed 4623 places
Drop transitions removed 8643 transitions
Trivial Post-agglo rules discarded 8643 transitions
Performed 8643 trivial Post agglomeration. Transition count delta: 8643
Iterating post reduction 0 with 13266 rules applied. Total rules applied 13267 place count 101741 transition count 96681
Reduce places removed 8643 places and 0 transitions.
Performed 19698 Post agglomeration using F-continuation condition.Transition count delta: 19698
Iterating post reduction 1 with 28341 rules applied. Total rules applied 41608 place count 93098 transition count 76983
Reduce places removed 19698 places and 0 transitions.
Iterating post reduction 2 with 19698 rules applied. Total rules applied 61306 place count 73400 transition count 76983
Performed 3216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3216 Pre rules applied. Total rules applied 61306 place count 73400 transition count 73767
Deduced a syphon composed of 3216 places in 57 ms
Reduce places removed 3216 places and 0 transitions.
Iterating global reduction 3 with 6432 rules applied. Total rules applied 67738 place count 70184 transition count 73767
Discarding 2412 places :
Implicit places reduction removed 2412 places
Iterating post reduction 3 with 2412 rules applied. Total rules applied 70150 place count 67772 transition count 73767
Performed 5025 Post agglomeration using F-continuation condition.Transition count delta: 5025
Deduced a syphon composed of 5025 places in 128 ms
Reduce places removed 5025 places and 0 transitions.
Iterating global reduction 4 with 10050 rules applied. Total rules applied 80200 place count 62747 transition count 68742
Free-agglomeration rule (complex) applied 1005 times.
Iterating global reduction 4 with 1005 rules applied. Total rules applied 81205 place count 62747 transition count 67737
Ensure Unique test removed 201 places
Reduce places removed 1206 places and 0 transitions.
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 4 with 1407 rules applied. Total rules applied 82612 place count 61541 transition count 67536
Applied a total of 82612 rules in 55775 ms. Remains 61541 /106811 variables (removed 45270) and now considering 67536/105536 (removed 38000) transitions.
Finished structural reductions, in 1 iterations. Remains : 61541/106811 places, 67536/105536 transitions.
Interrupted random walk after 136467 steps, including 19 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen 0
Interrupted Best-First random walk after 99550 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=19 ) properties seen 0
Interrupted Best-First random walk after 8223 steps, including 0 resets, run timeout after 5476 ms. (steps per millisecond=1 ) properties seen 0
Interrupted probabilistic random walk after 563138 steps, run timeout after 120061 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 563138 steps, saw 562880 distinct states, run finished after 120063 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 67536 rows 61541 cols
[2022-06-02 17:40:26] [INFO ] Computed 6035 place invariants in 7494 ms
[2022-06-02 17:40:41] [INFO ] [Real]Absence check using 601 positive place invariants in 1689 ms returned sat
[2022-06-02 17:40:51] [INFO ] [Real]Absence check using 601 positive and 5434 generalized place invariants in 9829 ms returned sat
[2022-06-02 17:40:52] [INFO ] After 25822ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 17:41:07] [INFO ] [Nat]Absence check using 601 positive place invariants in 1844 ms returned sat
[2022-06-02 17:41:18] [INFO ] [Nat]Absence check using 601 positive and 5434 generalized place invariants in 10411 ms returned sat
[2022-06-02 17:41:38] [INFO ] After 18542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 17:41:58] [INFO ] After 38485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3732 ms.
[2022-06-02 17:42:02] [INFO ] After 70097ms 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 64 ms.
Support contains 30955 out of 61541 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61541/61541 places, 67536/67536 transitions.
Applied a total of 0 rules in 560 ms. Remains 61541 /61541 variables (removed 0) and now considering 67536/67536 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61541/61541 places, 67536/67536 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61541/61541 places, 67536/67536 transitions.
Applied a total of 0 rules in 583 ms. Remains 61541 /61541 variables (removed 0) and now considering 67536/67536 (removed 0) transitions.
// Phase 1: matrix 67536 rows 61541 cols
[2022-06-02 17:42:12] [INFO ] Computed 6035 place invariants in 8441 ms
[2022-06-02 17:42:16] [INFO ] Implicit Places using invariants in 13244 ms returned []
Implicit Place search using SMT only with invariants took 13245 ms to find 0 implicit places.
// Phase 1: matrix 67536 rows 61541 cols
[2022-06-02 17:42:24] [INFO ] Computed 6035 place invariants in 7430 ms
[2022-06-02 17:42:29] [INFO ] Dead Transitions using invariants and state equation in 12187 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61541/61541 places, 67536/67536 transitions.
Interrupted random walk after 134129 steps, including 19 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen 0
Interrupted Best-First random walk after 95808 steps, including 0 resets, run timeout after 5020 ms. (steps per millisecond=19 ) properties seen 0
Interrupted Best-First random walk after 7223 steps, including 0 resets, run timeout after 5006 ms. (steps per millisecond=1 ) properties seen 0
Interrupted probabilistic random walk after 557418 steps, run timeout after 120113 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 557418 steps, saw 557170 distinct states, run finished after 120113 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 67536 rows 61541 cols
[2022-06-02 17:45:17] [INFO ] Computed 6035 place invariants in 7879 ms
[2022-06-02 17:45:33] [INFO ] [Real]Absence check using 601 positive place invariants in 1868 ms returned sat
[2022-06-02 17:45:44] [INFO ] [Real]Absence check using 601 positive and 5434 generalized place invariants in 10843 ms returned sat
[2022-06-02 17:45:45] [INFO ] After 27809ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 17:46:00] [INFO ] [Nat]Absence check using 601 positive place invariants in 1788 ms returned sat
[2022-06-02 17:46:11] [INFO ] [Nat]Absence check using 601 positive and 5434 generalized place invariants in 10509 ms returned sat
[2022-06-02 17:46:31] [INFO ] After 17940ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 17:46:49] [INFO ] After 36799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3596 ms.
[2022-06-02 17:46:53] [INFO ] After 68438ms 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 45 ms.
Support contains 30955 out of 61541 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61541/61541 places, 67536/67536 transitions.
Applied a total of 0 rules in 536 ms. Remains 61541 /61541 variables (removed 0) and now considering 67536/67536 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61541/61541 places, 67536/67536 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 61541/61541 places, 67536/67536 transitions.
Applied a total of 0 rules in 541 ms. Remains 61541 /61541 variables (removed 0) and now considering 67536/67536 (removed 0) transitions.
// Phase 1: matrix 67536 rows 61541 cols
[2022-06-02 17:47:04] [INFO ] Computed 6035 place invariants in 9599 ms
[2022-06-02 17:47:08] [INFO ] Implicit Places using invariants in 14261 ms returned []
Implicit Place search using SMT only with invariants took 14272 ms to find 0 implicit places.
// Phase 1: matrix 67536 rows 61541 cols
[2022-06-02 17:47:18] [INFO ] Computed 6035 place invariants in 9720 ms
[2022-06-02 17:47:23] [INFO ] Dead Transitions using invariants and state equation in 14396 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61541/61541 places, 67536/67536 transitions.
Applied a total of 0 rules in 540 ms. Remains 61541 /61541 variables (removed 0) and now considering 67536/67536 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 67536 rows 61541 cols
[2022-06-02 17:47:32] [INFO ] Computed 6035 place invariants in 8173 ms
[2022-06-02 17:47:47] [INFO ] [Real]Absence check using 601 positive place invariants in 1755 ms returned sat
[2022-06-02 17:47:57] [INFO ] [Real]Absence check using 601 positive and 5434 generalized place invariants in 10223 ms returned sat
[2022-06-02 17:47:58] [INFO ] After 26448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 17:48:14] [INFO ] [Nat]Absence check using 601 positive place invariants in 1914 ms returned sat
[2022-06-02 17:48:26] [INFO ] [Nat]Absence check using 601 positive and 5434 generalized place invariants in 11803 ms returned sat
[2022-06-02 17:48:46] [INFO ] After 18675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 17:49:06] [INFO ] After 38749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3712 ms.
[2022-06-02 17:49:10] [INFO ] After 71753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-02 17:49:13] [INFO ] Flatten gal took : 2347 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13165137653565807893
[2022-06-02 17:49:15] [INFO ] Too many transitions (67536) to apply POR reductions. Disabling POR matrices.
[2022-06-02 17:49:16] [INFO ] Built C files in 1138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13165137653565807893
Running compilation step : cd /tmp/ltsmin13165137653565807893;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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:49:17] [INFO ] Applying decomposition
[2022-06-02 17:49:18] [INFO ] Flatten gal took : 3702 ms
[2022-06-02 17:49:20] [INFO ] Flatten gal took : 2651 ms
[2022-06-02 17:49:21] [INFO ] Input system was already deterministic with 67536 transitions.
[2022-06-02 17:50:09] [INFO ] Ran tautology test, simplified 0 / 2 in 50175 ms.
[2022-06-02 17:50:13] [INFO ] BMC solution for property FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-10(UNSAT) depth K=0 took 2141 ms
[2022-06-02 17:50:14] [INFO ] BMC solution for property FamilyReunion-COL-L00200M0020C010P010G005-ReachabilityCardinality-15(UNSAT) depth K=0 took 469 ms
[2022-06-02 17:50:17] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9660834051691432588.txt' '-o' '/tmp/graph9660834051691432588.bin' '-w' '/tmp/graph9660834051691432588.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:98)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:957)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-02 17:50:20] [INFO ] Flatten gal took : 2741 ms
java.io.IOException: Stream Closed
at java.base/java.io.FileOutputStream.writeBytes(Native Method)
at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354)
at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81)
at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142)
at fr.lip6.move.serialization.SerializationUtil.systemToFile(SerializationUtil.java:98)
at fr.lip6.move.gal.application.runner.its.ITSRunner.outputGalFile(ITSRunner.java:406)
at fr.lip6.move.gal.application.runner.its.ITSRunner.configure(ITSRunner.java:113)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.startRunner(MultiOrderRunner.java:153)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:104)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:957)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-02 17:50:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11387016528667544496.gal : 406 ms
Application raised an uncaught exception Stream Closed
java.io.IOException: Stream Closed
at java.base/java.io.FileOutputStream.writeBytes(Native Method)
at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354)
at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81)
at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142)
at fr.lip6.move.serialization.SerializationUtil.serializePropertiesForITSTools(SerializationUtil.java:164)
at fr.lip6.move.gal.application.runner.its.ITSRunner.outputPropertyFile(ITSRunner.java:351)
at fr.lip6.move.gal.application.runner.its.ITSRunner.configure(ITSRunner.java:118)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.startRunner(MultiOrderRunner.java:153)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:104)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:957)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Total runtime 1429485 ms.

BK_STOP 1654192221827

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-L00200M0020C010P010G005"
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-L00200M0020C010P010G005, 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-165260110600654"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00200M0020C010P010G005.tgz
mv FamilyReunion-COL-L00200M0020C010P010G005 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 ;