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

About the Execution of Marcie+red for RERS2020-PT-pb105

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r330-tall-167889203000250.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is RERS2020-PT-pb105, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203000250
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 87M
-rw-r--r-- 1 mcc users 7.7K Feb 26 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 08:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 08:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 09:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 09:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 86M Mar 5 18:23 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 RERS2020-PT-pb105-CTLFireability-00
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-01
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-02
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-03
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-04
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-05
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-06
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-07
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-08
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-09
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-10
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-11
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-12
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-13
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-14
FORMULA_NAME RERS2020-PT-pb105-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679121198525

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=RERS2020-PT-pb105
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 06:33:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 06:33:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 06:33:22] [INFO ] Load time of PNML (sax parser for PT used): 2347 ms
[2023-03-18 06:33:22] [INFO ] Transformed 1982 places.
[2023-03-18 06:33:23] [INFO ] Transformed 153412 transitions.
[2023-03-18 06:33:23] [INFO ] Found NUPN structural information;
[2023-03-18 06:33:23] [INFO ] Parsed PT model containing 1982 places and 153412 transitions and 610156 arcs in 2910 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Ensure Unique test removed 3773 transitions
Reduce redundant transitions removed 3773 transitions.
Support contains 184 out of 1982 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1982/1982 places, 149639/149639 transitions.
Ensure Unique test removed 10 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1971 transition count 149639
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 1968 transition count 149588
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 1968 transition count 149588
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 1968 transition count 149585
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 1967 transition count 149583
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 1967 transition count 149583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 1967 transition count 149582
Applied a total of 23 rules in 2255 ms. Remains 1967 /1982 variables (removed 15) and now considering 149582/149639 (removed 57) transitions.
[2023-03-18 06:33:26] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-18 06:33:27] [INFO ] Computed 10 place invariants in 591 ms
[2023-03-18 06:33:34] [INFO ] Implicit Places using invariants in 8023 ms returned []
Implicit Place search using SMT only with invariants took 8056 ms to find 0 implicit places.
[2023-03-18 06:33:34] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-18 06:33:34] [INFO ] Invariant cache hit.
[2023-03-18 06:34:04] [INFO ] Performed 85351/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 06:34:26] [INFO ] Dead Transitions using invariants and state equation in 52399 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1967/1982 places, 149582/149639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62737 ms. Remains : 1967/1982 places, 149582/149639 transitions.
Support contains 184 out of 1967 places after structural reductions.
[2023-03-18 06:34:31] [INFO ] Flatten gal took : 3643 ms
[2023-03-18 06:34:34] [INFO ] Flatten gal took : 3675 ms
[2023-03-18 06:34:42] [INFO ] Input system was already deterministic with 149582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1059 ms. (steps per millisecond=9 ) properties (out of 78) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=8 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 76) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 75) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 75) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 74) seen :0
Interrupted probabilistic random walk after 8820 steps, run timeout after 6002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 8820 steps, saw 6609 distinct states, run finished after 6005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 74 properties.
[2023-03-18 06:34:52] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-18 06:34:52] [INFO ] Invariant cache hit.
[2023-03-18 06:34:54] [INFO ] After 2433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:74
[2023-03-18 06:34:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-18 06:35:19] [INFO ] After 20751ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :68
[2023-03-18 06:35:20] [INFO ] State equation strengthened by 5248 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: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-18 06:35:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 06:35:20] [INFO ] After 26208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:74
Fused 74 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 152 out of 1967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1580 edges and 1967 vertex of which 109 / 1967 are part of one of the 41 SCC in 23 ms
Free SCC test removed 68 places
Drop transitions removed 3829 transitions
Ensure Unique test removed 462 transitions
Reduce isomorphic transitions removed 4291 transitions.
Graph (complete) has 126304 edges and 1899 vertex of which 1898 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.117 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 1898 transition count 145285
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1893 transition count 145285
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 13 place count 1893 transition count 145283
Deduced a syphon composed of 2 places in 66 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 1891 transition count 145283
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 24 place count 1884 transition count 145276
Iterating global reduction 2 with 7 rules applied. Total rules applied 31 place count 1884 transition count 145276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 38 place count 1884 transition count 145269
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 44 place count 1878 transition count 145257
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 1878 transition count 145257
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 56 place count 1878 transition count 145251
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 59 place count 1875 transition count 145245
Iterating global reduction 4 with 3 rules applied. Total rules applied 62 place count 1875 transition count 145245
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 1875 transition count 145242
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 63 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 117 place count 1849 transition count 145216
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 124 place count 1849 transition count 145209
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 27 places in 62 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 178 place count 1822 transition count 145304
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 201 place count 1822 transition count 145281
Free-agglomeration rule applied 18 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 219 place count 1822 transition count 145261
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 533 transitions
Reduce isomorphic transitions removed 541 transitions.
Iterating post reduction 7 with 559 rules applied. Total rules applied 778 place count 1804 transition count 144720
Free-agglomeration rule (complex) applied 117 times with reduction of 2647 identical transitions.
Iterating global reduction 8 with 117 rules applied. Total rules applied 895 place count 1804 transition count 170019
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 133 transitions
Ensure Unique test removed 6556 transitions
Reduce isomorphic transitions removed 6689 transitions.
Iterating post reduction 8 with 6806 rules applied. Total rules applied 7701 place count 1687 transition count 163330
Applied a total of 7701 rules in 8662 ms. Remains 1687 /1967 variables (removed 280) and now considering 163330/149582 (removed -13748) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8672 ms. Remains : 1687/1967 places, 163330/149582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1590 ms. (steps per millisecond=6 ) properties (out of 69) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=8 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 68) seen :0
Interrupted probabilistic random walk after 7991 steps, run timeout after 6001 ms. (steps per millisecond=1 ) properties seen :{55=1}
Probabilistic random walk after 7991 steps, saw 6596 distinct states, run finished after 6002 ms. (steps per millisecond=1 ) properties seen :1
Running SMT prover for 67 properties.
[2023-03-18 06:35:38] [INFO ] Flow matrix only has 120565 transitions (discarded 42765 similar events)
// Phase 1: matrix 120565 rows 1687 cols
[2023-03-18 06:35:39] [INFO ] Computed 10 place invariants in 633 ms
[2023-03-18 06:35:41] [INFO ] After 1841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:67
[2023-03-18 06:35:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-18 06:36:06] [INFO ] After 21666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :66
[2023-03-18 06:36:08] [INFO ] State equation strengthened by 5987 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: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-18 06:36:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 06:36:08] [INFO ] After 26999ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:67
Fused 67 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 149 out of 1687 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1687/1687 places, 163330/163330 transitions.
Applied a total of 0 rules in 1016 ms. Remains 1687 /1687 variables (removed 0) and now considering 163330/163330 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1016 ms. Remains : 1687/1687 places, 163330/163330 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1617 ms. (steps per millisecond=6 ) properties (out of 67) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 66) seen :0
Interrupted probabilistic random walk after 8982 steps, run timeout after 6004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 8982 steps, saw 7403 distinct states, run finished after 6005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 66 properties.
[2023-03-18 06:36:18] [INFO ] Flow matrix only has 120565 transitions (discarded 42765 similar events)
[2023-03-18 06:36:18] [INFO ] Invariant cache hit.
[2023-03-18 06:36:19] [INFO ] After 1844ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:66
[2023-03-18 06:36:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-18 06:36:44] [INFO ] After 21640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-03-18 06:36:45] [INFO ] State equation strengthened by 5987 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: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-18 06:36:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 06:36:45] [INFO ] After 25954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:66
Fused 66 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 144 out of 1687 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1687/1687 places, 163330/163330 transitions.
Graph (trivial) has 948 edges and 1687 vertex of which 3 / 1687 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Applied a total of 1 rules in 753 ms. Remains 1685 /1687 variables (removed 2) and now considering 163325/163330 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 753 ms. Remains : 1685/1687 places, 163325/163330 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA RERS2020-PT-pb105-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 06:36:50] [INFO ] Flatten gal took : 3114 ms
[2023-03-18 06:36:53] [INFO ] Flatten gal took : 3493 ms
[2023-03-18 06:37:00] [INFO ] Input system was already deterministic with 149582 transitions.
Support contains 138 out of 1967 places (down from 144) after GAL structural reductions.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.441 ms
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 214 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 1967/1967 places, 149582/149582 transitions.
[2023-03-18 06:37:04] [INFO ] Flatten gal took : 2917 ms
[2023-03-18 06:37:07] [INFO ] Flatten gal took : 3698 ms
[2023-03-18 06:37:14] [INFO ] Input system was already deterministic with 149582 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1666 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.124 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 57 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 58 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 77 place count 1863 transition count 148934
Applied a total of 77 rules in 4027 ms. Remains 1863 /1967 variables (removed 104) and now considering 148934/149582 (removed 648) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4030 ms. Remains : 1863/1967 places, 148934/149582 transitions.
[2023-03-18 06:37:22] [INFO ] Flatten gal took : 3018 ms
[2023-03-18 06:37:25] [INFO ] Flatten gal took : 3462 ms
[2023-03-18 06:37:32] [INFO ] Input system was already deterministic with 148934 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 891 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6048 steps, run timeout after 3004 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 6048 steps, saw 4451 distinct states, run finished after 3004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 06:37:36] [INFO ] Flow matrix only has 104664 transitions (discarded 44270 similar events)
// Phase 1: matrix 104664 rows 1863 cols
[2023-03-18 06:37:37] [INFO ] Computed 10 place invariants in 400 ms
[2023-03-18 06:37:37] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:37:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-18 06:38:02] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1863 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1863/1863 places, 148934/148934 transitions.
Drop transitions removed 3747 transitions
Reduce isomorphic transitions removed 3747 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3750 rules applied. Total rules applied 3750 place count 1863 transition count 145184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3753 place count 1860 transition count 145184
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 67 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 3787 place count 1843 transition count 145167
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 3793 place count 1843 transition count 145161
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 67 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 3849 place count 1815 transition count 145257
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 3872 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 4 with 25 rules applied. Total rules applied 3897 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 4 with 611 rules applied. Total rules applied 4508 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4511 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 5 with 56 rules applied. Total rules applied 4567 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 4570 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 4576 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4577 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4578 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 8 with 116 rules applied. Total rules applied 4694 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 8 with 7890 rules applied. Total rules applied 12584 place count 1667 transition count 165221
Applied a total of 12584 rules in 9240 ms. Remains 1667 /1863 variables (removed 196) and now considering 165221/148934 (removed -16287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9245 ms. Remains : 1667/1863 places, 165221/148934 transitions.
Interrupted random walk after 287047 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 555277 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 0
Interrupted probabilistic random walk after 133387 steps, run timeout after 105006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 133387 steps, saw 107345 distinct states, run finished after 105006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 06:40:31] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2023-03-18 06:40:32] [INFO ] Computed 10 place invariants in 560 ms
[2023-03-18 06:40:32] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:40:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-18 06:41:09] [INFO ] After 37196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:41:11] [INFO ] State equation strengthened by 6068 read => feed constraints.
[2023-03-18 06:41:32] [INFO ] After 20487ms SMT Verify possible using 6068 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 06:41:47] [INFO ] Deduced a trap composed of 24 places in 13204 ms of which 5 ms to minimize.
[2023-03-18 06:42:02] [INFO ] Deduced a trap composed of 143 places in 13677 ms of which 3 ms to minimize.
[2023-03-18 06:42:16] [INFO ] Deduced a trap composed of 28 places in 12994 ms of which 3 ms to minimize.
[2023-03-18 06:42:31] [INFO ] Deduced a trap composed of 221 places in 12655 ms of which 3 ms to minimize.
[2023-03-18 06:42:45] [INFO ] Deduced a trap composed of 134 places in 12875 ms of which 2 ms to minimize.
[2023-03-18 06:43:01] [INFO ] Deduced a trap composed of 29 places in 14846 ms of which 5 ms to minimize.
[2023-03-18 06:43:16] [INFO ] Deduced a trap composed of 219 places in 13260 ms of which 2 ms to minimize.
[2023-03-18 06:43:32] [INFO ] Deduced a trap composed of 218 places in 14368 ms of which 2 ms to minimize.
[2023-03-18 06:43:48] [INFO ] Deduced a trap composed of 115 places in 14107 ms of which 2 ms to minimize.
[2023-03-18 06:44:04] [INFO ] Deduced a trap composed of 245 places in 14941 ms of which 2 ms to minimize.
[2023-03-18 06:44:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 154503 ms
[2023-03-18 06:44:07] [INFO ] After 176053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1662 ms.
[2023-03-18 06:44:09] [INFO ] After 217022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 815 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 817 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 823 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-18 06:44:11] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:44:11] [INFO ] Invariant cache hit.
[2023-03-18 06:44:20] [INFO ] Implicit Places using invariants in 8737 ms returned []
Implicit Place search using SMT only with invariants took 8738 ms to find 0 implicit places.
[2023-03-18 06:44:20] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:44:20] [INFO ] Invariant cache hit.
[2023-03-18 06:44:50] [INFO ] Performed 92786/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 06:45:13] [INFO ] Dead Transitions using invariants and state equation in 53149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62725 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 10045 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 06:45:23] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:45:23] [INFO ] Invariant cache hit.
[2023-03-18 06:45:23] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-18 06:45:59] [INFO ] After 36285ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-18 06:46:01] [INFO ] State equation strengthened by 6068 read => feed constraints.
[2023-03-18 06:46:17] [INFO ] After 16461ms SMT Verify possible using 6068 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-18 06:46:33] [INFO ] Deduced a trap composed of 24 places in 14055 ms of which 2 ms to minimize.
[2023-03-18 06:46:47] [INFO ] Deduced a trap composed of 28 places in 12706 ms of which 2 ms to minimize.
[2023-03-18 06:47:02] [INFO ] Deduced a trap composed of 47 places in 12849 ms of which 2 ms to minimize.
[2023-03-18 06:47:16] [INFO ] Deduced a trap composed of 88 places in 12720 ms of which 3 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:46)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:225)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:669)
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-18 06:47:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 06:47:16] [INFO ] After 113332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Interrupted random walk after 254071 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 477779 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
Interrupted probabilistic random walk after 136820 steps, run timeout after 105001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 136820 steps, saw 110161 distinct states, run finished after 105003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 06:49:36] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:49:36] [INFO ] Invariant cache hit.
[2023-03-18 06:49:37] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:49:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-18 06:50:15] [INFO ] After 37840ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 06:50:16] [INFO ] State equation strengthened by 6068 read => feed constraints.
[2023-03-18 06:50:35] [INFO ] After 18776ms SMT Verify possible using 6068 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 06:50:50] [INFO ] Deduced a trap composed of 24 places in 13735 ms of which 2 ms to minimize.
[2023-03-18 06:51:08] [INFO ] Deduced a trap composed of 143 places in 16274 ms of which 3 ms to minimize.
[2023-03-18 06:51:23] [INFO ] Deduced a trap composed of 28 places in 14032 ms of which 2 ms to minimize.
[2023-03-18 06:51:37] [INFO ] Deduced a trap composed of 221 places in 12720 ms of which 2 ms to minimize.
[2023-03-18 06:51:53] [INFO ] Deduced a trap composed of 134 places in 13635 ms of which 2 ms to minimize.
[2023-03-18 06:52:07] [INFO ] Deduced a trap composed of 29 places in 12776 ms of which 2 ms to minimize.
[2023-03-18 06:52:21] [INFO ] Deduced a trap composed of 219 places in 12715 ms of which 2 ms to minimize.
[2023-03-18 06:52:35] [INFO ] Deduced a trap composed of 218 places in 12614 ms of which 2 ms to minimize.
[2023-03-18 06:52:49] [INFO ] Deduced a trap composed of 115 places in 12057 ms of which 2 ms to minimize.
[2023-03-18 06:53:02] [INFO ] Deduced a trap composed of 245 places in 12190 ms of which 1 ms to minimize.
[2023-03-18 06:53:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 149987 ms
[2023-03-18 06:53:06] [INFO ] After 169816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1587 ms.
[2023-03-18 06:53:07] [INFO ] After 210524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 825 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 827 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 812 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-18 06:53:09] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:53:09] [INFO ] Invariant cache hit.
[2023-03-18 06:53:18] [INFO ] Implicit Places using invariants in 9120 ms returned []
Implicit Place search using SMT only with invariants took 9126 ms to find 0 implicit places.
[2023-03-18 06:53:18] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:53:18] [INFO ] Invariant cache hit.
[2023-03-18 06:53:48] [INFO ] Performed 93045/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 06:54:10] [INFO ] Dead Transitions using invariants and state equation in 52329 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62286 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 12187 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 06:54:23] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:54:23] [INFO ] Invariant cache hit.
[2023-03-18 06:54:23] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-18 06:55:00] [INFO ] After 37434ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-18 06:55:02] [INFO ] State equation strengthened by 6068 read => feed constraints.
[2023-03-18 06:55:24] [INFO ] After 21423ms SMT Verify possible using 6068 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-18 06:55:40] [INFO ] Deduced a trap composed of 24 places in 14325 ms of which 2 ms to minimize.
[2023-03-18 06:55:57] [INFO ] Deduced a trap composed of 28 places in 15813 ms of which 6 ms to minimize.
[2023-03-18 06:56:13] [INFO ] Deduced a trap composed of 47 places in 14322 ms of which 1 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:669)
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-18 06:56:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 06:56:13] [INFO ] After 110273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 990 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4291 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4291 steps, saw 3560 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 06:56:17] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:56:18] [INFO ] Invariant cache hit.
[2023-03-18 06:56:18] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:56:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-18 06:56:43] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 728 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 734 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1032 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4271 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4271 steps, saw 3543 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 06:56:48] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:56:48] [INFO ] Invariant cache hit.
[2023-03-18 06:56:48] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:56:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-18 06:57:13] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 719 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 719 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 706 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-18 06:57:15] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:57:15] [INFO ] Invariant cache hit.
[2023-03-18 06:57:23] [INFO ] Implicit Places using invariants in 8953 ms returned []
Implicit Place search using SMT only with invariants took 8958 ms to find 0 implicit places.
[2023-03-18 06:57:23] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:57:23] [INFO ] Invariant cache hit.
[2023-03-18 06:57:54] [INFO ] Performed 93147/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 06:58:17] [INFO ] Dead Transitions using invariants and state equation in 53350 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63030 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1451 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4067 steps, run timeout after 3007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4067 steps, saw 3386 distinct states, run finished after 3008 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 06:58:22] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:58:22] [INFO ] Invariant cache hit.
[2023-03-18 06:58:22] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:58:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-18 06:58:47] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 717 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 720 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1156 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4124 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4124 steps, saw 3434 distinct states, run finished after 3007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 06:58:52] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:58:52] [INFO ] Invariant cache hit.
[2023-03-18 06:58:52] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 06:58:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-18 06:59:17] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 723 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 723 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 708 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-18 06:59:19] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:59:19] [INFO ] Invariant cache hit.
[2023-03-18 06:59:28] [INFO ] Implicit Places using invariants in 8720 ms returned []
Implicit Place search using SMT only with invariants took 8720 ms to find 0 implicit places.
[2023-03-18 06:59:28] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-18 06:59:28] [INFO ] Invariant cache hit.
[2023-03-18 06:59:58] [INFO ] Performed 92653/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 07:00:20] [INFO ] Dead Transitions using invariants and state equation in 52860 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62302 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Graph (trivial) has 49645 edges and 1667 vertex of which 1435 / 1667 are part of one of the 192 SCC in 8 ms
Free SCC test removed 1243 places
Drop transitions removed 71062 transitions
Ensure Unique test removed 81477 transitions
Reduce isomorphic transitions removed 152539 transitions.
Graph (complete) has 9078 edges and 424 vertex of which 403 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.5 ms
Discarding 21 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 56 transitions
Ensure Unique test removed 364 transitions
Reduce isomorphic transitions removed 420 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 424 rules applied. Total rules applied 426 place count 403 transition count 12250
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 430 place count 399 transition count 12250
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 437 place count 392 transition count 12237
Iterating global reduction 2 with 7 rules applied. Total rules applied 444 place count 392 transition count 12237
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 447 place count 389 transition count 12222
Iterating global reduction 2 with 3 rules applied. Total rules applied 450 place count 389 transition count 12222
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 464 place count 382 transition count 12215
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 2 with 123 rules applied. Total rules applied 587 place count 382 transition count 12092
Drop transitions removed 5875 transitions
Redundant transition composition rules discarded 5875 transitions
Iterating global reduction 3 with 5875 rules applied. Total rules applied 6462 place count 382 transition count 6217
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 5422 edges and 378 vertex of which 341 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.2 ms
Discarding 37 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Iterating post reduction 3 with 21 rules applied. Total rules applied 6483 place count 341 transition count 6184
Drop transitions removed 731 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 749 transitions.
Iterating post reduction 4 with 749 rules applied. Total rules applied 7232 place count 341 transition count 5435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 7232 place count 341 transition count 5434
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 7234 place count 340 transition count 5434
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 7245 place count 329 transition count 5414
Iterating global reduction 5 with 11 rules applied. Total rules applied 7256 place count 329 transition count 5414
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 7258 place count 329 transition count 5412
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 7260 place count 327 transition count 5408
Iterating global reduction 6 with 2 rules applied. Total rules applied 7262 place count 327 transition count 5408
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 7263 place count 326 transition count 5407
Iterating global reduction 6 with 1 rules applied. Total rules applied 7264 place count 326 transition count 5407
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 7274 place count 321 transition count 5402
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 6 with 36 rules applied. Total rules applied 7310 place count 321 transition count 5366
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 7321 place count 321 transition count 5355
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 7346 place count 310 transition count 5341
Drop transitions removed 122 transitions
Redundant transition composition rules discarded 122 transitions
Iterating global reduction 7 with 122 rules applied. Total rules applied 7468 place count 310 transition count 5219
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 7479 place count 310 transition count 5208
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 7519 place count 299 transition count 5179
Drop transitions removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 8 with 76 rules applied. Total rules applied 7595 place count 299 transition count 5103
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 7598 place count 299 transition count 5100
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 7615 place count 296 transition count 5086
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 7639 place count 296 transition count 5062
Free-agglomeration rule (complex) applied 13 times with reduction of 216 identical transitions.
Iterating global reduction 9 with 13 rules applied. Total rules applied 7652 place count 296 transition count 5565
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 278 transitions
Reduce isomorphic transitions removed 278 transitions.
Iterating post reduction 9 with 291 rules applied. Total rules applied 7943 place count 283 transition count 5287
Drop transitions removed 158 transitions
Redundant transition composition rules discarded 158 transitions
Iterating global reduction 10 with 158 rules applied. Total rules applied 8101 place count 283 transition count 5129
Partial Free-agglomeration rule applied 107 times.
Drop transitions removed 107 transitions
Iterating global reduction 10 with 107 rules applied. Total rules applied 8208 place count 283 transition count 5129
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 8212 place count 283 transition count 5125
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 8215 place count 280 transition count 5122
Iterating global reduction 11 with 3 rules applied. Total rules applied 8218 place count 280 transition count 5122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 8224 place count 280 transition count 5116
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 8226 place count 280 transition count 5114
Partial Free-agglomeration rule applied 93 times.
Drop transitions removed 93 transitions
Iterating global reduction 12 with 93 rules applied. Total rules applied 8319 place count 280 transition count 5114
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 8333 place count 280 transition count 5100
Applied a total of 8333 rules in 5066 ms. Remains 280 /1667 variables (removed 1387) and now considering 5100/165221 (removed 160121) transitions.
Running SMT prover for 1 properties.
[2023-03-18 07:00:26] [INFO ] Flow matrix only has 4940 transitions (discarded 160 similar events)
// Phase 1: matrix 4940 rows 280 cols
[2023-03-18 07:00:26] [INFO ] Computed 0 place invariants in 40 ms
[2023-03-18 07:00:26] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:00:27] [INFO ] After 715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:00:27] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-18 07:00:27] [INFO ] After 111ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 07:00:27] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-18 07:00:27] [INFO ] After 1124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 212 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 1967/1967 places, 149582/149582 transitions.
[2023-03-18 07:00:31] [INFO ] Flatten gal took : 3123 ms
[2023-03-18 07:00:34] [INFO ] Flatten gal took : 3464 ms
[2023-03-18 07:00:40] [INFO ] Input system was already deterministic with 149582 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 242 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 1967/1967 places, 149582/149582 transitions.
[2023-03-18 07:00:45] [INFO ] Flatten gal took : 3456 ms
[2023-03-18 07:00:48] [INFO ] Flatten gal took : 3297 ms
[2023-03-18 07:00:56] [INFO ] Input system was already deterministic with 149582 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1657 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.81 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1894 transition count 148993
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1892 transition count 148993
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1892 transition count 148990
Deduced a syphon composed of 3 places in 65 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1889 transition count 148990
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1883 transition count 148978
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1883 transition count 148978
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1883 transition count 148972
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1877 transition count 148960
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1877 transition count 148960
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1877 transition count 148954
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1874 transition count 148948
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1874 transition count 148948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1874 transition count 148945
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 66 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 77 place count 1864 transition count 148935
Applied a total of 77 rules in 4084 ms. Remains 1864 /1967 variables (removed 103) and now considering 148935/149582 (removed 647) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4087 ms. Remains : 1864/1967 places, 148935/149582 transitions.
[2023-03-18 07:01:03] [INFO ] Flatten gal took : 3098 ms
[2023-03-18 07:01:07] [INFO ] Flatten gal took : 3254 ms
[2023-03-18 07:01:14] [INFO ] Input system was already deterministic with 148935 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 352 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 1967/1967 places, 149582/149582 transitions.
[2023-03-18 07:01:18] [INFO ] Flatten gal took : 3223 ms
[2023-03-18 07:01:22] [INFO ] Flatten gal took : 3653 ms
[2023-03-18 07:01:28] [INFO ] Input system was already deterministic with 149582 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 239 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 1967/1967 places, 149582/149582 transitions.
[2023-03-18 07:01:32] [INFO ] Flatten gal took : 3093 ms
[2023-03-18 07:01:36] [INFO ] Flatten gal took : 3573 ms
[2023-03-18 07:01:43] [INFO ] Input system was already deterministic with 149582 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1663 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 4 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.84 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 61 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 61 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 77 place count 1863 transition count 148934
Applied a total of 77 rules in 4802 ms. Remains 1863 /1967 variables (removed 104) and now considering 148934/149582 (removed 648) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4805 ms. Remains : 1863/1967 places, 148934/149582 transitions.
[2023-03-18 07:01:51] [INFO ] Flatten gal took : 3057 ms
[2023-03-18 07:01:55] [INFO ] Flatten gal took : 3496 ms
[2023-03-18 07:02:02] [INFO ] Input system was already deterministic with 148934 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 238 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 1967/1967 places, 149582/149582 transitions.
[2023-03-18 07:02:06] [INFO ] Flatten gal took : 3457 ms
[2023-03-18 07:02:09] [INFO ] Flatten gal took : 3351 ms
[2023-03-18 07:02:16] [INFO ] Input system was already deterministic with 149582 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 234 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 1967/1967 places, 149582/149582 transitions.
[2023-03-18 07:02:20] [INFO ] Flatten gal took : 3192 ms
[2023-03-18 07:02:24] [INFO ] Flatten gal took : 3710 ms
[2023-03-18 07:02:31] [INFO ] Input system was already deterministic with 149582 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 218 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 1967/1967 places, 149582/149582 transitions.
[2023-03-18 07:02:35] [INFO ] Flatten gal took : 3014 ms
[2023-03-18 07:02:38] [INFO ] Flatten gal took : 3530 ms
[2023-03-18 07:02:45] [INFO ] Input system was already deterministic with 149582 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 322 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 1967/1967 places, 149582/149582 transitions.
[2023-03-18 07:02:49] [INFO ] Flatten gal took : 3037 ms
[2023-03-18 07:02:52] [INFO ] Flatten gal took : 3480 ms
[2023-03-18 07:02:59] [INFO ] Input system was already deterministic with 149582 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1657 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 5 ms
Free SCC test removed 70 places
Ensure Unique test removed 582 transitions
Reduce isomorphic transitions removed 582 transitions.
Graph (complete) has 143638 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.84 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1895 transition count 148996
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1893 transition count 148996
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1893 transition count 148993
Deduced a syphon composed of 3 places in 58 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1890 transition count 148993
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1884 transition count 148981
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1884 transition count 148981
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1884 transition count 148975
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1878 transition count 148963
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1878 transition count 148963
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1878 transition count 148957
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1875 transition count 148951
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1875 transition count 148951
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1875 transition count 148948
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 58 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 77 place count 1865 transition count 148938
Applied a total of 77 rules in 4277 ms. Remains 1865 /1967 variables (removed 102) and now considering 148938/149582 (removed 644) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4280 ms. Remains : 1865/1967 places, 148938/149582 transitions.
[2023-03-18 07:03:07] [INFO ] Flatten gal took : 3016 ms
[2023-03-18 07:03:11] [INFO ] Flatten gal took : 3574 ms
[2023-03-18 07:03:17] [INFO ] Input system was already deterministic with 148938 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 215 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 1967/1967 places, 149582/149582 transitions.
[2023-03-18 07:03:21] [INFO ] Flatten gal took : 3368 ms
[2023-03-18 07:03:25] [INFO ] Flatten gal took : 3393 ms
[2023-03-18 07:03:32] [INFO ] Input system was already deterministic with 149582 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 217 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 1967/1967 places, 149582/149582 transitions.
[2023-03-18 07:03:36] [INFO ] Flatten gal took : 3048 ms
[2023-03-18 07:03:39] [INFO ] Flatten gal took : 3626 ms
[2023-03-18 07:03:46] [INFO ] Input system was already deterministic with 149582 transitions.
[2023-03-18 07:03:50] [INFO ] Flatten gal took : 3424 ms
[2023-03-18 07:03:53] [INFO ] Flatten gal took : 3432 ms
[2023-03-18 07:03:53] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-18 07:03:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1967 places, 149582 transitions and 594939 arcs took 291 ms.
Total runtime 1833848 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: 1967 NrTr: 149582 NrArc: 594939)

parse formulas
formulas created successfully
place and transition orderings generation:1m29.680sec

net check time: 0m 0.152sec

init dd package: 0m 2.522sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9969348 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15912072 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: 3m 7.411sec

1967 5188 5500 5583 5679 8121 8588 8792 8886 9085 9240 8536 10898 10909 10993 11088 11163 10600 12675 12675 12520 11979 11868 11813 11814 10030 11876 11886 11968 12063 12138 11575 10308 12096 12229 12288 12288 12458 11895 13883 14358 14533 14627

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="RERS2020-PT-pb105"
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 RERS2020-PT-pb105, 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 r330-tall-167889203000250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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