Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696100721.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANInsertWithFailure-PT-030, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100721
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K Feb 26 00:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 00:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.6M 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 CANInsertWithFailure-PT-030-CTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-030-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678743907921

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=CANInsertWithFailure-PT-030
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 21:45:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:45:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:45:09] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2023-03-13 21:45:09] [INFO ] Transformed 2164 places.
[2023-03-13 21:45:09] [INFO ] Transformed 5580 transitions.
[2023-03-13 21:45:09] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 131 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2163 transition count 5580
Applied a total of 1 rules in 229 ms. Remains 2163 /2164 variables (removed 1) and now considering 5580/5580 (removed 0) transitions.
// Phase 1: matrix 5580 rows 2163 cols
[2023-03-13 21:45:10] [INFO ] Computed 32 place invariants in 328 ms
[2023-03-13 21:45:11] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2023-03-13 21:45:11] [INFO ] Invariant cache hit.
[2023-03-13 21:45:12] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-13 21:45:13] [INFO ] Implicit Places using invariants and state equation in 2419 ms returned []
Implicit Place search using SMT with State Equation took 3500 ms to find 0 implicit places.
[2023-03-13 21:45:13] [INFO ] Invariant cache hit.
[2023-03-13 21:45:15] [INFO ] Dead Transitions using invariants and state equation in 2284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2163/2164 places, 5580/5580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6017 ms. Remains : 2163/2164 places, 5580/5580 transitions.
Support contains 131 out of 2163 places after structural reductions.
[2023-03-13 21:45:16] [INFO ] Flatten gal took : 239 ms
[2023-03-13 21:45:16] [INFO ] Flatten gal took : 135 ms
[2023-03-13 21:45:16] [INFO ] Input system was already deterministic with 5580 transitions.
Support contains 130 out of 2163 places (down from 131) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 705 ms. (steps per millisecond=14 ) properties (out of 80) seen :42
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 38) 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 38) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 36) 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 36) 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 36) 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 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 36) 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 36) 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 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) 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 36) 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 36) 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 36) 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 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) 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 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :0
Running SMT prover for 36 properties.
[2023-03-13 21:45:17] [INFO ] Invariant cache hit.
[2023-03-13 21:45:19] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2023-03-13 21:45:19] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-13 21:45:19] [INFO ] After 1472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:36
[2023-03-13 21:45:20] [INFO ] [Nat]Absence check using 30 positive place invariants in 33 ms returned sat
[2023-03-13 21:45:20] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 23 ms returned sat
[2023-03-13 21:45:30] [INFO ] After 9088ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :34
[2023-03-13 21:45:30] [INFO ] State equation strengthened by 1770 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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:644)
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-13 21:45:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 21:45:44] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:36
Fused 36 Parikh solutions to 34 different solutions.
Parikh walk visited 8 properties in 1412 ms.
Support contains 44 out of 2163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 2163 transition count 5376
Reduce places removed 204 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 206 rules applied. Total rules applied 410 place count 1959 transition count 5374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 412 place count 1957 transition count 5374
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 412 place count 1957 transition count 5372
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 416 place count 1955 transition count 5372
Performed 821 Post agglomeration using F-continuation condition.Transition count delta: 821
Deduced a syphon composed of 821 places in 3 ms
Reduce places removed 821 places and 0 transitions.
Iterating global reduction 3 with 1642 rules applied. Total rules applied 2058 place count 1134 transition count 4551
Drop transitions removed 766 transitions
Redundant transition composition rules discarded 766 transitions
Iterating global reduction 3 with 766 rules applied. Total rules applied 2824 place count 1134 transition count 3785
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2826 place count 1134 transition count 3783
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2828 place count 1132 transition count 3783
Partial Free-agglomeration rule applied 967 times.
Drop transitions removed 967 transitions
Iterating global reduction 4 with 967 rules applied. Total rules applied 3795 place count 1132 transition count 3783
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 4 with 31 rules applied. Total rules applied 3826 place count 1132 transition count 3783
Applied a total of 3826 rules in 795 ms. Remains 1132 /2163 variables (removed 1031) and now considering 3783/5580 (removed 1797) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 797 ms. Remains : 1132/2163 places, 3783/5580 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 26) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3783 rows 1132 cols
[2023-03-13 21:45:47] [INFO ] Computed 32 place invariants in 54 ms
[2023-03-13 21:45:47] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-13 21:45:47] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-13 21:45:47] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-13 21:45:47] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-13 21:45:47] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-13 21:45:50] [INFO ] After 2205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-13 21:45:50] [INFO ] State equation strengthened by 3521 read => feed constraints.
[2023-03-13 21:45:53] [INFO ] After 3310ms SMT Verify possible using 3521 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-13 21:45:56] [INFO ] After 6455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2006 ms.
[2023-03-13 21:45:58] [INFO ] After 11091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 288 ms.
Support contains 14 out of 1132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1132/1132 places, 3783/3783 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 1117 transition count 3768
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 46 place count 1117 transition count 3768
Applied a total of 46 rules in 269 ms. Remains 1117 /1132 variables (removed 15) and now considering 3768/3783 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 1117/1132 places, 3768/3783 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 197582 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197582 steps, saw 32928 distinct states, run finished after 3003 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3768 rows 1117 cols
[2023-03-13 21:46:03] [INFO ] Computed 32 place invariants in 52 ms
[2023-03-13 21:46:03] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-13 21:46:03] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-13 21:46:03] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-13 21:46:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-13 21:46:03] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-13 21:46:06] [INFO ] After 2406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-13 21:46:06] [INFO ] State equation strengthened by 3625 read => feed constraints.
[2023-03-13 21:46:09] [INFO ] After 2869ms SMT Verify possible using 3625 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-13 21:46:12] [INFO ] After 5976ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2083 ms.
[2023-03-13 21:46:14] [INFO ] After 11031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 229 ms.
Support contains 14 out of 1117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1117/1117 places, 3768/3768 transitions.
Applied a total of 0 rules in 105 ms. Remains 1117 /1117 variables (removed 0) and now considering 3768/3768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 1117/1117 places, 3768/3768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1117/1117 places, 3768/3768 transitions.
Applied a total of 0 rules in 124 ms. Remains 1117 /1117 variables (removed 0) and now considering 3768/3768 (removed 0) transitions.
[2023-03-13 21:46:15] [INFO ] Invariant cache hit.
[2023-03-13 21:46:16] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2023-03-13 21:46:16] [INFO ] Invariant cache hit.
[2023-03-13 21:46:17] [INFO ] State equation strengthened by 3625 read => feed constraints.
[2023-03-13 21:46:34] [INFO ] Implicit Places using invariants and state equation in 18017 ms returned []
Implicit Place search using SMT with State Equation took 19138 ms to find 0 implicit places.
[2023-03-13 21:46:34] [INFO ] Redundant transitions in 328 ms returned []
[2023-03-13 21:46:34] [INFO ] Invariant cache hit.
[2023-03-13 21:46:36] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21172 ms. Remains : 1117/1117 places, 3768/3768 transitions.
Graph (trivial) has 3508 edges and 1117 vertex of which 981 / 1117 are part of one of the 2 SCC in 5 ms
Free SCC test removed 979 places
Drop transitions removed 2681 transitions
Ensure Unique test removed 921 transitions
Reduce isomorphic transitions removed 3602 transitions.
Graph (complete) has 347 edges and 138 vertex of which 49 are kept as prefixes of interest. Removing 89 places using SCC suffix rule.1 ms
Discarding 89 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Drop transitions removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 49 transition count 77
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 48 transition count 76
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 92 place count 21 transition count 49
Iterating global reduction 2 with 27 rules applied. Total rules applied 119 place count 21 transition count 49
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 21 transition count 47
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 21 transition count 46
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 124 place count 20 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 18 transition count 43
Applied a total of 126 rules in 16 ms. Remains 18 /1117 variables (removed 1099) and now considering 43/3768 (removed 3725) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 43 rows 18 cols
[2023-03-13 21:46:36] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-13 21:46:36] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-13 21:46:36] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-13 21:46:36] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-13 21:46:36] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-13 21:46:36] [INFO ] Flatten gal took : 99 ms
[2023-03-13 21:46:36] [INFO ] Flatten gal took : 114 ms
[2023-03-13 21:46:36] [INFO ] Input system was already deterministic with 5580 transitions.
Computed a total of 122 stabilizing places and 210 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 71 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:36] [INFO ] Flatten gal took : 117 ms
[2023-03-13 21:46:37] [INFO ] Flatten gal took : 145 ms
[2023-03-13 21:46:37] [INFO ] Input system was already deterministic with 5580 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 207 place count 2163 transition count 5373
Reduce places removed 207 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 209 rules applied. Total rules applied 416 place count 1956 transition count 5371
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 476 place count 1925 transition count 5342
Partial Post-agglomeration rule applied 114 times.
Drop transitions removed 114 transitions
Iterating global reduction 3 with 114 rules applied. Total rules applied 590 place count 1925 transition count 5342
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 646 place count 1869 transition count 5286
Iterating global reduction 3 with 56 rules applied. Total rules applied 702 place count 1869 transition count 5286
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 730 place count 1869 transition count 5258
Applied a total of 730 rules in 534 ms. Remains 1869 /2163 variables (removed 294) and now considering 5258/5580 (removed 322) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 535 ms. Remains : 1869/2163 places, 5258/5580 transitions.
[2023-03-13 21:46:38] [INFO ] Flatten gal took : 104 ms
[2023-03-13 21:46:38] [INFO ] Flatten gal took : 104 ms
[2023-03-13 21:46:38] [INFO ] Input system was already deterministic with 5258 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 70 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:38] [INFO ] Flatten gal took : 73 ms
[2023-03-13 21:46:38] [INFO ] Flatten gal took : 82 ms
[2023-03-13 21:46:38] [INFO ] Input system was already deterministic with 5580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 61 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:38] [INFO ] Flatten gal took : 74 ms
[2023-03-13 21:46:39] [INFO ] Flatten gal took : 84 ms
[2023-03-13 21:46:39] [INFO ] Input system was already deterministic with 5580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 66 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:39] [INFO ] Flatten gal took : 91 ms
[2023-03-13 21:46:39] [INFO ] Flatten gal took : 106 ms
[2023-03-13 21:46:39] [INFO ] Input system was already deterministic with 5580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 80 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:39] [INFO ] Flatten gal took : 71 ms
[2023-03-13 21:46:39] [INFO ] Flatten gal took : 78 ms
[2023-03-13 21:46:40] [INFO ] Input system was already deterministic with 5580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 61 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:40] [INFO ] Flatten gal took : 68 ms
[2023-03-13 21:46:40] [INFO ] Flatten gal took : 73 ms
[2023-03-13 21:46:40] [INFO ] Input system was already deterministic with 5580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 62 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:40] [INFO ] Flatten gal took : 68 ms
[2023-03-13 21:46:40] [INFO ] Flatten gal took : 75 ms
[2023-03-13 21:46:40] [INFO ] Input system was already deterministic with 5580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:41] [INFO ] Flatten gal took : 68 ms
[2023-03-13 21:46:41] [INFO ] Flatten gal took : 73 ms
[2023-03-13 21:46:41] [INFO ] Input system was already deterministic with 5580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 79 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:41] [INFO ] Flatten gal took : 72 ms
[2023-03-13 21:46:41] [INFO ] Flatten gal took : 78 ms
[2023-03-13 21:46:41] [INFO ] Input system was already deterministic with 5580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:42] [INFO ] Flatten gal took : 82 ms
[2023-03-13 21:46:42] [INFO ] Flatten gal took : 87 ms
[2023-03-13 21:46:42] [INFO ] Input system was already deterministic with 5580 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2163 transition count 5370
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1953 transition count 5370
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 480 place count 1923 transition count 5340
Applied a total of 480 rules in 174 ms. Remains 1923 /2163 variables (removed 240) and now considering 5340/5580 (removed 240) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 174 ms. Remains : 1923/2163 places, 5340/5580 transitions.
[2023-03-13 21:46:42] [INFO ] Flatten gal took : 66 ms
[2023-03-13 21:46:42] [INFO ] Flatten gal took : 72 ms
[2023-03-13 21:46:42] [INFO ] Input system was already deterministic with 5340 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:42] [INFO ] Flatten gal took : 70 ms
[2023-03-13 21:46:43] [INFO ] Flatten gal took : 74 ms
[2023-03-13 21:46:43] [INFO ] Input system was already deterministic with 5580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 61 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:43] [INFO ] Flatten gal took : 68 ms
[2023-03-13 21:46:43] [INFO ] Flatten gal took : 74 ms
[2023-03-13 21:46:43] [INFO ] Input system was already deterministic with 5580 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 2163 transition count 5371
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1954 transition count 5371
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 478 place count 1924 transition count 5341
Applied a total of 478 rules in 227 ms. Remains 1924 /2163 variables (removed 239) and now considering 5341/5580 (removed 239) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 228 ms. Remains : 1924/2163 places, 5341/5580 transitions.
[2023-03-13 21:46:43] [INFO ] Flatten gal took : 71 ms
[2023-03-13 21:46:43] [INFO ] Flatten gal took : 77 ms
[2023-03-13 21:46:44] [INFO ] Input system was already deterministic with 5341 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2163/2163 places, 5580/5580 transitions.
Applied a total of 0 rules in 60 ms. Remains 2163 /2163 variables (removed 0) and now considering 5580/5580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 2163/2163 places, 5580/5580 transitions.
[2023-03-13 21:46:44] [INFO ] Flatten gal took : 68 ms
[2023-03-13 21:46:44] [INFO ] Flatten gal took : 74 ms
[2023-03-13 21:46:44] [INFO ] Input system was already deterministic with 5580 transitions.
[2023-03-13 21:46:44] [INFO ] Flatten gal took : 86 ms
[2023-03-13 21:46:44] [INFO ] Flatten gal took : 95 ms
[2023-03-13 21:46:44] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 21:46:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2163 places, 5580 transitions and 14940 arcs took 21 ms.
Total runtime 95413 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: 2163 NrTr: 5580 NrArc: 14940)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.824sec

net check time: 0m 0.003sec

init dd package: 0m 2.872sec


before gc: list nodes free: 1300021

after gc: idd nodes used:39851142, unused:24148858; list nodes free:107974367

RS generation: 21m27.815sec


-> last computed set: #nodes 39849236 (4.0e+07) #states 13,107,285 (7)


CANNOT_COMPUTE


BK_STOP 1678745328241

--------------------
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.152sec

idd.cc:820: DD Exception: No free nodes

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="CANInsertWithFailure-PT-030"
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 CANInsertWithFailure-PT-030, 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 r042-tajo-167813696100721"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 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 ;