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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.2K Feb 26 12:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 12:04 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 3.9K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:05 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 137K 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-L00050M0005C002P002G001-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678504845020

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00050M0005C002P002G001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 03:20:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:20:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:20:46] [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 03:20:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 03:20:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 706 ms
[2023-03-11 03:20:47] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2023-03-11 03:20:47] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 03:20:47] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 5 ms.
[2023-03-11 03:20:47] [INFO ] Skeletonized 16 HLPN properties in 2 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
[2023-03-11 03:20:47] [INFO ] Flatten gal took : 23 ms
[2023-03-11 03:20:47] [INFO ] Flatten gal took : 15 ms
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-03 TRUE TECHNIQUES CPN_APPROX
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 3
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 :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
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 2
[2023-03-11 03:20:47] [INFO ] Unfolded HLPN to a Petri net with 11467 places and 9336 transitions 26832 arcs in 83 ms.
[2023-03-11 03:20:47] [INFO ] Unfolded 16 HLPN properties in 3 ms.
Deduced a syphon composed of 51 places in 62 ms
Reduce places removed 64 places and 0 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 932 ms. (steps per millisecond=10 ) properties (out of 15) seen :4
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 797 ms. (steps per millisecond=12 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 805 ms. (steps per millisecond=12 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 9336 rows 11403 cols
[2023-03-11 03:20:52] [INFO ] Computed 2767 place invariants in 603 ms
[2023-03-11 03:20:58] [INFO ] [Real]Absence check using 59 positive place invariants in 80 ms returned sat
[2023-03-11 03:20:59] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1575 ms returned sat
[2023-03-11 03:21:00] [INFO ] After 5010ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 03:21:02] [INFO ] [Nat]Absence check using 59 positive place invariants in 92 ms returned sat
[2023-03-11 03:21:04] [INFO ] [Nat]Absence check using 59 positive and 2708 generalized place invariants in 1484 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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.Application.startNoEx(Application.java:902)
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 03:21:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:21:25] [INFO ] After 25136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5618 out of 11403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11403/11403 places, 9336/9336 transitions.
Graph (complete) has 16989 edges and 11403 vertex of which 11284 are kept as prefixes of interest. Removing 119 places using SCC suffix rule.21 ms
Discarding 119 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Discarding 663 places :
Implicit places reduction removed 663 places
Performed 714 Post agglomeration using F-continuation condition.Transition count delta: 714
Iterating post reduction 0 with 1377 rules applied. Total rules applied 1378 place count 10621 transition count 8619
Reduce places removed 714 places and 0 transitions.
Iterating post reduction 1 with 714 rules applied. Total rules applied 2092 place count 9907 transition count 8619
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 255 Pre rules applied. Total rules applied 2092 place count 9907 transition count 8364
Deduced a syphon composed of 255 places in 9 ms
Ensure Unique test removed 51 places
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 2 with 561 rules applied. Total rules applied 2653 place count 9601 transition count 8364
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2908 place count 9346 transition count 8109
Iterating global reduction 2 with 255 rules applied. Total rules applied 3163 place count 9346 transition count 8109
Applied a total of 3163 rules in 1677 ms. Remains 9346 /11403 variables (removed 2057) and now considering 8109/9336 (removed 1227) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1678 ms. Remains : 9346/11403 places, 8109/9336 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 788 ms. (steps per millisecond=12 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 70910 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70910 steps, saw 68914 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 8109 rows 9346 cols
[2023-03-11 03:21:32] [INFO ] Computed 1944 place invariants in 275 ms
[2023-03-11 03:21:34] [INFO ] [Real]Absence check using 3 positive place invariants in 70 ms returned sat
[2023-03-11 03:21:34] [INFO ] [Real]Absence check using 3 positive and 1941 generalized place invariants in 742 ms returned sat
[2023-03-11 03:21:35] [INFO ] After 2257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:21:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 62 ms returned sat
[2023-03-11 03:21:37] [INFO ] [Nat]Absence check using 3 positive and 1941 generalized place invariants in 718 ms returned sat
[2023-03-11 03:22:00] [INFO ] After 22498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:22:00] [INFO ] After 22514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 03:22:00] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 3 different solutions.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 151 ms.
Support contains 3525 out of 9346 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9346/9346 places, 8109/8109 transitions.
Graph (complete) has 13515 edges and 9346 vertex of which 9345 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 9345 transition count 8058
Reduce places removed 51 places and 0 transitions.
Performed 969 Post agglomeration using F-continuation condition.Transition count delta: 969
Iterating post reduction 1 with 1020 rules applied. Total rules applied 1072 place count 9294 transition count 7089
Reduce places removed 969 places and 0 transitions.
Iterating post reduction 2 with 969 rules applied. Total rules applied 2041 place count 8325 transition count 7089
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 2041 place count 8325 transition count 6987
Deduced a syphon composed of 102 places in 5 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 2296 place count 8172 transition count 6987
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 4 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 2602 place count 8019 transition count 6834
Free-agglomeration rule (complex) applied 51 times.
Iterating global reduction 3 with 51 rules applied. Total rules applied 2653 place count 8019 transition count 6783
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 2704 place count 7968 transition count 6783
Applied a total of 2704 rules in 2052 ms. Remains 7968 /9346 variables (removed 1378) and now considering 6783/8109 (removed 1326) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2054 ms. Remains : 7968/9346 places, 6783/8109 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 759 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 134775 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134775 steps, saw 132403 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6783 rows 7968 cols
[2023-03-11 03:22:06] [INFO ] Computed 1892 place invariants in 214 ms
[2023-03-11 03:22:08] [INFO ] [Real]Absence check using 0 positive and 1892 generalized place invariants in 615 ms returned sat
[2023-03-11 03:22:08] [INFO ] After 1543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:22:10] [INFO ] [Nat]Absence check using 0 positive and 1892 generalized place invariants in 694 ms returned sat
[2023-03-11 03:22:33] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3525 out of 7968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7968/7968 places, 6783/6783 transitions.
Applied a total of 0 rules in 439 ms. Remains 7968 /7968 variables (removed 0) and now considering 6783/6783 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 439 ms. Remains : 7968/7968 places, 6783/6783 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7968/7968 places, 6783/6783 transitions.
Applied a total of 0 rules in 434 ms. Remains 7968 /7968 variables (removed 0) and now considering 6783/6783 (removed 0) transitions.
[2023-03-11 03:22:34] [INFO ] Invariant cache hit.
[2023-03-11 03:22:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 03:22:37] [INFO ] Implicit Places using invariants in 2520 ms returned [5344, 6178]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2526 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 7966/7968 places, 6783/6783 transitions.
Applied a total of 0 rules in 410 ms. Remains 7966 /7966 variables (removed 0) and now considering 6783/6783 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3372 ms. Remains : 7966/7968 places, 6783/6783 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 131961 steps, run timeout after 3002 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131961 steps, saw 129644 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6783 rows 7966 cols
[2023-03-11 03:22:41] [INFO ] Computed 1890 place invariants in 213 ms
[2023-03-11 03:22:43] [INFO ] [Real]Absence check using 0 positive and 1890 generalized place invariants in 682 ms returned sat
[2023-03-11 03:22:43] [INFO ] After 1697ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:22:45] [INFO ] [Nat]Absence check using 0 positive and 1890 generalized place invariants in 692 ms returned sat
[2023-03-11 03:23:05] [INFO ] After 19674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:09] [INFO ] After 23282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-11 03:23:09] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 90 ms.
Support contains 306 out of 7966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7966/7966 places, 6783/6783 transitions.
Graph (complete) has 12132 edges and 7966 vertex of which 7148 are kept as prefixes of interest. Removing 818 places using SCC suffix rule.3 ms
Discarding 818 places :
Also discarding 663 output transitions
Drop transitions removed 663 transitions
Discarding 1224 places :
Implicit places reduction removed 1224 places
Drop transitions removed 2550 transitions
Trivial Post-agglo rules discarded 2550 transitions
Performed 2550 trivial Post agglomeration. Transition count delta: 2550
Iterating post reduction 0 with 3774 rules applied. Total rules applied 3775 place count 5924 transition count 3570
Reduce places removed 2550 places and 0 transitions.
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Iterating post reduction 1 with 2706 rules applied. Total rules applied 6481 place count 3374 transition count 3414
Reduce places removed 156 places and 0 transitions.
Iterating post reduction 2 with 156 rules applied. Total rules applied 6637 place count 3218 transition count 3414
Performed 816 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 816 Pre rules applied. Total rules applied 6637 place count 3218 transition count 2598
Deduced a syphon composed of 816 places in 1 ms
Ensure Unique test removed 255 places
Reduce places removed 1071 places and 0 transitions.
Iterating global reduction 3 with 1887 rules applied. Total rules applied 8524 place count 2147 transition count 2598
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 51 rules applied. Total rules applied 8575 place count 2096 transition count 2598
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 8575 place count 2096 transition count 2397
Deduced a syphon composed of 201 places in 1 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 8977 place count 1895 transition count 2397
Discarding 464 places :
Symmetric choice reduction at 4 with 464 rule applications. Total rules 9441 place count 1431 transition count 1683
Iterating global reduction 4 with 464 rules applied. Total rules applied 9905 place count 1431 transition count 1683
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 51 rules applied. Total rules applied 9956 place count 1380 transition count 1683
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 102 Pre rules applied. Total rules applied 9956 place count 1380 transition count 1581
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 204 rules applied. Total rules applied 10160 place count 1278 transition count 1581
Discarding 257 places :
Symmetric choice reduction at 5 with 257 rule applications. Total rules 10417 place count 1021 transition count 1224
Ensure Unique test removed 51 places
Iterating global reduction 5 with 308 rules applied. Total rules applied 10725 place count 970 transition count 1224
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 5 with 357 rules applied. Total rules applied 11082 place count 919 transition count 918
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 11133 place count 868 transition count 918
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 11133 place count 868 transition count 867
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 11235 place count 817 transition count 867
Free-agglomeration rule (complex) applied 102 times.
Iterating global reduction 7 with 102 rules applied. Total rules applied 11337 place count 817 transition count 765
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 7 with 102 rules applied. Total rules applied 11439 place count 715 transition count 765
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 8 with 51 rules applied. Total rules applied 11490 place count 664 transition count 714
Applied a total of 11490 rules in 547 ms. Remains 664 /7966 variables (removed 7302) and now considering 714/6783 (removed 6069) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 549 ms. Remains : 664/7966 places, 714/6783 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1384594 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :{}
Probabilistic random walk after 1384594 steps, saw 212933 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 714 rows 664 cols
[2023-03-11 03:23:12] [INFO ] Computed 52 place invariants in 9 ms
[2023-03-11 03:23:13] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 10 ms returned sat
[2023-03-11 03:23:13] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:23:13] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 9 ms returned sat
[2023-03-11 03:23:14] [INFO ] After 646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:14] [INFO ] After 1087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 546 ms.
[2023-03-11 03:23:15] [INFO ] After 1727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 347 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=38 )
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
All properties solved without resorting to model-checking.
Total runtime 148679 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Unfolding complete |P|=12194|T|=10560|A|=32238
Time for unfolding: 0m 5.943sec

Net: FamilyReunion_COL_L00050M0005C002P002G001
(NrP: 12194 NrTr: 10560 NrArc: 32238)

parse formulas
formulas created successfully
place and transition orderings generation:0m14.879sec

net check time: 0m 0.005sec

init dd package: 0m 2.562sec


before gc: list nodes free: 1913893

after gc: idd nodes used:11314, unused:63988686; list nodes free:257871494
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6612528 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093444 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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
c0_CINFORMI0
c0_CINFORMI1
c0_CINFORMI2
c2_CINFORMI0
c2_CINFORMI1
c2_CINFORMI2
m0_MICSystem0
m0_MICSystem1
m0_MICSystem2
m0_MICSystem3
m0_MICSystem4
m0_MICSystem5
p0_PublicAdminOffice0
p0_PublicAdminOffice1
p0_PublicAdminOffice2
r0_Response0
r0_Response1
found 17 constant places
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.352sec

154123

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00050M0005C002P002G001"
export BK_EXAMINATION="ReachabilityCardinality"
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-L00050M0005C002P002G001, 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 r170-tall-167838857100318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00050M0005C002P002G001.tgz
mv FamilyReunion-COL-L00050M0005C002P002G001 execution
cd execution
if [ "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 ;