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

About the Execution of Marcie+red for JoinFreeModules-PT-2000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 398924.00 0.00 0.00 ???????T??????F? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420000217.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 JoinFreeModules-PT-2000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420000217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.2M 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 JoinFreeModules-PT-2000-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-2000-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679463373949

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-2000
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 05:36:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 05:36:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:36:16] [INFO ] Load time of PNML (sax parser for PT used): 391 ms
[2023-03-22 05:36:16] [INFO ] Transformed 10001 places.
[2023-03-22 05:36:16] [INFO ] Transformed 16001 transitions.
[2023-03-22 05:36:16] [INFO ] Parsed PT model containing 10001 places and 16001 transitions and 46002 arcs in 529 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-2000-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 113 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1478 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 05:36:18] [INFO ] Computed 2000 place invariants in 104 ms
[2023-03-22 05:36:19] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
[2023-03-22 05:36:19] [INFO ] Invariant cache hit.
[2023-03-22 05:36:20] [INFO ] Implicit Places using invariants in 1644 ms returned []
Implicit Place search using SMT only with invariants took 1645 ms to find 0 implicit places.
[2023-03-22 05:36:20] [INFO ] Invariant cache hit.
[2023-03-22 05:36:21] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5485 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Support contains 113 out of 10000 places after structural reductions.
[2023-03-22 05:36:22] [INFO ] Flatten gal took : 565 ms
[2023-03-22 05:36:23] [INFO ] Flatten gal took : 334 ms
[2023-03-22 05:36:24] [INFO ] Input system was already deterministic with 16001 transitions.
Support contains 111 out of 10000 places (down from 113) after GAL structural reductions.
Incomplete random walk after 11010 steps, including 2 resets, run finished after 1052 ms. (steps per millisecond=10 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 85 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 156 ms. (steps per millisecond=6 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 153 ms. (steps per millisecond=6 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 101 ms. (steps per millisecond=9 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 101 ms. (steps per millisecond=9 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 118 ms. (steps per millisecond=8 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 101 ms. (steps per millisecond=9 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 102 ms. (steps per millisecond=9 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 101 ms. (steps per millisecond=9 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 101 ms. (steps per millisecond=9 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 101 ms. (steps per millisecond=9 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 101 ms. (steps per millisecond=9 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 92 ms. (steps per millisecond=10 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 85 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 91 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 85 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 85 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 91 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 91 ms. (steps per millisecond=11 ) properties (out of 71) seen :0
Probabilistic random walk after 80071 steps, saw 80041 distinct states, run finished after 15174 ms. (steps per millisecond=5 ) properties seen :9
Running SMT prover for 62 properties.
[2023-03-22 05:36:45] [INFO ] Invariant cache hit.
[2023-03-22 05:36:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 756 ms returned sat
[2023-03-22 05:36:55] [INFO ] After 10132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:62
[2023-03-22 05:37:04] [INFO ] [Nat]Absence check using 2000 positive place invariants in 728 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.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-22 05:37:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 05:37:20] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:62
Fused 62 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 91 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 440 are kept as prefixes of interest. Removing 9560 places using SCC suffix rule.23 ms
Discarding 9560 places :
Also discarding 15296 output transitions
Drop transitions removed 15296 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 440 transition count 704
Applied a total of 2 rules in 148 ms. Remains 440 /10000 variables (removed 9560) and now considering 704/16001 (removed 15297) transitions.
// Phase 1: matrix 704 rows 440 cols
[2023-03-22 05:37:20] [INFO ] Computed 88 place invariants in 10 ms
[2023-03-22 05:37:21] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 523 ms. Remains : 440/10000 places, 704/16001 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 62) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 60) 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 60) 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 60) 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 60) 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 60) 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 60) 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 60) 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 60) 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 60) 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 60) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 58) 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 58) 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 58) 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 58) 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 58) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Running SMT prover for 55 properties.
[2023-03-22 05:37:21] [INFO ] Invariant cache hit.
[2023-03-22 05:37:21] [INFO ] [Real]Absence check using 88 positive place invariants in 13 ms returned sat
[2023-03-22 05:37:22] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:55
[2023-03-22 05:37:22] [INFO ] [Nat]Absence check using 88 positive place invariants in 12 ms returned sat
[2023-03-22 05:37:25] [INFO ] After 2394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :55
[2023-03-22 05:37:25] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-03-22 05:37:28] [INFO ] After 3360ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :55
[2023-03-22 05:37:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2023-03-22 05:37:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:37:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:37:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 05:37:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 281 ms
[2023-03-22 05:37:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:37:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-22 05:37:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 05:37:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-22 05:37:32] [INFO ] After 7335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :55
Attempting to minimize the solution found.
Minimization took 4582 ms.
[2023-03-22 05:37:37] [INFO ] After 15036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :55
Parikh walk visited 14 properties in 30006 ms.
Support contains 53 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 704/704 transitions.
Graph (complete) has 1056 edges and 440 vertex of which 265 are kept as prefixes of interest. Removing 175 places using SCC suffix rule.0 ms
Discarding 175 places :
Also discarding 280 output transitions
Drop transitions removed 280 transitions
Applied a total of 1 rules in 17 ms. Remains 265 /440 variables (removed 175) and now considering 424/704 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 265/440 places, 424/704 transitions.
[2023-03-22 05:38:07] [INFO ] Flatten gal took : 329 ms
[2023-03-22 05:38:07] [INFO ] Flatten gal took : 347 ms
[2023-03-22 05:38:08] [INFO ] Input system was already deterministic with 16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1471 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 05:38:11] [INFO ] Computed 2000 place invariants in 51 ms
[2023-03-22 05:38:12] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2479 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:12] [INFO ] Flatten gal took : 300 ms
[2023-03-22 05:38:12] [INFO ] Flatten gal took : 305 ms
[2023-03-22 05:38:13] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 925 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:14] [INFO ] Invariant cache hit.
[2023-03-22 05:38:15] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1818 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:15] [INFO ] Flatten gal took : 287 ms
[2023-03-22 05:38:16] [INFO ] Flatten gal took : 313 ms
[2023-03-22 05:38:16] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 937 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:17] [INFO ] Invariant cache hit.
[2023-03-22 05:38:18] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1826 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:18] [INFO ] Flatten gal took : 300 ms
[2023-03-22 05:38:19] [INFO ] Flatten gal took : 315 ms
[2023-03-22 05:38:19] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 982 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:20] [INFO ] Invariant cache hit.
[2023-03-22 05:38:21] [INFO ] Dead Transitions using invariants and state equation in 1074 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2060 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:22] [INFO ] Flatten gal took : 301 ms
[2023-03-22 05:38:22] [INFO ] Flatten gal took : 325 ms
[2023-03-22 05:38:23] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 919 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:24] [INFO ] Invariant cache hit.
[2023-03-22 05:38:25] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1830 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:25] [INFO ] Flatten gal took : 287 ms
[2023-03-22 05:38:25] [INFO ] Flatten gal took : 321 ms
[2023-03-22 05:38:26] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 966 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:27] [INFO ] Invariant cache hit.
[2023-03-22 05:38:28] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1831 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:28] [INFO ] Flatten gal took : 282 ms
[2023-03-22 05:38:28] [INFO ] Flatten gal took : 297 ms
[2023-03-22 05:38:29] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 924 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:30] [INFO ] Invariant cache hit.
[2023-03-22 05:38:31] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1844 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:31] [INFO ] Flatten gal took : 281 ms
[2023-03-22 05:38:31] [INFO ] Flatten gal took : 294 ms
[2023-03-22 05:38:32] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 948 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:33] [INFO ] Invariant cache hit.
[2023-03-22 05:38:34] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1790 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:34] [INFO ] Flatten gal took : 295 ms
[2023-03-22 05:38:34] [INFO ] Flatten gal took : 318 ms
[2023-03-22 05:38:35] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 984 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:36] [INFO ] Invariant cache hit.
[2023-03-22 05:38:37] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1859 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:37] [INFO ] Flatten gal took : 279 ms
[2023-03-22 05:38:38] [INFO ] Flatten gal took : 293 ms
[2023-03-22 05:38:38] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 935 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:39] [INFO ] Invariant cache hit.
[2023-03-22 05:38:40] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1779 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:40] [INFO ] Flatten gal took : 295 ms
[2023-03-22 05:38:41] [INFO ] Flatten gal took : 301 ms
[2023-03-22 05:38:41] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 927 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:42] [INFO ] Invariant cache hit.
[2023-03-22 05:38:43] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1807 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:43] [INFO ] Flatten gal took : 286 ms
[2023-03-22 05:38:44] [INFO ] Flatten gal took : 316 ms
[2023-03-22 05:38:44] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 977 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:45] [INFO ] Invariant cache hit.
[2023-03-22 05:38:46] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1832 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:46] [INFO ] Flatten gal took : 284 ms
[2023-03-22 05:38:47] [INFO ] Flatten gal took : 298 ms
[2023-03-22 05:38:47] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 939 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:48] [INFO ] Invariant cache hit.
[2023-03-22 05:38:49] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1797 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:49] [INFO ] Flatten gal took : 279 ms
[2023-03-22 05:38:50] [INFO ] Flatten gal took : 296 ms
[2023-03-22 05:38:50] [INFO ] Input system was already deterministic with 16001 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3377 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-22 05:38:54] [INFO ] Invariant cache hit.
[2023-03-22 05:38:54] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4243 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:38:55] [INFO ] Flatten gal took : 331 ms
[2023-03-22 05:38:55] [INFO ] Flatten gal took : 294 ms
[2023-03-22 05:38:56] [INFO ] Input system was already deterministic with 16001 transitions.
Incomplete random walk after 11008 steps, including 2 resets, run finished after 717 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1012 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Probabilistic random walk after 24008 steps, saw 24003 distinct states, run finished after 3077 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:39:01] [INFO ] Invariant cache hit.
[2023-03-22 05:39:02] [INFO ] [Real]Absence check using 2000 positive place invariants in 641 ms returned sat
[2023-03-22 05:39:16] [INFO ] After 15414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:39:18] [INFO ] [Nat]Absence check using 2000 positive place invariants in 649 ms returned sat
[2023-03-22 05:39:41] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 5 are kept as prefixes of interest. Removing 9995 places using SCC suffix rule.5 ms
Discarding 9995 places :
Also discarding 15992 output transitions
Drop transitions removed 15992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 25 ms. Remains 5 /10000 variables (removed 9995) and now considering 8/16001 (removed 15993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 05:39:41] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 05:39:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 5/10000 places, 8/16001 transitions.
Finished random walk after 3002 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1501 )
FORMULA JoinFreeModules-PT-2000-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 973 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 05:39:42] [INFO ] Computed 2000 place invariants in 39 ms
[2023-03-22 05:39:43] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1976 ms. Remains : 10000/10000 places, 16001/16001 transitions.
[2023-03-22 05:39:43] [INFO ] Flatten gal took : 345 ms
[2023-03-22 05:39:44] [INFO ] Flatten gal took : 315 ms
[2023-03-22 05:39:45] [INFO ] Input system was already deterministic with 16001 transitions.
[2023-03-22 05:39:45] [INFO ] Flatten gal took : 326 ms
[2023-03-22 05:39:45] [INFO ] Flatten gal took : 305 ms
[2023-03-22 05:39:45] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 05:39:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10000 places, 16001 transitions and 46000 arcs took 64 ms.
Total runtime 210167 ms.
There are residual formulas that ITS could not solve within timeout
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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 10000 NrTr: 16001 NrArc: 46000)

parse formulas
formulas created successfully
place and transition orderings generation:0m12.066sec

net check time: 0m 0.008sec

init dd package: 0m 2.906sec


BK_STOP 1679463772873

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
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.730sec

/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 594 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="JoinFreeModules-PT-2000"
export BK_EXAMINATION="CTLCardinality"
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 JoinFreeModules-PT-2000, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420000217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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