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

About the Execution of Marcie+red for CANConstruction-PT-070

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9657.915 3600000.00 3695698.00 762.40 ???????T???????? normal

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-167813696100666.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 CANConstruction-PT-070, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100666
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 11K Feb 25 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 21:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 22:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 22:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 7.3M 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 CANConstruction-PT-070-CTLFireability-00
FORMULA_NAME CANConstruction-PT-070-CTLFireability-01
FORMULA_NAME CANConstruction-PT-070-CTLFireability-02
FORMULA_NAME CANConstruction-PT-070-CTLFireability-03
FORMULA_NAME CANConstruction-PT-070-CTLFireability-04
FORMULA_NAME CANConstruction-PT-070-CTLFireability-05
FORMULA_NAME CANConstruction-PT-070-CTLFireability-06
FORMULA_NAME CANConstruction-PT-070-CTLFireability-07
FORMULA_NAME CANConstruction-PT-070-CTLFireability-08
FORMULA_NAME CANConstruction-PT-070-CTLFireability-09
FORMULA_NAME CANConstruction-PT-070-CTLFireability-10
FORMULA_NAME CANConstruction-PT-070-CTLFireability-11
FORMULA_NAME CANConstruction-PT-070-CTLFireability-12
FORMULA_NAME CANConstruction-PT-070-CTLFireability-13
FORMULA_NAME CANConstruction-PT-070-CTLFireability-14
FORMULA_NAME CANConstruction-PT-070-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678739674999

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-070
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:34:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 20:34:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:34:39] [INFO ] Load time of PNML (sax parser for PT used): 645 ms
[2023-03-13 20:34:39] [INFO ] Transformed 10642 places.
[2023-03-13 20:34:39] [INFO ] Transformed 20160 transitions.
[2023-03-13 20:34:39] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 977 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 148 out of 10642 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Discarding 4703 places :
Symmetric choice reduction at 0 with 4703 rule applications. Total rules 4703 place count 5939 transition count 10754
Iterating global reduction 0 with 4703 rules applied. Total rules applied 9406 place count 5939 transition count 10754
Applied a total of 9406 rules in 3656 ms. Remains 5939 /10642 variables (removed 4703) and now considering 10754/20160 (removed 9406) transitions.
// Phase 1: matrix 10754 rows 5939 cols
[2023-03-13 20:34:43] [INFO ] Computed 141 place invariants in 180 ms
[2023-03-13 20:34:50] [INFO ] Implicit Places using invariants in 6890 ms returned []
Implicit Place search using SMT only with invariants took 6932 ms to find 0 implicit places.
[2023-03-13 20:34:50] [INFO ] Invariant cache hit.
[2023-03-13 20:34:51] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5939/10642 places, 10754/20160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11429 ms. Remains : 5939/10642 places, 10754/20160 transitions.
Support contains 148 out of 5939 places after structural reductions.
[2023-03-13 20:34:52] [INFO ] Flatten gal took : 849 ms
[2023-03-13 20:34:53] [INFO ] Flatten gal took : 488 ms
[2023-03-13 20:34:54] [INFO ] Input system was already deterministic with 10754 transitions.
Support contains 146 out of 5939 places (down from 148) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 956 ms. (steps per millisecond=10 ) properties (out of 93) seen :39
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) 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 54) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) 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 53) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) seen :0
Running SMT prover for 52 properties.
[2023-03-13 20:34:55] [INFO ] Invariant cache hit.
[2023-03-13 20:35:02] [INFO ] [Real]Absence check using 71 positive place invariants in 169 ms returned sat
[2023-03-13 20:35:02] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 77 ms returned sat
[2023-03-13 20:35:21] [INFO ] After 13371ms SMT Verify possible using state equation in real domain returned unsat :0 sat :45 real:7
[2023-03-13 20:35:21] [INFO ] State equation strengthened by 9730 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 20:35:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:35:21] [INFO ] After 25314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 52 Parikh solutions to 16 different solutions.
Parikh walk visited 2 properties in 1290 ms.
Support contains 79 out of 5939 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Drop transitions removed 468 transitions
Trivial Post-agglo rules discarded 468 transitions
Performed 468 trivial Post agglomeration. Transition count delta: 468
Iterating post reduction 0 with 468 rules applied. Total rules applied 468 place count 5939 transition count 10286
Reduce places removed 468 places and 0 transitions.
Iterating post reduction 1 with 468 rules applied. Total rules applied 936 place count 5471 transition count 10286
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 936 place count 5471 transition count 10282
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 944 place count 5467 transition count 10282
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 960 place count 5451 transition count 10250
Iterating global reduction 2 with 16 rules applied. Total rules applied 976 place count 5451 transition count 10250
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 18 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 1108 place count 5385 transition count 10184
Free-agglomeration rule applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1186 place count 5385 transition count 10106
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1264 place count 5307 transition count 10106
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1282 place count 5307 transition count 10088
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 1300 place count 5289 transition count 10088
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 4 with 66 rules applied. Total rules applied 1366 place count 5289 transition count 10088
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1367 place count 5289 transition count 10088
Applied a total of 1367 rules in 9208 ms. Remains 5289 /5939 variables (removed 650) and now considering 10088/10754 (removed 666) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9210 ms. Remains : 5289/5939 places, 10088/10754 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 50) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Running SMT prover for 34 properties.
// Phase 1: matrix 10088 rows 5289 cols
[2023-03-13 20:35:32] [INFO ] Computed 141 place invariants in 112 ms
[2023-03-13 20:35:37] [INFO ] [Real]Absence check using 71 positive place invariants in 144 ms returned sat
[2023-03-13 20:35:37] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 62 ms returned sat
[2023-03-13 20:35:55] [INFO ] After 14411ms SMT Verify possible using state equation in real domain returned unsat :0 sat :14 real:20
[2023-03-13 20:35:55] [INFO ] State equation strengthened by 9831 read => feed constraints.
[2023-03-13 20:35:57] [INFO ] After 2401ms SMT Verify possible using 9831 Read/Feed constraints in real domain returned unsat :0 sat :11 real:23
[2023-03-13 20:35:57] [INFO ] After 2409ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :11 real:23
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-13 20:35:57] [INFO ] After 25041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :11 real:23
[2023-03-13 20:36:01] [INFO ] [Nat]Absence check using 71 positive place invariants in 193 ms returned sat
[2023-03-13 20:36:01] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 95 ms returned sat
[2023-03-13 20:36:18] [INFO ] After 13570ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :34
[2023-03-13 20:36:22] [INFO ] After 4788ms SMT Verify possible using 9831 Read/Feed constraints in natural domain returned unsat :0 sat :33
[2023-03-13 20:36:22] [INFO ] After 4789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :33
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-13 20:36:22] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :33
Parikh walk visited 7 properties in 281 ms.
Support contains 46 out of 5289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5289/5289 places, 10088/10088 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 5286 transition count 10082
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 5286 transition count 10082
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 24 place count 5277 transition count 10073
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 5275 transition count 10074
Applied a total of 28 rules in 4361 ms. Remains 5275 /5289 variables (removed 14) and now considering 10074/10088 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4361 ms. Remains : 5275/5289 places, 10074/10088 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 27) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 10074 rows 5275 cols
[2023-03-13 20:36:28] [INFO ] Computed 141 place invariants in 59 ms
[2023-03-13 20:36:30] [INFO ] [Real]Absence check using 71 positive place invariants in 157 ms returned sat
[2023-03-13 20:36:30] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 90 ms returned sat
[2023-03-13 20:36:37] [INFO ] After 9349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-13 20:36:39] [INFO ] [Nat]Absence check using 71 positive place invariants in 154 ms returned sat
[2023-03-13 20:36:40] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 64 ms returned sat
[2023-03-13 20:36:51] [INFO ] After 9517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-13 20:36:51] [INFO ] State equation strengthened by 9845 read => feed constraints.
[2023-03-13 20:37:01] [INFO ] After 9808ms SMT Verify possible using 9845 Read/Feed constraints in natural domain returned unsat :1 sat :15
[2023-03-13 20:37:11] [INFO ] Deduced a trap composed of 3 places in 8748 ms of which 6 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 20:37:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:37:11] [INFO ] After 33786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 1 properties in 160 ms.
Support contains 29 out of 5275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5275/5275 places, 10074/10074 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5274 transition count 10072
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5274 transition count 10072
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 5265 transition count 10063
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 5264 transition count 10063
Applied a total of 22 rules in 4343 ms. Remains 5264 /5275 variables (removed 11) and now considering 10063/10074 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4344 ms. Remains : 5264/5275 places, 10063/10074 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-070-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 20:37:16] [INFO ] Flatten gal took : 289 ms
[2023-03-13 20:37:16] [INFO ] Flatten gal took : 352 ms
[2023-03-13 20:37:17] [INFO ] Input system was already deterministic with 10754 transitions.
Computed a total of 281 stabilizing places and 350 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 5882 transition count 10640
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 5882 transition count 10640
Applied a total of 114 rules in 2362 ms. Remains 5882 /5939 variables (removed 57) and now considering 10640/10754 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2365 ms. Remains : 5882/5939 places, 10640/10754 transitions.
[2023-03-13 20:37:20] [INFO ] Flatten gal took : 207 ms
[2023-03-13 20:37:20] [INFO ] Flatten gal took : 247 ms
[2023-03-13 20:37:20] [INFO ] Input system was already deterministic with 10640 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 5883 transition count 10642
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 5883 transition count 10642
Applied a total of 112 rules in 2170 ms. Remains 5883 /5939 variables (removed 56) and now considering 10642/10754 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2172 ms. Remains : 5883/5939 places, 10642/10754 transitions.
[2023-03-13 20:37:23] [INFO ] Flatten gal took : 193 ms
[2023-03-13 20:37:23] [INFO ] Flatten gal took : 229 ms
[2023-03-13 20:37:24] [INFO ] Input system was already deterministic with 10642 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Drop transitions removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 489 place count 5939 transition count 10265
Reduce places removed 489 places and 0 transitions.
Iterating post reduction 1 with 489 rules applied. Total rules applied 978 place count 5450 transition count 10265
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 1034 place count 5394 transition count 10153
Iterating global reduction 2 with 56 rules applied. Total rules applied 1090 place count 5394 transition count 10153
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 1230 place count 5324 transition count 10083
Applied a total of 1230 rules in 2725 ms. Remains 5324 /5939 variables (removed 615) and now considering 10083/10754 (removed 671) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2727 ms. Remains : 5324/5939 places, 10083/10754 transitions.
[2023-03-13 20:37:27] [INFO ] Flatten gal took : 314 ms
[2023-03-13 20:37:27] [INFO ] Flatten gal took : 330 ms
[2023-03-13 20:37:27] [INFO ] Input system was already deterministic with 10083 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 5887 transition count 10650
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 5887 transition count 10650
Applied a total of 104 rules in 1832 ms. Remains 5887 /5939 variables (removed 52) and now considering 10650/10754 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1833 ms. Remains : 5887/5939 places, 10650/10754 transitions.
[2023-03-13 20:37:30] [INFO ] Flatten gal took : 180 ms
[2023-03-13 20:37:30] [INFO ] Flatten gal took : 260 ms
[2023-03-13 20:37:30] [INFO ] Input system was already deterministic with 10650 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Drop transitions removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 0 with 483 rules applied. Total rules applied 483 place count 5939 transition count 10271
Reduce places removed 483 places and 0 transitions.
Iterating post reduction 1 with 483 rules applied. Total rules applied 966 place count 5456 transition count 10271
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 966 place count 5456 transition count 10267
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 974 place count 5452 transition count 10267
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 1029 place count 5397 transition count 10157
Iterating global reduction 2 with 55 rules applied. Total rules applied 1084 place count 5397 transition count 10157
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 4 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 1216 place count 5331 transition count 10091
Applied a total of 1216 rules in 2748 ms. Remains 5331 /5939 variables (removed 608) and now considering 10091/10754 (removed 663) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2750 ms. Remains : 5331/5939 places, 10091/10754 transitions.
[2023-03-13 20:37:33] [INFO ] Flatten gal took : 205 ms
[2023-03-13 20:37:34] [INFO ] Flatten gal took : 200 ms
[2023-03-13 20:37:34] [INFO ] Input system was already deterministic with 10091 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 5884 transition count 10644
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 5884 transition count 10644
Applied a total of 110 rules in 1785 ms. Remains 5884 /5939 variables (removed 55) and now considering 10644/10754 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1785 ms. Remains : 5884/5939 places, 10644/10754 transitions.
[2023-03-13 20:37:36] [INFO ] Flatten gal took : 171 ms
[2023-03-13 20:37:36] [INFO ] Flatten gal took : 197 ms
[2023-03-13 20:37:37] [INFO ] Input system was already deterministic with 10644 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 5888 transition count 10652
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 5888 transition count 10652
Applied a total of 102 rules in 1745 ms. Remains 5888 /5939 variables (removed 51) and now considering 10652/10754 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1745 ms. Remains : 5888/5939 places, 10652/10754 transitions.
[2023-03-13 20:37:39] [INFO ] Flatten gal took : 238 ms
[2023-03-13 20:37:39] [INFO ] Flatten gal took : 233 ms
[2023-03-13 20:37:39] [INFO ] Input system was already deterministic with 10652 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Drop transitions removed 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 486 rules applied. Total rules applied 486 place count 5939 transition count 10268
Reduce places removed 486 places and 0 transitions.
Iterating post reduction 1 with 486 rules applied. Total rules applied 972 place count 5453 transition count 10268
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 972 place count 5453 transition count 10267
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 974 place count 5452 transition count 10267
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 1028 place count 5398 transition count 10159
Iterating global reduction 2 with 54 rules applied. Total rules applied 1082 place count 5398 transition count 10159
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 1220 place count 5329 transition count 10090
Applied a total of 1220 rules in 2875 ms. Remains 5329 /5939 variables (removed 610) and now considering 10090/10754 (removed 664) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2875 ms. Remains : 5329/5939 places, 10090/10754 transitions.
[2023-03-13 20:37:42] [INFO ] Flatten gal took : 165 ms
[2023-03-13 20:37:43] [INFO ] Flatten gal took : 190 ms
[2023-03-13 20:37:43] [INFO ] Input system was already deterministic with 10090 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 5886 transition count 10648
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 5886 transition count 10648
Applied a total of 106 rules in 1673 ms. Remains 5886 /5939 variables (removed 53) and now considering 10648/10754 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1673 ms. Remains : 5886/5939 places, 10648/10754 transitions.
[2023-03-13 20:37:45] [INFO ] Flatten gal took : 172 ms
[2023-03-13 20:37:45] [INFO ] Flatten gal took : 203 ms
[2023-03-13 20:37:45] [INFO ] Input system was already deterministic with 10648 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Drop transitions removed 488 transitions
Trivial Post-agglo rules discarded 488 transitions
Performed 488 trivial Post agglomeration. Transition count delta: 488
Iterating post reduction 0 with 488 rules applied. Total rules applied 488 place count 5939 transition count 10266
Reduce places removed 488 places and 0 transitions.
Iterating post reduction 1 with 488 rules applied. Total rules applied 976 place count 5451 transition count 10266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 976 place count 5451 transition count 10265
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 978 place count 5450 transition count 10265
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 1032 place count 5396 transition count 10157
Iterating global reduction 2 with 54 rules applied. Total rules applied 1086 place count 5396 transition count 10157
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 1224 place count 5327 transition count 10088
Applied a total of 1224 rules in 2521 ms. Remains 5327 /5939 variables (removed 612) and now considering 10088/10754 (removed 666) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2521 ms. Remains : 5327/5939 places, 10088/10754 transitions.
[2023-03-13 20:37:48] [INFO ] Flatten gal took : 160 ms
[2023-03-13 20:37:48] [INFO ] Flatten gal took : 185 ms
[2023-03-13 20:37:49] [INFO ] Input system was already deterministic with 10088 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 5891 transition count 10658
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 5891 transition count 10658
Applied a total of 96 rules in 1736 ms. Remains 5891 /5939 variables (removed 48) and now considering 10658/10754 (removed 96) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1737 ms. Remains : 5891/5939 places, 10658/10754 transitions.
[2023-03-13 20:37:51] [INFO ] Flatten gal took : 171 ms
[2023-03-13 20:37:51] [INFO ] Flatten gal took : 196 ms
[2023-03-13 20:37:51] [INFO ] Input system was already deterministic with 10658 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 5886 transition count 10648
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 5886 transition count 10648
Applied a total of 106 rules in 1601 ms. Remains 5886 /5939 variables (removed 53) and now considering 10648/10754 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1602 ms. Remains : 5886/5939 places, 10648/10754 transitions.
[2023-03-13 20:37:53] [INFO ] Flatten gal took : 180 ms
[2023-03-13 20:37:53] [INFO ] Flatten gal took : 210 ms
[2023-03-13 20:37:54] [INFO ] Input system was already deterministic with 10648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 5887 transition count 10650
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 5887 transition count 10650
Applied a total of 104 rules in 1578 ms. Remains 5887 /5939 variables (removed 52) and now considering 10650/10754 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1579 ms. Remains : 5887/5939 places, 10650/10754 transitions.
[2023-03-13 20:37:56] [INFO ] Flatten gal took : 172 ms
[2023-03-13 20:37:56] [INFO ] Flatten gal took : 208 ms
[2023-03-13 20:37:56] [INFO ] Input system was already deterministic with 10650 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 5887 transition count 10650
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 5887 transition count 10650
Applied a total of 104 rules in 2042 ms. Remains 5887 /5939 variables (removed 52) and now considering 10650/10754 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2042 ms. Remains : 5887/5939 places, 10650/10754 transitions.
[2023-03-13 20:37:59] [INFO ] Flatten gal took : 250 ms
[2023-03-13 20:37:59] [INFO ] Flatten gal took : 247 ms
[2023-03-13 20:37:59] [INFO ] Input system was already deterministic with 10650 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5939/5939 places, 10754/10754 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 5885 transition count 10646
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 5885 transition count 10646
Applied a total of 108 rules in 1968 ms. Remains 5885 /5939 variables (removed 54) and now considering 10646/10754 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1968 ms. Remains : 5885/5939 places, 10646/10754 transitions.
[2023-03-13 20:38:02] [INFO ] Flatten gal took : 235 ms
[2023-03-13 20:38:02] [INFO ] Flatten gal took : 303 ms
[2023-03-13 20:38:03] [INFO ] Input system was already deterministic with 10646 transitions.
[2023-03-13 20:38:03] [INFO ] Flatten gal took : 284 ms
[2023-03-13 20:38:03] [INFO ] Flatten gal took : 314 ms
[2023-03-13 20:38:03] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 20:38:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5939 places, 10754 transitions and 41388 arcs took 54 ms.
Total runtime 205118 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 5939 NrTr: 10754 NrArc: 41388)

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

net check time: 0m 0.011sec

init dd package: 0m 3.863sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6474356 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16087124 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
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.312sec

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="CANConstruction-PT-070"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is CANConstruction-PT-070, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696100666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-070.tgz
mv CANConstruction-PT-070 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;