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.r298-tall-167873952100738.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 PolyORBNT-PT-S05J60, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952100738
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 39K Feb 25 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 208K Feb 25 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 319K Feb 25 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Feb 25 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 154K Feb 25 23:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 663K Feb 25 23:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 PolyORBNT-PT-S05J60-CTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J60-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679655111912

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=PolyORBNT-PT-S05J60
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 10:51:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 10:51:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 10:51:53] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-24 10:51:53] [INFO ] Transformed 909 places.
[2023-03-24 10:51:53] [INFO ] Transformed 1970 transitions.
[2023-03-24 10:51:53] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
[2023-03-24 10:51:53] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-24 10:51:53] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-24 10:51:53] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-24 10:51:53] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-24 10:51:53] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 852 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Applied a total of 0 rules in 37 ms. Remains 909 /909 variables (removed 0) and now considering 1315/1315 (removed 0) transitions.
[2023-03-24 10:51:53] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2023-03-24 10:51:53] [INFO ] Computed 142 place invariants in 102 ms
[2023-03-24 10:51:56] [INFO ] Dead Transitions using invariants and state equation in 2430 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-24 10:51:56] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 909 cols
[2023-03-24 10:51:56] [INFO ] Computed 142 place invariants in 55 ms
[2023-03-24 10:51:56] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-24 10:51:56] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-24 10:51:56] [INFO ] Invariant cache hit.
[2023-03-24 10:51:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 10:51:59] [INFO ] Implicit Places using invariants and state equation in 2758 ms returned []
Implicit Place search using SMT with State Equation took 3147 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 909/909 places, 1220/1315 transitions.
Applied a total of 0 rules in 18 ms. Remains 909 /909 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5655 ms. Remains : 909/909 places, 1220/1315 transitions.
Support contains 852 out of 909 places after structural reductions.
[2023-03-24 10:51:59] [INFO ] Flatten gal took : 177 ms
[2023-03-24 10:52:00] [INFO ] Flatten gal took : 120 ms
[2023-03-24 10:52:00] [INFO ] Input system was already deterministic with 1220 transitions.
Incomplete random walk after 10000 steps, including 690 resets, run finished after 671 ms. (steps per millisecond=14 ) properties (out of 74) seen :52
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-24 10:52:01] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-24 10:52:01] [INFO ] Invariant cache hit.
[2023-03-24 10:52:02] [INFO ] [Real]Absence check using 112 positive place invariants in 24 ms returned sat
[2023-03-24 10:52:02] [INFO ] [Real]Absence check using 112 positive and 30 generalized place invariants in 46 ms returned sat
[2023-03-24 10:52:02] [INFO ] After 553ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0 real:8
[2023-03-24 10:52:02] [INFO ] [Nat]Absence check using 112 positive place invariants in 24 ms returned sat
[2023-03-24 10:52:02] [INFO ] [Nat]Absence check using 112 positive and 30 generalized place invariants in 48 ms returned sat
[2023-03-24 10:52:07] [INFO ] After 4358ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :5
[2023-03-24 10:52:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 10:52:12] [INFO ] After 5446ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :11 sat :5
[2023-03-24 10:52:13] [INFO ] Deduced a trap composed of 378 places in 337 ms of which 5 ms to minimize.
[2023-03-24 10:52:13] [INFO ] Deduced a trap composed of 381 places in 313 ms of which 1 ms to minimize.
[2023-03-24 10:52:13] [INFO ] Deduced a trap composed of 400 places in 298 ms of which 2 ms to minimize.
[2023-03-24 10:52:14] [INFO ] Deduced a trap composed of 388 places in 317 ms of which 1 ms to minimize.
[2023-03-24 10:52:14] [INFO ] Deduced a trap composed of 385 places in 309 ms of which 1 ms to minimize.
[2023-03-24 10:52:14] [INFO ] Deduced a trap composed of 375 places in 301 ms of which 1 ms to minimize.
[2023-03-24 10:52:15] [INFO ] Deduced a trap composed of 365 places in 318 ms of which 2 ms to minimize.
[2023-03-24 10:52:15] [INFO ] Deduced a trap composed of 398 places in 329 ms of which 1 ms to minimize.
[2023-03-24 10:52:16] [INFO ] Deduced a trap composed of 386 places in 439 ms of which 1 ms to minimize.
[2023-03-24 10:52:16] [INFO ] Deduced a trap composed of 369 places in 312 ms of which 1 ms to minimize.
[2023-03-24 10:52:16] [INFO ] Deduced a trap composed of 381 places in 315 ms of which 1 ms to minimize.
[2023-03-24 10:52:17] [INFO ] Deduced a trap composed of 375 places in 307 ms of which 1 ms to minimize.
[2023-03-24 10:52:17] [INFO ] Deduced a trap composed of 372 places in 305 ms of which 0 ms to minimize.
[2023-03-24 10:52:18] [INFO ] Deduced a trap composed of 372 places in 306 ms of which 1 ms to minimize.
[2023-03-24 10:52:18] [INFO ] Deduced a trap composed of 366 places in 296 ms of which 0 ms to minimize.
[2023-03-24 10:52:18] [INFO ] Deduced a trap composed of 372 places in 296 ms of which 0 ms to minimize.
[2023-03-24 10:52:19] [INFO ] Deduced a trap composed of 375 places in 317 ms of which 0 ms to minimize.
[2023-03-24 10:52:19] [INFO ] Deduced a trap composed of 393 places in 315 ms of which 0 ms to minimize.
[2023-03-24 10:52:20] [INFO ] Deduced a trap composed of 390 places in 321 ms of which 1 ms to minimize.
[2023-03-24 10:52:20] [INFO ] Deduced a trap composed of 378 places in 311 ms of which 1 ms to minimize.
[2023-03-24 10:52:20] [INFO ] Deduced a trap composed of 377 places in 312 ms of which 1 ms to minimize.
[2023-03-24 10:52:21] [INFO ] Deduced a trap composed of 378 places in 311 ms of which 3 ms to minimize.
[2023-03-24 10:52:21] [INFO ] Deduced a trap composed of 369 places in 294 ms of which 1 ms to minimize.
[2023-03-24 10:52:22] [INFO ] Deduced a trap composed of 372 places in 327 ms of which 1 ms to minimize.
[2023-03-24 10:52:22] [INFO ] Deduced a trap composed of 378 places in 302 ms of which 0 ms to minimize.
[2023-03-24 10:52:23] [INFO ] Deduced a trap composed of 372 places in 335 ms of which 1 ms to minimize.
[2023-03-24 10:52:23] [INFO ] Deduced a trap composed of 375 places in 317 ms of which 0 ms to minimize.
[2023-03-24 10:52:24] [INFO ] Deduced a trap composed of 381 places in 298 ms of which 0 ms to minimize.
[2023-03-24 10:52:24] [INFO ] Deduced a trap composed of 360 places in 339 ms of which 1 ms to minimize.
[2023-03-24 10:52:24] [INFO ] Deduced a trap composed of 372 places in 304 ms of which 0 ms to minimize.
[2023-03-24 10:52:25] [INFO ] Deduced a trap composed of 402 places in 327 ms of which 0 ms to minimize.
[2023-03-24 10:52:25] [INFO ] Deduced a trap composed of 387 places in 305 ms of which 0 ms to minimize.
[2023-03-24 10:52:25] [INFO ] Deduced a trap composed of 366 places in 322 ms of which 0 ms to minimize.
[2023-03-24 10:52:26] [INFO ] Deduced a trap composed of 381 places in 293 ms of which 1 ms to minimize.
[2023-03-24 10:52:26] [INFO ] Deduced a trap composed of 360 places in 288 ms of which 2 ms to minimize.
[2023-03-24 10:52:27] [INFO ] Deduced a trap composed of 369 places in 315 ms of which 1 ms to minimize.
[2023-03-24 10:52:27] [INFO ] Deduced a trap composed of 369 places in 309 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: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-24 10:52:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 10:52:27] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0 real:8
Fused 16 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 11 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 904 transition count 1156
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 133 place count 840 transition count 1156
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 133 place count 840 transition count 1091
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 263 place count 775 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 264 place count 774 transition count 1090
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 774 transition count 1090
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 269 place count 772 transition count 1088
Applied a total of 269 rules in 279 ms. Remains 772 /909 variables (removed 137) and now considering 1088/1220 (removed 132) transitions.
[2023-03-24 10:52:27] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
// Phase 1: matrix 1084 rows 772 cols
[2023-03-24 10:52:27] [INFO ] Computed 137 place invariants in 18 ms
[2023-03-24 10:52:28] [INFO ] Dead Transitions using invariants and state equation in 1132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1413 ms. Remains : 772/909 places, 1088/1220 transitions.
Incomplete random walk after 10000 steps, including 518 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 10:52:29] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
[2023-03-24 10:52:29] [INFO ] Invariant cache hit.
[2023-03-24 10:52:29] [INFO ] [Real]Absence check using 111 positive place invariants in 32 ms returned sat
[2023-03-24 10:52:29] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 38 ms returned sat
[2023-03-24 10:52:29] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 10:52:29] [INFO ] [Nat]Absence check using 111 positive place invariants in 20 ms returned sat
[2023-03-24 10:52:29] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 39 ms returned sat
[2023-03-24 10:52:30] [INFO ] After 1180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 10:52:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 10:52:30] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 10:52:31] [INFO ] Deduced a trap composed of 238 places in 251 ms of which 1 ms to minimize.
[2023-03-24 10:52:31] [INFO ] Deduced a trap composed of 264 places in 245 ms of which 1 ms to minimize.
[2023-03-24 10:52:31] [INFO ] Deduced a trap composed of 259 places in 240 ms of which 1 ms to minimize.
[2023-03-24 10:52:31] [INFO ] Deduced a trap composed of 257 places in 247 ms of which 0 ms to minimize.
[2023-03-24 10:52:32] [INFO ] Deduced a trap composed of 244 places in 248 ms of which 1 ms to minimize.
[2023-03-24 10:52:32] [INFO ] Deduced a trap composed of 266 places in 239 ms of which 0 ms to minimize.
[2023-03-24 10:52:32] [INFO ] Deduced a trap composed of 244 places in 247 ms of which 1 ms to minimize.
[2023-03-24 10:52:33] [INFO ] Deduced a trap composed of 272 places in 260 ms of which 5 ms to minimize.
[2023-03-24 10:52:33] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 1 ms to minimize.
[2023-03-24 10:52:34] [INFO ] Deduced a trap composed of 238 places in 255 ms of which 1 ms to minimize.
[2023-03-24 10:52:34] [INFO ] Deduced a trap composed of 250 places in 247 ms of which 1 ms to minimize.
[2023-03-24 10:52:34] [INFO ] Deduced a trap composed of 254 places in 257 ms of which 1 ms to minimize.
[2023-03-24 10:52:35] [INFO ] Deduced a trap composed of 257 places in 234 ms of which 1 ms to minimize.
[2023-03-24 10:52:36] [INFO ] Deduced a trap composed of 263 places in 252 ms of which 1 ms to minimize.
[2023-03-24 10:52:36] [INFO ] Deduced a trap composed of 251 places in 257 ms of which 0 ms to minimize.
[2023-03-24 10:52:37] [INFO ] Deduced a trap composed of 253 places in 244 ms of which 0 ms to minimize.
[2023-03-24 10:52:37] [INFO ] Deduced a trap composed of 262 places in 245 ms of which 1 ms to minimize.
[2023-03-24 10:52:37] [INFO ] Deduced a trap composed of 241 places in 239 ms of which 0 ms to minimize.
[2023-03-24 10:52:38] [INFO ] Deduced a trap composed of 257 places in 248 ms of which 0 ms to minimize.
[2023-03-24 10:52:38] [INFO ] Deduced a trap composed of 283 places in 258 ms of which 7 ms to minimize.
[2023-03-24 10:52:39] [INFO ] Deduced a trap composed of 266 places in 254 ms of which 1 ms to minimize.
[2023-03-24 10:52:39] [INFO ] Deduced a trap composed of 249 places in 248 ms of which 1 ms to minimize.
[2023-03-24 10:52:40] [INFO ] Deduced a trap composed of 250 places in 250 ms of which 1 ms to minimize.
[2023-03-24 10:52:40] [INFO ] Deduced a trap composed of 250 places in 237 ms of which 0 ms to minimize.
[2023-03-24 10:52:40] [INFO ] Deduced a trap composed of 268 places in 239 ms of which 1 ms to minimize.
[2023-03-24 10:52:41] [INFO ] Deduced a trap composed of 244 places in 237 ms of which 1 ms to minimize.
[2023-03-24 10:52:41] [INFO ] Deduced a trap composed of 238 places in 248 ms of which 1 ms to minimize.
[2023-03-24 10:52:41] [INFO ] Deduced a trap composed of 256 places in 235 ms of which 1 ms to minimize.
[2023-03-24 10:52:41] [INFO ] Deduced a trap composed of 259 places in 253 ms of which 1 ms to minimize.
[2023-03-24 10:52:42] [INFO ] Deduced a trap composed of 229 places in 259 ms of which 2 ms to minimize.
[2023-03-24 10:52:42] [INFO ] Deduced a trap composed of 239 places in 256 ms of which 1 ms to minimize.
[2023-03-24 10:52:43] [INFO ] Deduced a trap composed of 253 places in 257 ms of which 1 ms to minimize.
[2023-03-24 10:52:43] [INFO ] Deduced a trap composed of 242 places in 259 ms of which 1 ms to minimize.
[2023-03-24 10:52:44] [INFO ] Deduced a trap composed of 260 places in 258 ms of which 0 ms to minimize.
[2023-03-24 10:52:44] [INFO ] Deduced a trap composed of 250 places in 239 ms of which 1 ms to minimize.
[2023-03-24 10:52:45] [INFO ] Deduced a trap composed of 247 places in 245 ms of which 1 ms to minimize.
[2023-03-24 10:52:45] [INFO ] Deduced a trap composed of 272 places in 253 ms of which 0 ms to minimize.
[2023-03-24 10:52:46] [INFO ] Deduced a trap composed of 251 places in 237 ms of which 1 ms to minimize.
[2023-03-24 10:52:46] [INFO ] Deduced a trap composed of 238 places in 251 ms of which 1 ms to minimize.
[2023-03-24 10:52:47] [INFO ] Deduced a trap composed of 232 places in 238 ms of which 1 ms to minimize.
[2023-03-24 10:52:47] [INFO ] Deduced a trap composed of 241 places in 252 ms of which 1 ms to minimize.
[2023-03-24 10:52:48] [INFO ] Deduced a trap composed of 259 places in 247 ms of which 1 ms to minimize.
[2023-03-24 10:52:49] [INFO ] Deduced a trap composed of 262 places in 250 ms of which 0 ms to minimize.
[2023-03-24 10:52:50] [INFO ] Deduced a trap composed of 247 places in 243 ms of which 0 ms to minimize.
[2023-03-24 10:52:54] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 23583 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 10:52:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 10:52:54] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 1088/1088 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 772 transition count 1086
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 770 transition count 1086
Applied a total of 4 rules in 71 ms. Remains 770 /772 variables (removed 2) and now considering 1086/1088 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 770/772 places, 1086/1088 transitions.
Incomplete random walk after 10000 steps, including 517 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 168484 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168484 steps, saw 49491 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 10:52:57] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-24 10:52:57] [INFO ] Computed 137 place invariants in 26 ms
[2023-03-24 10:52:57] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2023-03-24 10:52:57] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 41 ms returned sat
[2023-03-24 10:52:57] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 10:52:57] [INFO ] [Nat]Absence check using 111 positive place invariants in 20 ms returned sat
[2023-03-24 10:52:57] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 39 ms returned sat
[2023-03-24 10:52:58] [INFO ] After 680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 10:52:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 10:52:59] [INFO ] After 1180ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 10:53:00] [INFO ] Deduced a trap composed of 257 places in 254 ms of which 1 ms to minimize.
[2023-03-24 10:53:00] [INFO ] Deduced a trap composed of 244 places in 251 ms of which 0 ms to minimize.
[2023-03-24 10:53:00] [INFO ] Deduced a trap composed of 267 places in 252 ms of which 1 ms to minimize.
[2023-03-24 10:53:00] [INFO ] Deduced a trap composed of 256 places in 252 ms of which 1 ms to minimize.
[2023-03-24 10:53:01] [INFO ] Deduced a trap composed of 239 places in 256 ms of which 1 ms to minimize.
[2023-03-24 10:53:01] [INFO ] Deduced a trap composed of 244 places in 255 ms of which 1 ms to minimize.
[2023-03-24 10:53:01] [INFO ] Deduced a trap composed of 260 places in 259 ms of which 0 ms to minimize.
[2023-03-24 10:53:02] [INFO ] Deduced a trap composed of 272 places in 248 ms of which 1 ms to minimize.
[2023-03-24 10:53:02] [INFO ] Deduced a trap composed of 235 places in 249 ms of which 1 ms to minimize.
[2023-03-24 10:53:03] [INFO ] Deduced a trap composed of 239 places in 236 ms of which 1 ms to minimize.
[2023-03-24 10:53:03] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 0 ms to minimize.
[2023-03-24 10:53:03] [INFO ] Deduced a trap composed of 240 places in 253 ms of which 0 ms to minimize.
[2023-03-24 10:53:04] [INFO ] Deduced a trap composed of 252 places in 254 ms of which 0 ms to minimize.
[2023-03-24 10:53:04] [INFO ] Deduced a trap composed of 239 places in 249 ms of which 1 ms to minimize.
[2023-03-24 10:53:04] [INFO ] Deduced a trap composed of 242 places in 257 ms of which 0 ms to minimize.
[2023-03-24 10:53:05] [INFO ] Deduced a trap composed of 252 places in 262 ms of which 1 ms to minimize.
[2023-03-24 10:53:05] [INFO ] Deduced a trap composed of 239 places in 256 ms of which 1 ms to minimize.
[2023-03-24 10:53:05] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 1 ms to minimize.
[2023-03-24 10:53:05] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 1 ms to minimize.
[2023-03-24 10:53:06] [INFO ] Deduced a trap composed of 249 places in 253 ms of which 1 ms to minimize.
[2023-03-24 10:53:06] [INFO ] Deduced a trap composed of 239 places in 242 ms of which 0 ms to minimize.
[2023-03-24 10:53:06] [INFO ] Deduced a trap composed of 264 places in 250 ms of which 1 ms to minimize.
[2023-03-24 10:53:07] [INFO ] Deduced a trap composed of 260 places in 244 ms of which 0 ms to minimize.
[2023-03-24 10:53:07] [INFO ] Deduced a trap composed of 254 places in 241 ms of which 1 ms to minimize.
[2023-03-24 10:53:07] [INFO ] Deduced a trap composed of 263 places in 249 ms of which 1 ms to minimize.
[2023-03-24 10:53:08] [INFO ] Deduced a trap composed of 245 places in 260 ms of which 1 ms to minimize.
[2023-03-24 10:53:08] [INFO ] Deduced a trap composed of 239 places in 254 ms of which 0 ms to minimize.
[2023-03-24 10:53:08] [INFO ] Deduced a trap composed of 240 places in 254 ms of which 1 ms to minimize.
[2023-03-24 10:53:09] [INFO ] Deduced a trap composed of 281 places in 255 ms of which 1 ms to minimize.
[2023-03-24 10:53:09] [INFO ] Deduced a trap composed of 248 places in 258 ms of which 0 ms to minimize.
[2023-03-24 10:53:09] [INFO ] Deduced a trap composed of 257 places in 255 ms of which 1 ms to minimize.
[2023-03-24 10:53:10] [INFO ] Deduced a trap composed of 233 places in 273 ms of which 1 ms to minimize.
[2023-03-24 10:53:10] [INFO ] Deduced a trap composed of 227 places in 254 ms of which 1 ms to minimize.
[2023-03-24 10:53:11] [INFO ] Deduced a trap composed of 242 places in 256 ms of which 0 ms to minimize.
[2023-03-24 10:53:11] [INFO ] Deduced a trap composed of 264 places in 297 ms of which 1 ms to minimize.
[2023-03-24 10:53:12] [INFO ] Deduced a trap composed of 254 places in 253 ms of which 1 ms to minimize.
[2023-03-24 10:53:12] [INFO ] Deduced a trap composed of 246 places in 282 ms of which 1 ms to minimize.
[2023-03-24 10:53:13] [INFO ] Deduced a trap composed of 227 places in 261 ms of which 1 ms to minimize.
[2023-03-24 10:53:13] [INFO ] Deduced a trap composed of 227 places in 247 ms of which 1 ms to minimize.
[2023-03-24 10:53:14] [INFO ] Deduced a trap composed of 242 places in 254 ms of which 1 ms to minimize.
[2023-03-24 10:53:14] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 1 ms to minimize.
[2023-03-24 10:53:15] [INFO ] Deduced a trap composed of 258 places in 259 ms of which 1 ms to minimize.
[2023-03-24 10:53:16] [INFO ] Deduced a trap composed of 245 places in 252 ms of which 1 ms to minimize.
[2023-03-24 10:53:16] [INFO ] Deduced a trap composed of 248 places in 259 ms of which 1 ms to minimize.
[2023-03-24 10:53:17] [INFO ] Deduced a trap composed of 273 places in 251 ms of which 1 ms to minimize.
[2023-03-24 10:53:17] [INFO ] Deduced a trap composed of 260 places in 252 ms of which 1 ms to minimize.
[2023-03-24 10:53:17] [INFO ] Deduced a trap composed of 240 places in 255 ms of which 1 ms to minimize.
[2023-03-24 10:53:18] [INFO ] Deduced a trap composed of 260 places in 250 ms of which 1 ms to minimize.
[2023-03-24 10:53:18] [INFO ] Deduced a trap composed of 239 places in 236 ms of which 1 ms to minimize.
[2023-03-24 10:53:21] [INFO ] Deduced a trap composed of 245 places in 244 ms of which 1 ms to minimize.
[2023-03-24 10:53:22] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 22971 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 10:53:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 10:53:22] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 40 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 40 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-24 10:53:22] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-24 10:53:22] [INFO ] Invariant cache hit.
[2023-03-24 10:53:24] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2023-03-24 10:53:24] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-24 10:53:24] [INFO ] Invariant cache hit.
[2023-03-24 10:53:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 10:53:35] [INFO ] Implicit Places using invariants and state equation in 11095 ms returned []
Implicit Place search using SMT with State Equation took 12282 ms to find 0 implicit places.
[2023-03-24 10:53:35] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-24 10:53:35] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-24 10:53:35] [INFO ] Invariant cache hit.
[2023-03-24 10:53:36] [INFO ] Dead Transitions using invariants and state equation in 1167 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13569 ms. Remains : 770/770 places, 1086/1086 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 770 transition count 1082
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 770 transition count 1081
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 769 transition count 1081
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1080
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 768 transition count 1075
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 763 transition count 1075
Applied a total of 18 rules in 124 ms. Remains 763 /770 variables (removed 7) and now considering 1075/1086 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1075 rows 763 cols
[2023-03-24 10:53:36] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-24 10:53:36] [INFO ] [Real]Absence check using 112 positive place invariants in 19 ms returned sat
[2023-03-24 10:53:36] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-24 10:53:36] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 10:53:36] [INFO ] [Nat]Absence check using 112 positive place invariants in 19 ms returned sat
[2023-03-24 10:53:36] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-24 10:53:37] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 10:53:37] [INFO ] Deduced a trap composed of 243 places in 250 ms of which 0 ms to minimize.
[2023-03-24 10:53:37] [INFO ] Deduced a trap composed of 257 places in 244 ms of which 1 ms to minimize.
[2023-03-24 10:53:38] [INFO ] Deduced a trap composed of 234 places in 236 ms of which 0 ms to minimize.
[2023-03-24 10:53:38] [INFO ] Deduced a trap composed of 234 places in 231 ms of which 1 ms to minimize.
[2023-03-24 10:53:38] [INFO ] Deduced a trap composed of 259 places in 230 ms of which 1 ms to minimize.
[2023-03-24 10:53:39] [INFO ] Deduced a trap composed of 222 places in 235 ms of which 1 ms to minimize.
[2023-03-24 10:53:39] [INFO ] Deduced a trap composed of 240 places in 232 ms of which 0 ms to minimize.
[2023-03-24 10:53:39] [INFO ] Deduced a trap composed of 243 places in 251 ms of which 0 ms to minimize.
[2023-03-24 10:53:39] [INFO ] Deduced a trap composed of 242 places in 247 ms of which 1 ms to minimize.
[2023-03-24 10:53:40] [INFO ] Deduced a trap composed of 220 places in 242 ms of which 0 ms to minimize.
[2023-03-24 10:53:40] [INFO ] Deduced a trap composed of 252 places in 258 ms of which 0 ms to minimize.
[2023-03-24 10:53:40] [INFO ] Deduced a trap composed of 240 places in 258 ms of which 1 ms to minimize.
[2023-03-24 10:53:41] [INFO ] Deduced a trap composed of 252 places in 250 ms of which 0 ms to minimize.
[2023-03-24 10:53:41] [INFO ] Deduced a trap composed of 249 places in 247 ms of which 1 ms to minimize.
[2023-03-24 10:53:41] [INFO ] Deduced a trap composed of 240 places in 248 ms of which 0 ms to minimize.
[2023-03-24 10:53:42] [INFO ] Deduced a trap composed of 243 places in 248 ms of which 0 ms to minimize.
[2023-03-24 10:53:42] [INFO ] Deduced a trap composed of 246 places in 243 ms of which 0 ms to minimize.
[2023-03-24 10:53:43] [INFO ] Deduced a trap composed of 243 places in 236 ms of which 0 ms to minimize.
[2023-03-24 10:53:43] [INFO ] Deduced a trap composed of 231 places in 237 ms of which 0 ms to minimize.
[2023-03-24 10:53:43] [INFO ] Deduced a trap composed of 240 places in 226 ms of which 0 ms to minimize.
[2023-03-24 10:53:43] [INFO ] Deduced a trap composed of 255 places in 248 ms of which 0 ms to minimize.
[2023-03-24 10:53:44] [INFO ] Deduced a trap composed of 237 places in 231 ms of which 1 ms to minimize.
[2023-03-24 10:53:44] [INFO ] Deduced a trap composed of 246 places in 230 ms of which 1 ms to minimize.
[2023-03-24 10:53:44] [INFO ] Deduced a trap composed of 249 places in 233 ms of which 0 ms to minimize.
[2023-03-24 10:53:44] [INFO ] Deduced a trap composed of 243 places in 236 ms of which 1 ms to minimize.
[2023-03-24 10:53:45] [INFO ] Deduced a trap composed of 234 places in 229 ms of which 1 ms to minimize.
[2023-03-24 10:53:45] [INFO ] Deduced a trap composed of 240 places in 232 ms of which 1 ms to minimize.
[2023-03-24 10:53:45] [INFO ] Deduced a trap composed of 249 places in 231 ms of which 1 ms to minimize.
[2023-03-24 10:53:47] [INFO ] Deduced a trap composed of 252 places in 240 ms of which 1 ms to minimize.
[2023-03-24 10:53:47] [INFO ] Deduced a trap composed of 252 places in 232 ms of which 1 ms to minimize.
[2023-03-24 10:53:48] [INFO ] Deduced a trap composed of 237 places in 245 ms of which 1 ms to minimize.
[2023-03-24 10:53:48] [INFO ] Deduced a trap composed of 255 places in 255 ms of which 0 ms to minimize.
[2023-03-24 10:53:48] [INFO ] Deduced a trap composed of 244 places in 244 ms of which 0 ms to minimize.
[2023-03-24 10:53:49] [INFO ] Deduced a trap composed of 240 places in 268 ms of which 1 ms to minimize.
[2023-03-24 10:53:50] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 0 ms to minimize.
[2023-03-24 10:53:50] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 0 ms to minimize.
[2023-03-24 10:53:50] [INFO ] Deduced a trap composed of 245 places in 247 ms of which 1 ms to minimize.
[2023-03-24 10:53:51] [INFO ] Deduced a trap composed of 256 places in 245 ms of which 1 ms to minimize.
[2023-03-24 10:53:51] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 1 ms to minimize.
[2023-03-24 10:53:51] [INFO ] Deduced a trap composed of 253 places in 241 ms of which 1 ms to minimize.
[2023-03-24 10:53:52] [INFO ] Deduced a trap composed of 241 places in 239 ms of which 1 ms to minimize.
[2023-03-24 10:53:52] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 1 ms to minimize.
[2023-03-24 10:53:52] [INFO ] Deduced a trap composed of 275 places in 234 ms of which 1 ms to minimize.
[2023-03-24 10:53:53] [INFO ] Deduced a trap composed of 250 places in 247 ms of which 1 ms to minimize.
[2023-03-24 10:53:54] [INFO ] Deduced a trap composed of 239 places in 228 ms of which 1 ms to minimize.
[2023-03-24 10:53:54] [INFO ] Deduced a trap composed of 240 places in 232 ms of which 0 ms to minimize.
[2023-03-24 10:53:55] [INFO ] Deduced a trap composed of 225 places in 233 ms of which 0 ms to minimize.
[2023-03-24 10:53:55] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 1 ms to minimize.
[2023-03-24 10:53:56] [INFO ] Deduced a trap composed of 242 places in 230 ms of which 1 ms to minimize.
[2023-03-24 10:53:57] [INFO ] Deduced a trap composed of 250 places in 238 ms of which 1 ms to minimize.
[2023-03-24 10:53:57] [INFO ] Deduced a trap composed of 243 places in 253 ms of which 0 ms to minimize.
[2023-03-24 10:53:58] [INFO ] Deduced a trap composed of 244 places in 237 ms of which 0 ms to minimize.
[2023-03-24 10:53:58] [INFO ] Deduced a trap composed of 230 places in 230 ms of which 1 ms to minimize.
[2023-03-24 10:53:59] [INFO ] Deduced a trap composed of 252 places in 233 ms of which 1 ms to minimize.
[2023-03-24 10:54:00] [INFO ] Deduced a trap composed of 251 places in 235 ms of which 1 ms to minimize.
[2023-03-24 10:54:01] [INFO ] Deduced a trap composed of 265 places in 239 ms of which 0 ms to minimize.
[2023-03-24 10:54:01] [INFO ] Deduced a trap composed of 248 places in 234 ms of which 1 ms to minimize.
[2023-03-24 10:54:02] [INFO ] Deduced a trap composed of 255 places in 229 ms of which 1 ms to minimize.
[2023-03-24 10:54:02] [INFO ] Deduced a trap composed of 221 places in 245 ms of which 1 ms to minimize.
[2023-03-24 10:54:03] [INFO ] Deduced a trap composed of 229 places in 228 ms of which 0 ms to minimize.
[2023-03-24 10:54:03] [INFO ] Deduced a trap composed of 261 places in 239 ms of which 1 ms to minimize.
[2023-03-24 10:54:04] [INFO ] Deduced a trap composed of 246 places in 229 ms of which 0 ms to minimize.
[2023-03-24 10:54:04] [INFO ] Deduced a trap composed of 230 places in 232 ms of which 0 ms to minimize.
[2023-03-24 10:54:05] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 0 ms to minimize.
[2023-03-24 10:54:05] [INFO ] Deduced a trap composed of 246 places in 220 ms of which 0 ms to minimize.
[2023-03-24 10:54:10] [INFO ] Deduced a trap composed of 242 places in 231 ms of which 1 ms to minimize.
[2023-03-24 10:54:10] [INFO ] Deduced a trap composed of 247 places in 224 ms of which 1 ms to minimize.
[2023-03-24 10:54:11] [INFO ] Deduced a trap composed of 248 places in 232 ms of which 0 ms to minimize.
[2023-03-24 10:54:11] [INFO ] Deduced a trap composed of 235 places in 232 ms of which 1 ms to minimize.
[2023-03-24 10:54:13] [INFO ] Deduced a trap composed of 233 places in 233 ms of which 0 ms to minimize.
[2023-03-24 10:54:14] [INFO ] Deduced a trap composed of 243 places in 239 ms of which 1 ms to minimize.
[2023-03-24 10:54:16] [INFO ] Deduced a trap composed of 248 places in 245 ms of which 1 ms to minimize.
[2023-03-24 10:54:17] [INFO ] Deduced a trap composed of 253 places in 233 ms of which 1 ms to minimize.
[2023-03-24 10:54:17] [INFO ] Deduced a trap composed of 251 places in 230 ms of which 1 ms to minimize.
[2023-03-24 10:54:21] [INFO ] Deduced a trap composed of 241 places in 251 ms of which 1 ms to minimize.
[2023-03-24 10:54:22] [INFO ] Deduced a trap composed of 253 places in 248 ms of which 0 ms to minimize.
[2023-03-24 10:54:22] [INFO ] Deduced a trap composed of 251 places in 243 ms of which 0 ms to minimize.
[2023-03-24 10:54:23] [INFO ] Deduced a trap composed of 273 places in 264 ms of which 1 ms to minimize.
[2023-03-24 10:54:23] [INFO ] Deduced a trap composed of 243 places in 253 ms of which 0 ms to minimize.
[2023-03-24 10:54:26] [INFO ] Deduced a trap composed of 252 places in 241 ms of which 1 ms to minimize.
[2023-03-24 10:54:26] [INFO ] Deduced a trap composed of 237 places in 250 ms of which 1 ms to minimize.
[2023-03-24 10:54:27] [INFO ] Deduced a trap composed of 251 places in 258 ms of which 0 ms to minimize.
[2023-03-24 10:54:27] [INFO ] Deduced a trap composed of 260 places in 251 ms of which 0 ms to minimize.
[2023-03-24 10:54:28] [INFO ] Deduced a trap composed of 225 places in 241 ms of which 1 ms to minimize.
[2023-03-24 10:54:28] [INFO ] Deduced a trap composed of 268 places in 247 ms of which 1 ms to minimize.
[2023-03-24 10:54:29] [INFO ] Deduced a trap composed of 240 places in 252 ms of which 1 ms to minimize.
[2023-03-24 10:54:30] [INFO ] Deduced a trap composed of 249 places in 251 ms of which 0 ms to minimize.
[2023-03-24 10:54:30] [INFO ] Deduced a trap composed of 234 places in 249 ms of which 1 ms to minimize.
[2023-03-24 10:54:30] [INFO ] Deduced a trap composed of 243 places in 252 ms of which 1 ms to minimize.
[2023-03-24 10:54:30] [INFO ] Deduced a trap composed of 237 places in 249 ms of which 1 ms to minimize.
[2023-03-24 10:54:31] [INFO ] Deduced a trap composed of 255 places in 250 ms of which 1 ms to minimize.
[2023-03-24 10:54:31] [INFO ] Deduced a trap composed of 252 places in 234 ms of which 1 ms to minimize.
[2023-03-24 10:54:31] [INFO ] Deduced a trap composed of 243 places in 247 ms of which 1 ms to minimize.
[2023-03-24 10:54:32] [INFO ] Deduced a trap composed of 243 places in 247 ms of which 1 ms to minimize.
[2023-03-24 10:54:32] [INFO ] Deduced a trap composed of 255 places in 235 ms of which 1 ms to minimize.
[2023-03-24 10:54:32] [INFO ] Deduced a trap composed of 246 places in 246 ms of which 0 ms to minimize.
[2023-03-24 10:54:33] [INFO ] Deduced a trap composed of 246 places in 249 ms of which 1 ms to minimize.
[2023-03-24 10:54:33] [INFO ] Deduced a trap composed of 243 places in 246 ms of which 0 ms to minimize.
[2023-03-24 10:54:33] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2023-03-24 10:54:34] [INFO ] Deduced a trap composed of 243 places in 242 ms of which 1 ms to minimize.
[2023-03-24 10:54:34] [INFO ] Deduced a trap composed of 231 places in 242 ms of which 2 ms to minimize.
[2023-03-24 10:54:35] [INFO ] Deduced a trap composed of 243 places in 236 ms of which 1 ms to minimize.
[2023-03-24 10:54:35] [INFO ] Deduced a trap composed of 237 places in 250 ms of which 0 ms to minimize.
[2023-03-24 10:54:36] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 0 ms to minimize.
[2023-03-24 10:54:36] [INFO ] Deduced a trap composed of 249 places in 244 ms of which 0 ms to minimize.
[2023-03-24 10:54:36] [INFO ] Deduced a trap composed of 222 places in 245 ms of which 1 ms to minimize.
[2023-03-24 10:54:37] [INFO ] Deduced a trap composed of 237 places in 252 ms of which 1 ms to minimize.
[2023-03-24 10:54:37] [INFO ] Deduced a trap composed of 240 places in 253 ms of which 1 ms to minimize.
[2023-03-24 10:54:38] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 0 ms to minimize.
[2023-03-24 10:54:39] [INFO ] Deduced a trap composed of 246 places in 237 ms of which 1 ms to minimize.
[2023-03-24 10:54:39] [INFO ] Deduced a trap composed of 252 places in 242 ms of which 0 ms to minimize.
[2023-03-24 10:54:39] [INFO ] Deduced a trap composed of 240 places in 232 ms of which 0 ms to minimize.
[2023-03-24 10:54:40] [INFO ] Deduced a trap composed of 240 places in 237 ms of which 1 ms to minimize.
[2023-03-24 10:54:40] [INFO ] Deduced a trap composed of 267 places in 243 ms of which 1 ms to minimize.
[2023-03-24 10:54:41] [INFO ] Deduced a trap composed of 247 places in 250 ms of which 1 ms to minimize.
[2023-03-24 10:54:41] [INFO ] Deduced a trap composed of 243 places in 251 ms of which 0 ms to minimize.
[2023-03-24 10:54:42] [INFO ] Deduced a trap composed of 237 places in 230 ms of which 0 ms to minimize.
[2023-03-24 10:54:42] [INFO ] Deduced a trap composed of 249 places in 246 ms of which 2 ms to minimize.
[2023-03-24 10:54:42] [INFO ] Deduced a trap composed of 237 places in 249 ms of which 0 ms to minimize.
[2023-03-24 10:54:43] [INFO ] Deduced a trap composed of 258 places in 250 ms of which 0 ms to minimize.
[2023-03-24 10:54:45] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 1 ms to minimize.
[2023-03-24 10:54:47] [INFO ] Deduced a trap composed of 246 places in 252 ms of which 1 ms to minimize.
[2023-03-24 10:54:49] [INFO ] Deduced a trap composed of 243 places in 263 ms of which 1 ms to minimize.
[2023-03-24 10:54:51] [INFO ] Deduced a trap composed of 248 places in 250 ms of which 1 ms to minimize.
[2023-03-24 10:54:51] [INFO ] Deduced a trap composed of 259 places in 264 ms of which 3 ms to minimize.
[2023-03-24 10:54:52] [INFO ] Deduced a trap composed of 248 places in 237 ms of which 1 ms to minimize.
[2023-03-24 10:54:53] [INFO ] Deduced a trap composed of 253 places in 238 ms of which 1 ms to minimize.
[2023-03-24 10:54:54] [INFO ] Deduced a trap composed of 255 places in 257 ms of which 1 ms to minimize.
[2023-03-24 10:54:55] [INFO ] Deduced a trap composed of 243 places in 245 ms of which 1 ms to minimize.
[2023-03-24 10:54:56] [INFO ] Deduced a trap composed of 243 places in 269 ms of which 0 ms to minimize.
[2023-03-24 10:54:56] [INFO ] Deduced a trap composed of 237 places in 251 ms of which 1 ms to minimize.
[2023-03-24 10:54:56] [INFO ] Deduced a trap composed of 225 places in 253 ms of which 1 ms to minimize.
[2023-03-24 10:54:57] [INFO ] Deduced a trap composed of 243 places in 256 ms of which 1 ms to minimize.
[2023-03-24 10:54:57] [INFO ] Deduced a trap composed of 231 places in 263 ms of which 0 ms to minimize.
[2023-03-24 10:55:02] [INFO ] Deduced a trap composed of 222 places in 253 ms of which 1 ms to minimize.
[2023-03-24 10:55:02] [INFO ] Deduced a trap composed of 234 places in 239 ms of which 0 ms to minimize.
[2023-03-24 10:55:02] [INFO ] Deduced a trap composed of 243 places in 239 ms of which 0 ms to minimize.
[2023-03-24 10:55:03] [INFO ] Deduced a trap composed of 234 places in 240 ms of which 1 ms to minimize.
[2023-03-24 10:55:03] [INFO ] Deduced a trap composed of 243 places in 249 ms of which 1 ms to minimize.
[2023-03-24 10:55:03] [INFO ] Deduced a trap composed of 252 places in 250 ms of which 0 ms to minimize.
[2023-03-24 10:55:04] [INFO ] Deduced a trap composed of 249 places in 246 ms of which 1 ms to minimize.
[2023-03-24 10:55:04] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 0 ms to minimize.
[2023-03-24 10:55:04] [INFO ] Deduced a trap composed of 237 places in 249 ms of which 0 ms to minimize.
[2023-03-24 10:55:05] [INFO ] Deduced a trap composed of 255 places in 255 ms of which 1 ms to minimize.
[2023-03-24 10:55:05] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 1 ms to minimize.
[2023-03-24 10:55:06] [INFO ] Deduced a trap composed of 246 places in 246 ms of which 1 ms to minimize.
[2023-03-24 10:55:07] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 1 ms to minimize.
[2023-03-24 10:55:08] [INFO ] Deduced a trap composed of 258 places in 248 ms of which 1 ms to minimize.
[2023-03-24 10:55:09] [INFO ] Deduced a trap composed of 235 places in 246 ms of which 0 ms to minimize.
[2023-03-24 10:55:18] [INFO ] Trap strengthening (SAT) tested/added 149/149 trap constraints in 101609 ms
[2023-03-24 10:55:18] [INFO ] After 102016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 10:55:18] [INFO ] After 102185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S05J60-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 10:55:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-24 10:55:19] [INFO ] Flatten gal took : 91 ms
FORMULA PolyORBNT-PT-S05J60-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 10:55:19] [INFO ] Flatten gal took : 89 ms
[2023-03-24 10:55:19] [INFO ] Input system was already deterministic with 1220 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
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 2 place count 904 transition count 1218
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 902 transition count 1217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 901 transition count 1217
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 6 place count 901 transition count 1155
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 130 place count 839 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 838 transition count 1154
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 838 transition count 1154
Applied a total of 132 rules in 75 ms. Remains 838 /909 variables (removed 71) and now considering 1154/1220 (removed 66) transitions.
[2023-03-24 10:55:19] [INFO ] Flow matrix only has 1150 transitions (discarded 4 similar events)
// Phase 1: matrix 1150 rows 838 cols
[2023-03-24 10:55:19] [INFO ] Computed 137 place invariants in 23 ms
[2023-03-24 10:55:21] [INFO ] Dead Transitions using invariants and state equation in 1509 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1584 ms. Remains : 838/909 places, 1154/1220 transitions.
[2023-03-24 10:55:21] [INFO ] Flatten gal took : 49 ms
[2023-03-24 10:55:21] [INFO ] Flatten gal took : 53 ms
[2023-03-24 10:55:21] [INFO ] Input system was already deterministic with 1154 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 908 transition count 1219
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 908 transition count 1219
Applied a total of 2 rules in 65 ms. Remains 908 /909 variables (removed 1) and now considering 1219/1220 (removed 1) transitions.
[2023-03-24 10:55:21] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 908 cols
[2023-03-24 10:55:21] [INFO ] Computed 142 place invariants in 19 ms
[2023-03-24 10:55:23] [INFO ] Dead Transitions using invariants and state equation in 1934 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2003 ms. Remains : 908/909 places, 1219/1220 transitions.
[2023-03-24 10:55:23] [INFO ] Flatten gal took : 48 ms
[2023-03-24 10:55:23] [INFO ] Flatten gal took : 50 ms
[2023-03-24 10:55:23] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1219
Applied a total of 7 rules in 55 ms. Remains 903 /909 variables (removed 6) and now considering 1219/1220 (removed 1) transitions.
[2023-03-24 10:55:23] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-24 10:55:23] [INFO ] Computed 137 place invariants in 17 ms
[2023-03-24 10:55:25] [INFO ] Dead Transitions using invariants and state equation in 1880 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1936 ms. Remains : 903/909 places, 1219/1220 transitions.
[2023-03-24 10:55:25] [INFO ] Flatten gal took : 46 ms
[2023-03-24 10:55:25] [INFO ] Flatten gal took : 47 ms
[2023-03-24 10:55:25] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Applied a total of 5 rules in 10 ms. Remains 904 /909 variables (removed 5) and now considering 1220/1220 (removed 0) transitions.
[2023-03-24 10:55:25] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 904 cols
[2023-03-24 10:55:25] [INFO ] Computed 137 place invariants in 24 ms
[2023-03-24 10:55:27] [INFO ] Dead Transitions using invariants and state equation in 1956 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1972 ms. Remains : 904/909 places, 1220/1220 transitions.
[2023-03-24 10:55:27] [INFO ] Flatten gal took : 55 ms
[2023-03-24 10:55:27] [INFO ] Flatten gal took : 49 ms
[2023-03-24 10:55:27] [INFO ] Input system was already deterministic with 1220 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 909 transition count 1157
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 846 transition count 1156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 845 transition count 1156
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 128 place count 845 transition count 1091
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 258 place count 780 transition count 1091
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 260 place count 779 transition count 1090
Applied a total of 260 rules in 79 ms. Remains 779 /909 variables (removed 130) and now considering 1090/1220 (removed 130) transitions.
[2023-03-24 10:55:28] [INFO ] Flow matrix only has 1086 transitions (discarded 4 similar events)
// Phase 1: matrix 1086 rows 779 cols
[2023-03-24 10:55:28] [INFO ] Computed 142 place invariants in 25 ms
[2023-03-24 10:55:29] [INFO ] Dead Transitions using invariants and state equation in 1133 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1215 ms. Remains : 779/909 places, 1090/1220 transitions.
[2023-03-24 10:55:29] [INFO ] Flatten gal took : 37 ms
[2023-03-24 10:55:29] [INFO ] Flatten gal took : 40 ms
[2023-03-24 10:55:29] [INFO ] Input system was already deterministic with 1090 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Applied a total of 5 rules in 17 ms. Remains 904 /909 variables (removed 5) and now considering 1220/1220 (removed 0) transitions.
[2023-03-24 10:55:29] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 904 cols
[2023-03-24 10:55:29] [INFO ] Computed 137 place invariants in 17 ms
[2023-03-24 10:55:31] [INFO ] Dead Transitions using invariants and state equation in 1902 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1920 ms. Remains : 904/909 places, 1220/1220 transitions.
[2023-03-24 10:55:31] [INFO ] Flatten gal took : 40 ms
[2023-03-24 10:55:31] [INFO ] Flatten gal took : 42 ms
[2023-03-24 10:55:31] [INFO ] Input system was already deterministic with 1220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Applied a total of 5 rules in 14 ms. Remains 904 /909 variables (removed 5) and now considering 1220/1220 (removed 0) transitions.
[2023-03-24 10:55:31] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
[2023-03-24 10:55:31] [INFO ] Invariant cache hit.
[2023-03-24 10:55:33] [INFO ] Dead Transitions using invariants and state equation in 1953 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1967 ms. Remains : 904/909 places, 1220/1220 transitions.
[2023-03-24 10:55:33] [INFO ] Flatten gal took : 43 ms
[2023-03-24 10:55:33] [INFO ] Flatten gal took : 46 ms
[2023-03-24 10:55:33] [INFO ] Input system was already deterministic with 1220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1219
Applied a total of 7 rules in 33 ms. Remains 903 /909 variables (removed 6) and now considering 1219/1220 (removed 1) transitions.
[2023-03-24 10:55:33] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2023-03-24 10:55:33] [INFO ] Computed 137 place invariants in 26 ms
[2023-03-24 10:55:35] [INFO ] Dead Transitions using invariants and state equation in 1814 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1852 ms. Remains : 903/909 places, 1219/1220 transitions.
[2023-03-24 10:55:35] [INFO ] Flatten gal took : 45 ms
[2023-03-24 10:55:35] [INFO ] Flatten gal took : 43 ms
[2023-03-24 10:55:35] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1219
Applied a total of 7 rules in 35 ms. Remains 903 /909 variables (removed 6) and now considering 1219/1220 (removed 1) transitions.
[2023-03-24 10:55:35] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 10:55:35] [INFO ] Invariant cache hit.
[2023-03-24 10:55:37] [INFO ] Dead Transitions using invariants and state equation in 1931 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1967 ms. Remains : 903/909 places, 1219/1220 transitions.
[2023-03-24 10:55:37] [INFO ] Flatten gal took : 42 ms
[2023-03-24 10:55:37] [INFO ] Flatten gal took : 43 ms
[2023-03-24 10:55:37] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1219
Applied a total of 7 rules in 34 ms. Remains 903 /909 variables (removed 6) and now considering 1219/1220 (removed 1) transitions.
[2023-03-24 10:55:37] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 10:55:37] [INFO ] Invariant cache hit.
[2023-03-24 10:55:39] [INFO ] Dead Transitions using invariants and state equation in 1965 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2006 ms. Remains : 903/909 places, 1219/1220 transitions.
[2023-03-24 10:55:39] [INFO ] Flatten gal took : 40 ms
[2023-03-24 10:55:40] [INFO ] Flatten gal took : 43 ms
[2023-03-24 10:55:40] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1219
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1219
Applied a total of 7 rules in 49 ms. Remains 903 /909 variables (removed 6) and now considering 1219/1220 (removed 1) transitions.
[2023-03-24 10:55:40] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2023-03-24 10:55:40] [INFO ] Invariant cache hit.
[2023-03-24 10:55:42] [INFO ] Dead Transitions using invariants and state equation in 1931 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1982 ms. Remains : 903/909 places, 1219/1220 transitions.
[2023-03-24 10:55:42] [INFO ] Flatten gal took : 43 ms
[2023-03-24 10:55:42] [INFO ] Flatten gal took : 45 ms
[2023-03-24 10:55:42] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1154
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1154
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1089
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1088
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1088
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1086
Applied a total of 268 rules in 108 ms. Remains 770 /909 variables (removed 139) and now considering 1086/1220 (removed 134) transitions.
[2023-03-24 10:55:42] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-24 10:55:42] [INFO ] Computed 137 place invariants in 22 ms
[2023-03-24 10:55:43] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1263 ms. Remains : 770/909 places, 1086/1220 transitions.
[2023-03-24 10:55:43] [INFO ] Flatten gal took : 35 ms
[2023-03-24 10:55:43] [INFO ] Flatten gal took : 39 ms
[2023-03-24 10:55:43] [INFO ] Input system was already deterministic with 1086 transitions.
Finished random walk after 3270 steps, including 184 resets, run visited all 1 properties in 24 ms. (steps per millisecond=136 )
FORMULA PolyORBNT-PT-S05J60-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1220/1220 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1154
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1154
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1089
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1088
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1088
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1086
Applied a total of 268 rules in 102 ms. Remains 770 /909 variables (removed 139) and now considering 1086/1220 (removed 134) transitions.
[2023-03-24 10:55:43] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-24 10:55:43] [INFO ] Invariant cache hit.
[2023-03-24 10:55:44] [INFO ] Dead Transitions using invariants and state equation in 1113 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1216 ms. Remains : 770/909 places, 1086/1220 transitions.
[2023-03-24 10:55:44] [INFO ] Flatten gal took : 36 ms
[2023-03-24 10:55:44] [INFO ] Flatten gal took : 37 ms
[2023-03-24 10:55:45] [INFO ] Input system was already deterministic with 1086 transitions.
[2023-03-24 10:55:45] [INFO ] Flatten gal took : 63 ms
[2023-03-24 10:55:45] [INFO ] Flatten gal took : 65 ms
[2023-03-24 10:55:45] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2023-03-24 10:55:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 909 places, 1220 transitions and 6084 arcs took 7 ms.
Total runtime 232142 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: 909 NrTr: 1220 NrArc: 6084)

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

net check time: 0m 0.000sec

init dd package: 0m 2.754sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10448948 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094908 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.015sec

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="PolyORBNT-PT-S05J60"
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 PolyORBNT-PT-S05J60, 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 r298-tall-167873952100738"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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