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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.8K Feb 26 00:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 00:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 00:59 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 16M 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-050-CTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678746700892

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=CANInsertWithFailure-PT-050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 22:31:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 22:31:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:31:43] [INFO ] Load time of PNML (sax parser for PT used): 613 ms
[2023-03-13 22:31:43] [INFO ] Transformed 5604 places.
[2023-03-13 22:31:43] [INFO ] Transformed 15300 transitions.
[2023-03-13 22:31:43] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 786 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 120 out of 5604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5603 transition count 15300
Applied a total of 1 rules in 1499 ms. Remains 5603 /5604 variables (removed 1) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-13 22:31:46] [INFO ] Computed 52 place invariants in 1171 ms
[2023-03-13 22:31:48] [INFO ] Implicit Places using invariants in 2822 ms returned []
Implicit Place search using SMT only with invariants took 2866 ms to find 0 implicit places.
[2023-03-13 22:31:48] [INFO ] Invariant cache hit.
[2023-03-13 22:31:58] [INFO ] Dead Transitions using invariants and state equation in 10719 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5603/5604 places, 15300/15300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15111 ms. Remains : 5603/5604 places, 15300/15300 transitions.
Support contains 120 out of 5603 places after structural reductions.
[2023-03-13 22:32:00] [INFO ] Flatten gal took : 692 ms
[2023-03-13 22:32:00] [INFO ] Flatten gal took : 393 ms
[2023-03-13 22:32:01] [INFO ] Input system was already deterministic with 15300 transitions.
Support contains 119 out of 5603 places (down from 120) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 725 ms. (steps per millisecond=13 ) properties (out of 71) seen :30
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) 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 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) 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 40) 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 40) 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 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 40) 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 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) 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 40) 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 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 40) 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 40) 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 40) seen :0
Running SMT prover for 40 properties.
[2023-03-13 22:32:02] [INFO ] Invariant cache hit.
[2023-03-13 22:32:06] [INFO ] [Real]Absence check using 50 positive place invariants in 80 ms returned sat
[2023-03-13 22:32:06] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 126 ms returned sat
[2023-03-13 22:32:22] [INFO ] After 19779ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:40
[2023-03-13 22:32:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 144 ms returned sat
[2023-03-13 22:32:27] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 134 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:32:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 22:32:47] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:40
Fused 40 Parikh solutions to 16 different solutions.
Parikh walk visited 1 properties in 667 ms.
Support contains 66 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 5603 transition count 14970
Reduce places removed 330 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 331 rules applied. Total rules applied 661 place count 5273 transition count 14969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 662 place count 5272 transition count 14969
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 662 place count 5272 transition count 14963
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 674 place count 5266 transition count 14963
Performed 2413 Post agglomeration using F-continuation condition.Transition count delta: 2413
Deduced a syphon composed of 2413 places in 10 ms
Reduce places removed 2413 places and 0 transitions.
Iterating global reduction 3 with 4826 rules applied. Total rules applied 5500 place count 2853 transition count 12550
Drop transitions removed 2323 transitions
Redundant transition composition rules discarded 2323 transitions
Iterating global reduction 3 with 2323 rules applied. Total rules applied 7823 place count 2853 transition count 10227
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 7836 place count 2853 transition count 10214
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 7849 place count 2840 transition count 10214
Partial Free-agglomeration rule applied 2541 times.
Drop transitions removed 2541 transitions
Iterating global reduction 4 with 2541 rules applied. Total rules applied 10390 place count 2840 transition count 10214
Partial Free-agglomeration rule applied 349 times.
Drop transitions removed 349 transitions
Iterating global reduction 4 with 349 rules applied. Total rules applied 10739 place count 2840 transition count 10214
Applied a total of 10739 rules in 4297 ms. Remains 2840 /5603 variables (removed 2763) and now considering 10214/15300 (removed 5086) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4299 ms. Remains : 2840/5603 places, 10214/15300 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 714 ms. (steps per millisecond=14 ) properties (out of 39) seen :23
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 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 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 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 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
Running SMT prover for 16 properties.
// Phase 1: matrix 10214 rows 2840 cols
[2023-03-13 22:32:53] [INFO ] Computed 52 place invariants in 304 ms
[2023-03-13 22:32:54] [INFO ] [Real]Absence check using 50 positive place invariants in 28 ms returned sat
[2023-03-13 22:32:54] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-13 22:33:03] [INFO ] After 7673ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:7
[2023-03-13 22:33:03] [INFO ] State equation strengthened by 9899 read => feed constraints.
[2023-03-13 22:33:07] [INFO ] After 4427ms SMT Verify possible using 9899 Read/Feed constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-13 22:33:07] [INFO ] After 13867ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-13 22:33:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 32 ms returned sat
[2023-03-13 22:33:08] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-13 22:33:16] [INFO ] After 7291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-13 22:33:26] [INFO ] After 10155ms SMT Verify possible using 9899 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-13 22:33:35] [INFO ] Deduced a trap composed of 2 places in 2865 ms of which 16 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 22:33:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 22:33:35] [INFO ] After 27908ms 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 520 ms.
Support contains 32 out of 2840 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2840/2840 places, 10214/10214 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 2821 transition count 10195
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 49 place count 2821 transition count 10195
Applied a total of 49 rules in 1510 ms. Remains 2821 /2840 variables (removed 19) and now considering 10195/10214 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1510 ms. Remains : 2821/2840 places, 10195/10214 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 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 25 ms. (steps per millisecond=400 ) 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 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 10195 rows 2821 cols
[2023-03-13 22:33:38] [INFO ] Computed 52 place invariants in 335 ms
[2023-03-13 22:33:39] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2023-03-13 22:33:39] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 48 ms returned sat
[2023-03-13 22:33:45] [INFO ] After 7064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-13 22:33:46] [INFO ] [Nat]Absence check using 50 positive place invariants in 48 ms returned sat
[2023-03-13 22:33:46] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 51 ms returned sat
[2023-03-13 22:33:53] [INFO ] After 6676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-13 22:33:53] [INFO ] State equation strengthened by 9993 read => feed constraints.
[2023-03-13 22:34:05] [INFO ] After 11366ms SMT Verify possible using 9993 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-13 22:34:10] [INFO ] After 16845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-13 22:34:10] [INFO ] After 25133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 1 properties in 502 ms.
Support contains 28 out of 2821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2821/2821 places, 10195/10195 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2818 transition count 10192
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 2818 transition count 10192
Applied a total of 7 rules in 1067 ms. Remains 2818 /2821 variables (removed 3) and now considering 10192/10195 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1068 ms. Remains : 2818/2821 places, 10192/10195 transitions.
[2023-03-13 22:34:12] [INFO ] Flatten gal took : 295 ms
[2023-03-13 22:34:13] [INFO ] Flatten gal took : 299 ms
[2023-03-13 22:34:13] [INFO ] Input system was already deterministic with 15300 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 705 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 707 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:34:14] [INFO ] Flatten gal took : 237 ms
[2023-03-13 22:34:15] [INFO ] Flatten gal took : 248 ms
[2023-03-13 22:34:15] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 800 place count 5203 transition count 14900
Applied a total of 800 rules in 1215 ms. Remains 5203 /5603 variables (removed 400) and now considering 14900/15300 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1215 ms. Remains : 5203/5603 places, 14900/15300 transitions.
[2023-03-13 22:34:17] [INFO ] Flatten gal took : 225 ms
[2023-03-13 22:34:17] [INFO ] Flatten gal took : 309 ms
[2023-03-13 22:34:18] [INFO ] Input system was already deterministic with 14900 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 800 place count 5203 transition count 14900
Applied a total of 800 rules in 1371 ms. Remains 5203 /5603 variables (removed 400) and now considering 14900/15300 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1374 ms. Remains : 5203/5603 places, 14900/15300 transitions.
[2023-03-13 22:34:19] [INFO ] Flatten gal took : 218 ms
[2023-03-13 22:34:19] [INFO ] Flatten gal took : 303 ms
[2023-03-13 22:34:20] [INFO ] Input system was already deterministic with 14900 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 800 place count 5203 transition count 14900
Applied a total of 800 rules in 1499 ms. Remains 5203 /5603 variables (removed 400) and now considering 14900/15300 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1501 ms. Remains : 5203/5603 places, 14900/15300 transitions.
[2023-03-13 22:34:22] [INFO ] Flatten gal took : 296 ms
[2023-03-13 22:34:22] [INFO ] Flatten gal took : 305 ms
[2023-03-13 22:34:23] [INFO ] Input system was already deterministic with 14900 transitions.
Finished random walk after 2189 steps, including 4 resets, run visited all 1 properties in 37 ms. (steps per millisecond=59 )
FORMULA CANInsertWithFailure-PT-050-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 607 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:34:24] [INFO ] Flatten gal took : 216 ms
[2023-03-13 22:34:24] [INFO ] Flatten gal took : 334 ms
[2023-03-13 22:34:25] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 342 transitions
Trivial Post-agglo rules discarded 342 transitions
Performed 342 trivial Post agglomeration. Transition count delta: 342
Iterating post reduction 0 with 342 rules applied. Total rules applied 342 place count 5603 transition count 14958
Reduce places removed 342 places and 0 transitions.
Iterating post reduction 1 with 342 rules applied. Total rules applied 684 place count 5261 transition count 14958
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 684 place count 5261 transition count 14955
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 690 place count 5258 transition count 14955
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 7 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 784 place count 5211 transition count 14908
Applied a total of 784 rules in 1594 ms. Remains 5211 /5603 variables (removed 392) and now considering 14908/15300 (removed 392) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1595 ms. Remains : 5211/5603 places, 14908/15300 transitions.
[2023-03-13 22:34:27] [INFO ] Flatten gal took : 349 ms
[2023-03-13 22:34:27] [INFO ] Flatten gal took : 398 ms
[2023-03-13 22:34:28] [INFO ] Input system was already deterministic with 14908 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 555 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 556 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:34:29] [INFO ] Flatten gal took : 307 ms
[2023-03-13 22:34:29] [INFO ] Flatten gal took : 313 ms
[2023-03-13 22:34:30] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 5603 transition count 14953
Reduce places removed 347 places and 0 transitions.
Iterating post reduction 1 with 347 rules applied. Total rules applied 694 place count 5256 transition count 14953
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 694 place count 5256 transition count 14952
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 5 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 794 place count 5206 transition count 14903
Applied a total of 794 rules in 1408 ms. Remains 5206 /5603 variables (removed 397) and now considering 14903/15300 (removed 397) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1409 ms. Remains : 5206/5603 places, 14903/15300 transitions.
[2023-03-13 22:34:32] [INFO ] Flatten gal took : 301 ms
[2023-03-13 22:34:32] [INFO ] Flatten gal took : 359 ms
[2023-03-13 22:34:33] [INFO ] Input system was already deterministic with 14903 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 499 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:34:34] [INFO ] Flatten gal took : 314 ms
[2023-03-13 22:34:34] [INFO ] Flatten gal took : 328 ms
[2023-03-13 22:34:35] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 5603 transition count 14951
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 5 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 798 place count 5204 transition count 14901
Applied a total of 798 rules in 1245 ms. Remains 5204 /5603 variables (removed 399) and now considering 14901/15300 (removed 399) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1246 ms. Remains : 5204/5603 places, 14901/15300 transitions.
[2023-03-13 22:34:36] [INFO ] Flatten gal took : 300 ms
[2023-03-13 22:34:37] [INFO ] Flatten gal took : 363 ms
[2023-03-13 22:34:37] [INFO ] Input system was already deterministic with 14901 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 639 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 639 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:34:38] [INFO ] Flatten gal took : 215 ms
[2023-03-13 22:34:39] [INFO ] Flatten gal took : 277 ms
[2023-03-13 22:34:39] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 656 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 656 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:34:40] [INFO ] Flatten gal took : 292 ms
[2023-03-13 22:34:41] [INFO ] Flatten gal took : 358 ms
[2023-03-13 22:34:41] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 599 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 599 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:34:42] [INFO ] Flatten gal took : 219 ms
[2023-03-13 22:34:42] [INFO ] Flatten gal took : 308 ms
[2023-03-13 22:34:43] [INFO ] Input system was already deterministic with 15300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 800 place count 5203 transition count 14900
Applied a total of 800 rules in 1246 ms. Remains 5203 /5603 variables (removed 400) and now considering 14900/15300 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1246 ms. Remains : 5203/5603 places, 14900/15300 transitions.
[2023-03-13 22:34:44] [INFO ] Flatten gal took : 209 ms
[2023-03-13 22:34:45] [INFO ] Flatten gal took : 236 ms
[2023-03-13 22:34:45] [INFO ] Input system was already deterministic with 14900 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 800 place count 5203 transition count 14900
Applied a total of 800 rules in 1163 ms. Remains 5203 /5603 variables (removed 400) and now considering 14900/15300 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1163 ms. Remains : 5203/5603 places, 14900/15300 transitions.
[2023-03-13 22:34:47] [INFO ] Flatten gal took : 208 ms
[2023-03-13 22:34:47] [INFO ] Flatten gal took : 233 ms
[2023-03-13 22:34:47] [INFO ] Input system was already deterministic with 14900 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 457 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 5603/5603 places, 15300/15300 transitions.
[2023-03-13 22:34:48] [INFO ] Flatten gal took : 224 ms
[2023-03-13 22:34:48] [INFO ] Flatten gal took : 248 ms
[2023-03-13 22:34:49] [INFO ] Input system was already deterministic with 15300 transitions.
[2023-03-13 22:34:49] [INFO ] Flatten gal took : 309 ms
[2023-03-13 22:34:50] [INFO ] Flatten gal took : 289 ms
[2023-03-13 22:34:50] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 22:34:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5603 places, 15300 transitions and 40900 arcs took 71 ms.
Total runtime 187522 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: 5603 NrTr: 15300 NrArc: 40900)

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

net check time: 0m 0.009sec

init dd package: 0m 3.022sec


before gc: list nodes free: 1457519

after gc: idd nodes used:46154071, unused:17845929; list nodes free:73182778

RS generation: 45m32.604sec


-> last computed set: #nodes 46149086 (4.6e+07) #states 62,652,558 (7)


CANNOT_COMPUTE


BK_STOP 1678749674425

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.634sec

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-050"
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 CANInsertWithFailure-PT-050, 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-167813696200738"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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