fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r170-tall-167838857100338
Last Updated
May 14, 2023

About the Execution of Marcie+red for FamilyReunion-COL-L00400M0040C020P020G001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16137.592 3600000.00 8618560.00 30433.70 ??F??T??F??????? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857100338.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FamilyReunion-COL-L00400M0040C020P020G001, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857100338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 5.8K Feb 27 00:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 27 00:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 22:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 22:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 27 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 27 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 27 09:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 27 09:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K Mar 5 18:22 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-L00400M0040C020P020G001-CTLFireability-00
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-01
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-02
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-03
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-04
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-05
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-06
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-07
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-08
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-09
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-10
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-11
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-12
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-13
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-14
FORMULA_NAME FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678512397023

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00400M0040C020P020G001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 05:26:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 05:26:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:26:38] [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.
[2023-03-11 05:26:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 05:26:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 755 ms
[2023-03-11 05:26:39] [INFO ] Detected 5 constant HL places corresponding to 106 PT places.
[2023-03-11 05:26:39] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 538109 PT places and 508890.0 transition bindings in 52 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2023-03-11 05:26:39] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 5 ms.
[2023-03-11 05:26:39] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 11 formulas.
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 12 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
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10052 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=372 ) properties (out of 54) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 44) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 40) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 35) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
// Phase 1: matrix 66 rows 99 cols
[2023-03-11 05:26:39] [INFO ] Computed 33 place invariants in 17 ms
[2023-03-11 05:26:40] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-11 05:26:40] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-11 05:26:40] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:31
[2023-03-11 05:26:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-11 05:26:40] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 05:26:40] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :31
[2023-03-11 05:26:40] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :31
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-11 05:26:40] [INFO ] After 750ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :31
Fused 32 Parikh solutions to 30 different solutions.
Finished Parikh walk after 216 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=72 )
Parikh walk visited 31 properties in 345 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-11 05:26:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 05:26:41] [INFO ] Flatten gal took : 36 ms
[2023-03-11 05:26:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00400M0040C020P020G001-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 05:26:41] [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 21
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 11
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
[2023-03-11 05:26:42] [INFO ] Unfolded HLPN to a Petri net with 477829 places and 412249 transitions 1184997 arcs in 1451 ms.
[2023-03-11 05:26:42] [INFO ] Unfolded 13 HLPN properties in 52 ms.
[2023-03-11 05:26:43] [INFO ] Reduced 8020 identical enabling conditions.
[2023-03-11 05:26:43] [INFO ] Reduced 401 identical enabling conditions.
[2023-03-11 05:26:43] [INFO ] Reduced 401 identical enabling conditions.
[2023-03-11 05:26:43] [INFO ] Reduced 16040 identical enabling conditions.
Deduced a syphon composed of 401 places in 1250 ms
Reduce places removed 467 places and 0 transitions.
Support contains 390660 out of 477362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477362/477362 places, 412249/412249 transitions.
Reduce places removed 1289 places and 0 transitions.
Discarding 16441 places :
Implicit places reduction removed 16441 places
Iterating post reduction 0 with 17730 rules applied. Total rules applied 17730 place count 459632 transition count 412249
Applied a total of 17730 rules in 52246 ms. Remains 459632 /477362 variables (removed 17730) and now considering 412249/412249 (removed 0) transitions.
// Phase 1: matrix 412249 rows 459632 cols
[2023-03-11 05:29:54] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-11 05:30:29] [INFO ] Implicit Places using invariants in 155279 ms returned []
Implicit Place search using SMT only with invariants took 155280 ms to find 0 implicit places.
// Phase 1: matrix 412249 rows 459632 cols
[2023-03-11 05:32:29] [WARNING] Invariant computation timed out after 120 seconds.
[2023-03-11 05:33:29] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... after 180219 ms
Starting structural reductions in LTL mode, iteration 1 : 459632/477362 places, 412249/412249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387773 ms. Remains : 459632/477362 places, 412249/412249 transitions.
Support contains 390660 out of 459632 places after structural reductions.
[2023-03-11 05:33:53] [INFO ] Flatten gal took : 15943 ms
[2023-03-11 05:34:33] [INFO ] Flatten gal took : 14865 ms
[2023-03-11 05:35:26] [INFO ] Input system was already deterministic with 412249 transitions.
Interrupted random walk after 1180 steps, including 0 resets, run timeout after 30012 ms. (steps per millisecond=0 ) properties seen 8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1241 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 535 ms. (steps per millisecond=1 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1246 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=3 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=3 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1627 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1654 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=3 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=3 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1224 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1237 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1305 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 665 ms. (steps per millisecond=1 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2873 ms. (steps per millisecond=0 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 362 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Running SMT prover for 60 properties.
// Phase 1: matrix 412249 rows 459632 cols
[2023-03-11 05:38:28] [WARNING] Invariant computation timed out after 120 seconds.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:609)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-11 05:38:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 05:38:54] [INFO ] After 25053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 60 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 307653 out of 459632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 459632/459632 places, 412249/412249 transitions.
Discarding 16441 places :
Implicit places reduction removed 16441 places
Drop transitions removed 16441 transitions
Trivial Post-agglo rules discarded 16441 transitions
Performed 16441 trivial Post agglomeration. Transition count delta: 16441
Iterating post reduction 0 with 32882 rules applied. Total rules applied 32882 place count 443191 transition count 395808
Reduce places removed 16441 places and 0 transitions.
Performed 1924 Post agglomeration using F-continuation condition.
Performed 3840 Post agglomeration using F-continuation condition.
Performed 5686 Post agglomeration using F-continuation condition.
Performed 7462 Post agglomeration using F-continuation condition.
Performed 9295 Post agglomeration using F-continuation condition.
Performed 11157 Post agglomeration using F-continuation condition.
Performed 12996 Post agglomeration using F-continuation condition.
Performed 14716 Post agglomeration using F-continuation condition.
Performed 16119 Post agglomeration using F-continuation condition.
Performed 16441 Post agglomeration using F-continuation condition.Transition count delta: 16441
Iterating post reduction 1 with 32882 rules applied. Total rules applied 65764 place count 426750 transition count 379367
Reduce places removed 16441 places and 0 transitions.
Iterating post reduction 2 with 16441 rules applied. Total rules applied 82205 place count 410309 transition count 379367
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 82205 place count 410309 transition count 378966
Deduced a syphon composed of 401 places in 964 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 83007 place count 409908 transition count 378966
Performed 401 Post agglomeration using F-continuation condition.Transition count delta: 401
Deduced a syphon composed of 401 places in 737 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 83809 place count 409507 transition count 378565
Free-agglomeration rule (complex) applied 16441 times.
Iterating global reduction 3 with 16441 rules applied. Total rules applied 100250 place count 409507 transition count 362124
Reduce places removed 16441 places and 0 transitions.
Iterating post reduction 3 with 16441 rules applied. Total rules applied 116691 place count 393066 transition count 362124
Applied a total of 116691 rules in 826266 ms. Remains 393066 /459632 variables (removed 66566) and now considering 362124/412249 (removed 50125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 826285 ms. Remains : 393066/459632 places, 362124/412249 transitions.
[2023-03-11 05:53:05] [INFO ] Flatten gal took : 15850 ms
[2023-03-11 05:53:48] [INFO ] Flatten gal took : 16571 ms
[2023-03-11 05:54:36] [INFO ] Input system was already deterministic with 412249 transitions.
Computed a total of 459632 stabilizing places and 412249 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 459632 transition count 412249
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 459632/459632 places, 412249/412249 transitions.
Discarding 66967 places :
Implicit places reduction removed 66967 places
Iterating post reduction 0 with 66967 rules applied. Total rules applied 66967 place count 392665 transition count 412249
Applied a total of 66967 rules in 53048 ms. Remains 392665 /459632 variables (removed 66967) and now considering 412249/412249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53064 ms. Remains : 392665/459632 places, 412249/412249 transitions.
[2023-03-11 05:55:53] [INFO ] Flatten gal took : 10316 ms
[2023-03-11 05:56:04] [INFO ] Flatten gal took : 11238 ms
[2023-03-11 05:56:26] [INFO ] Input system was already deterministic with 412249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 459632/459632 places, 412249/412249 transitions.
[2023-03-11 05:56:32] [INFO ] Computed 95844 place invariants in 1717689 ms
Discarding 83408 places :
Implicit places reduction removed 83408 places
Iterating post reduction 0 with 83408 rules applied. Total rules applied 83408 place count 376224 transition count 412249
Applied a total of 83408 rules in 37839 ms. Remains 376224 /459632 variables (removed 83408) and now considering 412249/412249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37849 ms. Remains : 376224/459632 places, 412249/412249 transitions.
[2023-03-11 05:57:15] [INFO ] Flatten gal took : 8778 ms
[2023-03-11 05:57:24] [INFO ] Flatten gal took : 9128 ms
[2023-03-11 05:57:40] [INFO ] Input system was already deterministic with 412249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 459632/459632 places, 412249/412249 transitions.
[2023-03-11 05:58:08] [INFO ] Computed 95844 place invariants in 1659003 ms
Discarding 67368 places :
Implicit places reduction removed 67368 places
Iterating post reduction 0 with 67368 rules applied. Total rules applied 67368 place count 392264 transition count 412249
Applied a total of 67368 rules in 45590 ms. Remains 392264 /459632 variables (removed 67368) and now considering 412249/412249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45601 ms. Remains : 392264/459632 places, 412249/412249 transitions.
[2023-03-11 05:58:37] [INFO ] Flatten gal took : 9263 ms
[2023-03-11 05:58:46] [INFO ] Flatten gal took : 9330 ms
[2023-03-11 05:59:04] [INFO ] Input system was already deterministic with 412249 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 459632/459632 places, 412249/412249 transitions.
Graph (complete) has 679695 edges and 459632 vertex of which 456423 are kept as prefixes of interest. Removing 3209 places using SCC suffix rule.968 ms
Discarding 3209 places :
Also discarding 3208 output transitions
Drop transitions removed 3208 transitions
Reduce places removed 401 places and 401 transitions.
Discarding 83809 places :
Implicit places reduction removed 83809 places
Drop transitions removed 209322 transitions
Trivial Post-agglo rules discarded 209322 transitions
Performed 209322 trivial Post agglomeration. Transition count delta: 209322
Iterating post reduction 0 with 293131 rules applied. Total rules applied 293132 place count 372213 transition count 199318
Reduce places removed 209322 places and 0 transitions.
Iterating post reduction 1 with 209322 rules applied. Total rules applied 502454 place count 162891 transition count 199318
Performed 28872 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28872 Pre rules applied. Total rules applied 502454 place count 162891 transition count 170446
Deduced a syphon composed of 28872 places in 159 ms
Ensure Unique test removed 9624 places
Reduce places removed 38496 places and 0 transitions.
Iterating global reduction 2 with 67368 rules applied. Total rules applied 569822 place count 124395 transition count 170446
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 569822 place count 124395 transition count 170045
Deduced a syphon composed of 401 places in 141 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 570624 place count 123994 transition count 170045
Performed 9223 Post agglomeration using F-continuation condition.Transition count delta: 9223
Deduced a syphon composed of 9223 places in 175 ms
Reduce places removed 9223 places and 0 transitions.
Iterating global reduction 2 with 18446 rules applied. Total rules applied 589070 place count 114771 transition count 160822
Applied a total of 589070 rules in 334594 ms. Remains 114771 /459632 variables (removed 344861) and now considering 160822/412249 (removed 251427) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 334600 ms. Remains : 114771/459632 places, 160822/412249 transitions.
[2023-03-11 06:04:44] [INFO ] Flatten gal took : 3812 ms
[2023-03-11 06:04:48] [INFO ] Flatten gal took : 4283 ms
[2023-03-11 06:04:57] [INFO ] Input system was already deterministic with 160822 transitions.
Starting structural reductions in LTL mode, iteration 0 : 459632/459632 places, 412249/412249 transitions.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Unfolding complete |P|=537708|T|=508489|A|=1558729
Time for unfolding: 0m24.991sec

Net: FamilyReunion_COL_L00400M0040C020P020G001
(NrP: 537708 NrTr: 508489 NrArc: 1558729)

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13455720 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16217868 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
c0_CINFORMI0
c0_CINFORMI1
c0_CINFORMI2
c0_CINFORMI3
c0_CINFORMI4
c0_CINFORMI5
c0_CINFORMI6
c0_CINFORMI7
c0_CINFORMI8
c0_CINFORMI9
c0_CINFORMI10
c0_CINFORMI11
c0_CINFORMI12
c0_CINFORMI13
c0_CINFORMI14
c0_CINFORMI15
c0_CINFORMI16
c0_CINFORMI17
c0_CINFORMI18
c0_CINFORMI19
c0_CINFORMI20
c2_CINFORMI0
c2_CINFORMI1
c2_CINFORMI2
c2_CINFORMI3
c2_CINFORMI4
c2_CINFORMI5
c2_CINFORMI6
c2_CINFORMI7
c2_CINFORMI8
c2_CINFORMI9
c2_CINFORMI10
c2_CINFORMI11
c2_CINFORMI12
c2_CINFORMI13
c2_CINFORMI14
c2_CINFORMI15
c2_CINFORMI16
c2_CINFORMI17
c2_CINFORMI18
c2_CINFORMI19
c2_CINFORMI20
m0_MICSystem0
m0_MICSystem1
m0_MICSystem2
m0_MICSystem3
m0_MICSystem4
m0_MICSystem5
m0_MICSystem6
m0_MICSystem7
m0_MICSystem8
m0_MICSystem9
m0_MICSystem10
m0_MICSystem11
m0_MICSystem12
m0_MICSystem13
m0_MICSystem14
m0_MICSystem15
m0_MICSystem16
m0_MICSystem17
m0_MICSystem18
m0_MICSystem19
m0_MICSystem20
m0_MICSystem21
m0_MICSystem22
m0_MICSystem23
m0_MICSystem24
m0_MICSystem25
m0_MICSystem26
m0_MICSystem27
m0_MICSystem28
m0_MICSystem29
m0_MICSystem30
m0_MICSystem31
m0_MICSystem32
m0_MICSystem33
m0_MICSystem34
m0_MICSystem35
m0_MICSystem36
m0_MICSystem37
m0_MICSystem38
m0_MICSystem39
m0_MICSystem40
p0_PublicAdminOffice0
p0_PublicAdminOffice1
p0_PublicAdminOffice2
p0_PublicAdminOffice3
p0_PublicAdminOffice4
p0_PublicAdminOffice5
p0_PublicAdminOffice6
p0_PublicAdminOffice7
p0_PublicAdminOffice8
p0_PublicAdminOffice9
p0_PublicAdminOffice10
p0_PublicAdminOffice11
p0_PublicAdminOffice12
p0_PublicAdminOffice13
p0_PublicAdminOffice14
p0_PublicAdminOffice15
p0_PublicAdminOffice16
p0_PublicAdminOffice17
p0_PublicAdminOffice18
p0_PublicAdminOffice19
p0_PublicAdminOffice20
r0_Response0
r0_Response1
found 106 constant places

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-L00400M0040C020P020G001"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is FamilyReunion-COL-L00400M0040C020P020G001, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857100338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00400M0040C020P020G001.tgz
mv FamilyReunion-COL-L00400M0040C020P020G001 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;