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.r394-oct2-167903717500154.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPs-PT-050B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 846K 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 ShieldIIPs-PT-050B-CTLFireability-00
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-01
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-02
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-03
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-04
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-05
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-06
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-07
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-08
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-09
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-10
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-11
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-12
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-13
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-14
FORMULA_NAME ShieldIIPs-PT-050B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679495175587

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=ShieldIIPs-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 14:26:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 14:26:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:26:18] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2023-03-22 14:26:18] [INFO ] Transformed 3003 places.
[2023-03-22 14:26:18] [INFO ] Transformed 2953 transitions.
[2023-03-22 14:26:18] [INFO ] Found NUPN structural information;
[2023-03-22 14:26:18] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 196 out of 3003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Discarding 318 places :
Symmetric choice reduction at 0 with 318 rule applications. Total rules 318 place count 2685 transition count 2635
Iterating global reduction 0 with 318 rules applied. Total rules applied 636 place count 2685 transition count 2635
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 637 place count 2684 transition count 2634
Iterating global reduction 0 with 1 rules applied. Total rules applied 638 place count 2684 transition count 2634
Applied a total of 638 rules in 1021 ms. Remains 2684 /3003 variables (removed 319) and now considering 2634/2953 (removed 319) transitions.
// Phase 1: matrix 2634 rows 2684 cols
[2023-03-22 14:26:19] [INFO ] Computed 451 place invariants in 42 ms
[2023-03-22 14:26:21] [INFO ] Implicit Places using invariants in 1648 ms returned []
[2023-03-22 14:26:21] [INFO ] Invariant cache hit.
[2023-03-22 14:26:25] [INFO ] Implicit Places using invariants and state equation in 4648 ms returned []
Implicit Place search using SMT with State Equation took 6365 ms to find 0 implicit places.
[2023-03-22 14:26:25] [INFO ] Invariant cache hit.
[2023-03-22 14:26:27] [INFO ] Dead Transitions using invariants and state equation in 1596 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2684/3003 places, 2634/2953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8986 ms. Remains : 2684/3003 places, 2634/2953 transitions.
Support contains 196 out of 2684 places after structural reductions.
[2023-03-22 14:26:28] [INFO ] Flatten gal took : 210 ms
[2023-03-22 14:26:28] [INFO ] Flatten gal took : 126 ms
[2023-03-22 14:26:28] [INFO ] Input system was already deterministic with 2634 transitions.
Support contains 195 out of 2684 places (down from 196) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 105) seen :56
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) 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 49) 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 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) 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 49) 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 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 49) 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 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 49) 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 49) 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 49) 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 49) 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 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) seen :0
Running SMT prover for 49 properties.
[2023-03-22 14:26:29] [INFO ] Invariant cache hit.
[2023-03-22 14:26:32] [INFO ] [Real]Absence check using 451 positive place invariants in 347 ms returned sat
[2023-03-22 14:26:33] [INFO ] After 3605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:49
[2023-03-22 14:26:35] [INFO ] [Nat]Absence check using 451 positive place invariants in 238 ms returned sat
[2023-03-22 14:26:47] [INFO ] After 8993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :49
[2023-03-22 14:26:48] [INFO ] Deduced a trap composed of 19 places in 636 ms of which 6 ms to minimize.
[2023-03-22 14:26:49] [INFO ] Deduced a trap composed of 18 places in 808 ms of which 1 ms to minimize.
[2023-03-22 14:26:50] [INFO ] Deduced a trap composed of 27 places in 639 ms of which 2 ms to minimize.
[2023-03-22 14:26:50] [INFO ] Deduced a trap composed of 25 places in 497 ms of which 2 ms to minimize.
[2023-03-22 14:26:51] [INFO ] Deduced a trap composed of 21 places in 525 ms of which 1 ms to minimize.
[2023-03-22 14:26:51] [INFO ] Deduced a trap composed of 32 places in 602 ms of which 1 ms to minimize.
[2023-03-22 14:26:52] [INFO ] Deduced a trap composed of 27 places in 498 ms of which 13 ms to minimize.
[2023-03-22 14:26:53] [INFO ] Deduced a trap composed of 32 places in 505 ms of which 1 ms to minimize.
[2023-03-22 14:26:53] [INFO ] Deduced a trap composed of 22 places in 428 ms of which 1 ms to minimize.
[2023-03-22 14:26:54] [INFO ] Deduced a trap composed of 30 places in 440 ms of which 1 ms to minimize.
[2023-03-22 14:26:54] [INFO ] Deduced a trap composed of 22 places in 446 ms of which 1 ms to minimize.
[2023-03-22 14:26:55] [INFO ] Deduced a trap composed of 32 places in 555 ms of which 1 ms to minimize.
[2023-03-22 14:26:55] [INFO ] Deduced a trap composed of 41 places in 466 ms of which 1 ms to minimize.
[2023-03-22 14:26:56] [INFO ] Deduced a trap composed of 41 places in 453 ms of which 2 ms to minimize.
[2023-03-22 14:26:56] [INFO ] Deduced a trap composed of 35 places in 405 ms of which 1 ms to minimize.
[2023-03-22 14:26:57] [INFO ] Deduced a trap composed of 25 places in 410 ms of which 1 ms to minimize.
[2023-03-22 14:26:57] [INFO ] Deduced a trap composed of 45 places in 419 ms of which 1 ms to minimize.
[2023-03-22 14:26:59] [INFO ] Deduced a trap composed of 18 places in 1819 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: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-22 14:26:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:26:59] [INFO ] After 26850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:49
Parikh walk visited 1 properties in 6114 ms.
Support contains 100 out of 2684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 232 place count 2684 transition count 2402
Reduce places removed 232 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 233 rules applied. Total rules applied 465 place count 2452 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 466 place count 2451 transition count 2401
Performed 245 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 245 Pre rules applied. Total rules applied 466 place count 2451 transition count 2156
Deduced a syphon composed of 245 places in 6 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 956 place count 2206 transition count 2156
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 970 place count 2192 transition count 2142
Iterating global reduction 3 with 14 rules applied. Total rules applied 984 place count 2192 transition count 2142
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 984 place count 2192 transition count 2137
Deduced a syphon composed of 5 places in 16 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 994 place count 2187 transition count 2137
Performed 861 Post agglomeration using F-continuation condition.Transition count delta: 861
Deduced a syphon composed of 861 places in 4 ms
Reduce places removed 861 places and 0 transitions.
Iterating global reduction 3 with 1722 rules applied. Total rules applied 2716 place count 1326 transition count 1276
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 321 times.
Drop transitions removed 321 transitions
Iterating global reduction 3 with 321 rules applied. Total rules applied 3037 place count 1326 transition count 1276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3038 place count 1325 transition count 1275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3039 place count 1324 transition count 1275
Applied a total of 3039 rules in 672 ms. Remains 1324 /2684 variables (removed 1360) and now considering 1275/2634 (removed 1359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 672 ms. Remains : 1324/2684 places, 1275/2634 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 48) seen :42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1275 rows 1324 cols
[2023-03-22 14:27:07] [INFO ] Computed 450 place invariants in 35 ms
[2023-03-22 14:27:07] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 14:27:08] [INFO ] [Nat]Absence check using 441 positive place invariants in 140 ms returned sat
[2023-03-22 14:27:08] [INFO ] [Nat]Absence check using 441 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-22 14:27:09] [INFO ] After 1357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 14:27:10] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 1 ms to minimize.
[2023-03-22 14:27:10] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2023-03-22 14:27:11] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2023-03-22 14:27:11] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
[2023-03-22 14:27:11] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 0 ms to minimize.
[2023-03-22 14:27:11] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2023-03-22 14:27:11] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-22 14:27:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1824 ms
[2023-03-22 14:27:12] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2023-03-22 14:27:12] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2023-03-22 14:27:12] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2023-03-22 14:27:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 730 ms
[2023-03-22 14:27:13] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2023-03-22 14:27:13] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2023-03-22 14:27:13] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2023-03-22 14:27:13] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2023-03-22 14:27:13] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2023-03-22 14:27:14] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 27 ms to minimize.
[2023-03-22 14:27:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1304 ms
[2023-03-22 14:27:14] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2023-03-22 14:27:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2023-03-22 14:27:14] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 0 ms to minimize.
[2023-03-22 14:27:15] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2023-03-22 14:27:15] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2023-03-22 14:27:15] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 1 ms to minimize.
[2023-03-22 14:27:15] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 26 ms to minimize.
[2023-03-22 14:27:15] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-22 14:27:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1368 ms
[2023-03-22 14:27:16] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 0 ms to minimize.
[2023-03-22 14:27:16] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 1 ms to minimize.
[2023-03-22 14:27:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 584 ms
[2023-03-22 14:27:16] [INFO ] After 8081ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 799 ms.
[2023-03-22 14:27:17] [INFO ] After 9590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 511 ms.
Support contains 23 out of 1324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1324/1324 places, 1275/1275 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 2 place count 1324 transition count 1273
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1322 transition count 1273
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 4 place count 1322 transition count 1259
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 32 place count 1308 transition count 1259
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 118 place count 1265 transition count 1216
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 1265 transition count 1216
Applied a total of 142 rules in 135 ms. Remains 1265 /1324 variables (removed 59) and now considering 1216/1275 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 1265/1324 places, 1216/1275 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1216 rows 1265 cols
[2023-03-22 14:27:18] [INFO ] Computed 450 place invariants in 14 ms
[2023-03-22 14:27:18] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 14:27:19] [INFO ] [Nat]Absence check using 445 positive place invariants in 95 ms returned sat
[2023-03-22 14:27:19] [INFO ] [Nat]Absence check using 445 positive and 5 generalized place invariants in 25 ms returned sat
[2023-03-22 14:27:20] [INFO ] After 1121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 14:27:20] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 0 ms to minimize.
[2023-03-22 14:27:21] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2023-03-22 14:27:21] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 0 ms to minimize.
[2023-03-22 14:27:21] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2023-03-22 14:27:22] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2023-03-22 14:27:22] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 1 ms to minimize.
[2023-03-22 14:27:22] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 2 ms to minimize.
[2023-03-22 14:27:22] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 0 ms to minimize.
[2023-03-22 14:27:23] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-22 14:27:23] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 0 ms to minimize.
[2023-03-22 14:27:23] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 1 ms to minimize.
[2023-03-22 14:27:23] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 14 ms to minimize.
[2023-03-22 14:27:24] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2023-03-22 14:27:24] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2023-03-22 14:27:24] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2023-03-22 14:27:24] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3920 ms
[2023-03-22 14:27:24] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-22 14:27:25] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2023-03-22 14:27:25] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2023-03-22 14:27:25] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2023-03-22 14:27:25] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-22 14:27:25] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-22 14:27:25] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 16 ms to minimize.
[2023-03-22 14:27:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1332 ms
[2023-03-22 14:27:26] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2023-03-22 14:27:26] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 9 ms to minimize.
[2023-03-22 14:27:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2023-03-22 14:27:26] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 21 ms to minimize.
[2023-03-22 14:27:27] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 22 ms to minimize.
[2023-03-22 14:27:27] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2023-03-22 14:27:27] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2023-03-22 14:27:27] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-22 14:27:28] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2023-03-22 14:27:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1430 ms
[2023-03-22 14:27:28] [INFO ] After 8799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 765 ms.
[2023-03-22 14:27:28] [INFO ] After 10040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 307 ms.
Support contains 17 out of 1265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1265/1265 places, 1216/1216 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1265 transition count 1216
Applied a total of 4 rules in 75 ms. Remains 1265 /1265 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1265/1265 places, 1216/1216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1216 rows 1265 cols
[2023-03-22 14:27:29] [INFO ] Computed 450 place invariants in 12 ms
[2023-03-22 14:27:30] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:27:30] [INFO ] [Nat]Absence check using 449 positive place invariants in 68 ms returned sat
[2023-03-22 14:27:30] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 14:27:31] [INFO ] After 922ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:27:31] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2023-03-22 14:27:31] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2023-03-22 14:27:32] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2023-03-22 14:27:32] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-22 14:27:32] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2023-03-22 14:27:32] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
[2023-03-22 14:27:33] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2023-03-22 14:27:33] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-22 14:27:33] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 0 ms to minimize.
[2023-03-22 14:27:34] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2023-03-22 14:27:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2760 ms
[2023-03-22 14:27:34] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-22 14:27:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-22 14:27:34] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2023-03-22 14:27:35] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 1 ms to minimize.
[2023-03-22 14:27:35] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2023-03-22 14:27:35] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2023-03-22 14:27:35] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-22 14:27:35] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-22 14:27:36] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2023-03-22 14:27:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1557 ms
[2023-03-22 14:27:36] [INFO ] After 5943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 466 ms.
[2023-03-22 14:27:36] [INFO ] After 6729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 212 ms.
Support contains 14 out of 1265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1265/1265 places, 1216/1216 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1261 transition count 1212
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1261 transition count 1212
Applied a total of 10 rules in 103 ms. Remains 1261 /1265 variables (removed 4) and now considering 1212/1216 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 1261/1265 places, 1212/1216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 145666 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145666 steps, saw 141770 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1212 rows 1261 cols
[2023-03-22 14:27:40] [INFO ] Computed 450 place invariants in 21 ms
[2023-03-22 14:27:40] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:27:40] [INFO ] [Nat]Absence check using 449 positive place invariants in 98 ms returned sat
[2023-03-22 14:27:40] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 13 ms returned sat
[2023-03-22 14:27:42] [INFO ] After 984ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:27:42] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2023-03-22 14:27:42] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2023-03-22 14:27:42] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 0 ms to minimize.
[2023-03-22 14:27:43] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2023-03-22 14:27:43] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2023-03-22 14:27:43] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2023-03-22 14:27:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1278 ms
[2023-03-22 14:27:43] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2023-03-22 14:27:44] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2023-03-22 14:27:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 493 ms
[2023-03-22 14:27:44] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2023-03-22 14:27:44] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2023-03-22 14:27:44] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2023-03-22 14:27:44] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-22 14:27:45] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 14:27:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1005 ms
[2023-03-22 14:27:45] [INFO ] After 4149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 359 ms.
[2023-03-22 14:27:45] [INFO ] After 4950ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 267 ms.
Support contains 14 out of 1261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1261/1261 places, 1212/1212 transitions.
Applied a total of 0 rules in 33 ms. Remains 1261 /1261 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1261/1261 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1261/1261 places, 1212/1212 transitions.
Applied a total of 0 rules in 36 ms. Remains 1261 /1261 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2023-03-22 14:27:45] [INFO ] Invariant cache hit.
[2023-03-22 14:27:46] [INFO ] Implicit Places using invariants in 1088 ms returned []
[2023-03-22 14:27:46] [INFO ] Invariant cache hit.
[2023-03-22 14:27:49] [INFO ] Implicit Places using invariants and state equation in 2085 ms returned []
Implicit Place search using SMT with State Equation took 3188 ms to find 0 implicit places.
[2023-03-22 14:27:49] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-22 14:27:49] [INFO ] Invariant cache hit.
[2023-03-22 14:27:49] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3980 ms. Remains : 1261/1261 places, 1212/1212 transitions.
Applied a total of 0 rules in 32 ms. Remains 1261 /1261 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-22 14:27:49] [INFO ] Invariant cache hit.
[2023-03-22 14:27:50] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:27:50] [INFO ] [Nat]Absence check using 449 positive place invariants in 83 ms returned sat
[2023-03-22 14:27:50] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 13 ms returned sat
[2023-03-22 14:27:51] [INFO ] After 1044ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:27:51] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-22 14:27:52] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2023-03-22 14:27:52] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-22 14:27:52] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2023-03-22 14:27:52] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2023-03-22 14:27:52] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-22 14:27:53] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-22 14:27:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1520 ms
[2023-03-22 14:27:53] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2023-03-22 14:27:53] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2023-03-22 14:27:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
[2023-03-22 14:27:53] [INFO ] After 3490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 499 ms.
[2023-03-22 14:27:54] [INFO ] After 4323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 14:27:54] [INFO ] Flatten gal took : 100 ms
[2023-03-22 14:27:54] [INFO ] Flatten gal took : 93 ms
[2023-03-22 14:27:54] [INFO ] Input system was already deterministic with 2634 transitions.
Computed a total of 612 stabilizing places and 612 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2654 transition count 2604
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2654 transition count 2604
Applied a total of 60 rules in 305 ms. Remains 2654 /2684 variables (removed 30) and now considering 2604/2634 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 2654/2684 places, 2604/2634 transitions.
[2023-03-22 14:27:55] [INFO ] Flatten gal took : 74 ms
[2023-03-22 14:27:55] [INFO ] Flatten gal took : 78 ms
[2023-03-22 14:27:55] [INFO ] Input system was already deterministic with 2604 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2655 transition count 2605
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 2655 transition count 2605
Applied a total of 58 rules in 385 ms. Remains 2655 /2684 variables (removed 29) and now considering 2605/2634 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 2655/2684 places, 2605/2634 transitions.
[2023-03-22 14:27:56] [INFO ] Flatten gal took : 66 ms
[2023-03-22 14:27:56] [INFO ] Flatten gal took : 67 ms
[2023-03-22 14:27:56] [INFO ] Input system was already deterministic with 2605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 2652 transition count 2602
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 2652 transition count 2602
Applied a total of 64 rules in 342 ms. Remains 2652 /2684 variables (removed 32) and now considering 2602/2634 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 2652/2684 places, 2602/2634 transitions.
[2023-03-22 14:27:56] [INFO ] Flatten gal took : 61 ms
[2023-03-22 14:27:56] [INFO ] Flatten gal took : 64 ms
[2023-03-22 14:27:56] [INFO ] Input system was already deterministic with 2602 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2658 transition count 2608
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2658 transition count 2608
Applied a total of 52 rules in 305 ms. Remains 2658 /2684 variables (removed 26) and now considering 2608/2634 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 2658/2684 places, 2608/2634 transitions.
[2023-03-22 14:27:57] [INFO ] Flatten gal took : 61 ms
[2023-03-22 14:27:57] [INFO ] Flatten gal took : 64 ms
[2023-03-22 14:27:57] [INFO ] Input system was already deterministic with 2608 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 2655 transition count 2605
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 2655 transition count 2605
Applied a total of 58 rules in 358 ms. Remains 2655 /2684 variables (removed 29) and now considering 2605/2634 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 2655/2684 places, 2605/2634 transitions.
[2023-03-22 14:27:57] [INFO ] Flatten gal took : 57 ms
[2023-03-22 14:27:58] [INFO ] Flatten gal took : 62 ms
[2023-03-22 14:27:58] [INFO ] Input system was already deterministic with 2605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2654 transition count 2604
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2654 transition count 2604
Applied a total of 60 rules in 373 ms. Remains 2654 /2684 variables (removed 30) and now considering 2604/2634 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 2654/2684 places, 2604/2634 transitions.
[2023-03-22 14:27:58] [INFO ] Flatten gal took : 60 ms
[2023-03-22 14:27:58] [INFO ] Flatten gal took : 63 ms
[2023-03-22 14:27:58] [INFO ] Input system was already deterministic with 2604 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 249 transitions
Trivial Post-agglo rules discarded 249 transitions
Performed 249 trivial Post agglomeration. Transition count delta: 249
Iterating post reduction 0 with 249 rules applied. Total rules applied 249 place count 2683 transition count 2384
Reduce places removed 249 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 250 rules applied. Total rules applied 499 place count 2434 transition count 2383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 500 place count 2433 transition count 2383
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 500 place count 2433 transition count 2132
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 1002 place count 2182 transition count 2132
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1032 place count 2152 transition count 2102
Iterating global reduction 3 with 30 rules applied. Total rules applied 1062 place count 2152 transition count 2102
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1062 place count 2152 transition count 2093
Deduced a syphon composed of 9 places in 12 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1080 place count 2143 transition count 2093
Performed 887 Post agglomeration using F-continuation condition.Transition count delta: 887
Deduced a syphon composed of 887 places in 3 ms
Reduce places removed 887 places and 0 transitions.
Iterating global reduction 3 with 1774 rules applied. Total rules applied 2854 place count 1256 transition count 1206
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2856 place count 1254 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2857 place count 1253 transition count 1204
Applied a total of 2857 rules in 570 ms. Remains 1253 /2684 variables (removed 1431) and now considering 1204/2634 (removed 1430) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 570 ms. Remains : 1253/2684 places, 1204/2634 transitions.
[2023-03-22 14:27:59] [INFO ] Flatten gal took : 39 ms
[2023-03-22 14:27:59] [INFO ] Flatten gal took : 37 ms
[2023-03-22 14:27:59] [INFO ] Input system was already deterministic with 1204 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2683 transition count 2382
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2432 transition count 2382
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2432 transition count 2131
Deduced a syphon composed of 251 places in 4 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2181 transition count 2131
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 1035 place count 2150 transition count 2100
Iterating global reduction 2 with 31 rules applied. Total rules applied 1066 place count 2150 transition count 2100
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1066 place count 2150 transition count 2091
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1084 place count 2141 transition count 2091
Performed 888 Post agglomeration using F-continuation condition.Transition count delta: 888
Deduced a syphon composed of 888 places in 5 ms
Reduce places removed 888 places and 0 transitions.
Iterating global reduction 2 with 1776 rules applied. Total rules applied 2860 place count 1253 transition count 1203
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2862 place count 1251 transition count 1201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2863 place count 1250 transition count 1201
Applied a total of 2863 rules in 521 ms. Remains 1250 /2684 variables (removed 1434) and now considering 1201/2634 (removed 1433) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 522 ms. Remains : 1250/2684 places, 1201/2634 transitions.
[2023-03-22 14:28:00] [INFO ] Flatten gal took : 39 ms
[2023-03-22 14:28:00] [INFO ] Flatten gal took : 41 ms
[2023-03-22 14:28:00] [INFO ] Input system was already deterministic with 1201 transitions.
Finished random walk after 2787 steps, including 1 resets, run visited all 1 properties in 27 ms. (steps per millisecond=103 )
FORMULA ShieldIIPs-PT-050B-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 247 rules applied. Total rules applied 247 place count 2683 transition count 2386
Reduce places removed 247 places and 0 transitions.
Iterating post reduction 1 with 247 rules applied. Total rules applied 494 place count 2436 transition count 2386
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 494 place count 2436 transition count 2136
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 994 place count 2186 transition count 2136
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1022 place count 2158 transition count 2108
Iterating global reduction 2 with 28 rules applied. Total rules applied 1050 place count 2158 transition count 2108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1050 place count 2158 transition count 2103
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1060 place count 2153 transition count 2103
Performed 879 Post agglomeration using F-continuation condition.Transition count delta: 879
Deduced a syphon composed of 879 places in 3 ms
Reduce places removed 879 places and 0 transitions.
Iterating global reduction 2 with 1758 rules applied. Total rules applied 2818 place count 1274 transition count 1224
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2820 place count 1272 transition count 1222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2821 place count 1271 transition count 1222
Applied a total of 2821 rules in 477 ms. Remains 1271 /2684 variables (removed 1413) and now considering 1222/2634 (removed 1412) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 477 ms. Remains : 1271/2684 places, 1222/2634 transitions.
[2023-03-22 14:28:00] [INFO ] Flatten gal took : 37 ms
[2023-03-22 14:28:00] [INFO ] Flatten gal took : 40 ms
[2023-03-22 14:28:00] [INFO ] Input system was already deterministic with 1222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2653 transition count 2603
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2653 transition count 2603
Applied a total of 62 rules in 297 ms. Remains 2653 /2684 variables (removed 31) and now considering 2603/2634 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 2653/2684 places, 2603/2634 transitions.
[2023-03-22 14:28:01] [INFO ] Flatten gal took : 74 ms
[2023-03-22 14:28:01] [INFO ] Flatten gal took : 60 ms
[2023-03-22 14:28:01] [INFO ] Input system was already deterministic with 2603 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2683 transition count 2383
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2433 transition count 2383
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 500 place count 2433 transition count 2132
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1002 place count 2182 transition count 2132
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 1034 place count 2150 transition count 2100
Iterating global reduction 2 with 32 rules applied. Total rules applied 1066 place count 2150 transition count 2100
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1066 place count 2150 transition count 2091
Deduced a syphon composed of 9 places in 14 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1084 place count 2141 transition count 2091
Performed 888 Post agglomeration using F-continuation condition.Transition count delta: 888
Deduced a syphon composed of 888 places in 3 ms
Reduce places removed 888 places and 0 transitions.
Iterating global reduction 2 with 1776 rules applied. Total rules applied 2860 place count 1253 transition count 1203
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2862 place count 1251 transition count 1201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2863 place count 1250 transition count 1201
Applied a total of 2863 rules in 619 ms. Remains 1250 /2684 variables (removed 1434) and now considering 1201/2634 (removed 1433) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 619 ms. Remains : 1250/2684 places, 1201/2634 transitions.
[2023-03-22 14:28:02] [INFO ] Flatten gal took : 36 ms
[2023-03-22 14:28:02] [INFO ] Flatten gal took : 54 ms
[2023-03-22 14:28:02] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2653 transition count 2603
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2653 transition count 2603
Applied a total of 62 rules in 291 ms. Remains 2653 /2684 variables (removed 31) and now considering 2603/2634 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 2653/2684 places, 2603/2634 transitions.
[2023-03-22 14:28:02] [INFO ] Flatten gal took : 57 ms
[2023-03-22 14:28:02] [INFO ] Flatten gal took : 61 ms
[2023-03-22 14:28:02] [INFO ] Input system was already deterministic with 2603 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 2656 transition count 2606
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 2656 transition count 2606
Applied a total of 56 rules in 319 ms. Remains 2656 /2684 variables (removed 28) and now considering 2606/2634 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 2656/2684 places, 2606/2634 transitions.
[2023-03-22 14:28:03] [INFO ] Flatten gal took : 56 ms
[2023-03-22 14:28:03] [INFO ] Flatten gal took : 59 ms
[2023-03-22 14:28:03] [INFO ] Input system was already deterministic with 2606 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 2683 transition count 2383
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 1 with 250 rules applied. Total rules applied 500 place count 2433 transition count 2383
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 500 place count 2433 transition count 2132
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1002 place count 2182 transition count 2132
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 1034 place count 2150 transition count 2100
Iterating global reduction 2 with 32 rules applied. Total rules applied 1066 place count 2150 transition count 2100
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1066 place count 2150 transition count 2091
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1084 place count 2141 transition count 2091
Performed 888 Post agglomeration using F-continuation condition.Transition count delta: 888
Deduced a syphon composed of 888 places in 5 ms
Reduce places removed 888 places and 0 transitions.
Iterating global reduction 2 with 1776 rules applied. Total rules applied 2860 place count 1253 transition count 1203
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2862 place count 1251 transition count 1201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2863 place count 1250 transition count 1201
Applied a total of 2863 rules in 494 ms. Remains 1250 /2684 variables (removed 1434) and now considering 1201/2634 (removed 1433) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 494 ms. Remains : 1250/2684 places, 1201/2634 transitions.
[2023-03-22 14:28:03] [INFO ] Flatten gal took : 37 ms
[2023-03-22 14:28:04] [INFO ] Flatten gal took : 40 ms
[2023-03-22 14:28:04] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 2658 transition count 2608
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 2658 transition count 2608
Applied a total of 52 rules in 371 ms. Remains 2658 /2684 variables (removed 26) and now considering 2608/2634 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 2658/2684 places, 2608/2634 transitions.
[2023-03-22 14:28:04] [INFO ] Flatten gal took : 64 ms
[2023-03-22 14:28:04] [INFO ] Flatten gal took : 98 ms
[2023-03-22 14:28:04] [INFO ] Input system was already deterministic with 2608 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2684/2684 places, 2634/2634 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 251 place count 2683 transition count 2382
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 502 place count 2432 transition count 2382
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 502 place count 2432 transition count 2131
Deduced a syphon composed of 251 places in 4 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1004 place count 2181 transition count 2131
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 1036 place count 2149 transition count 2099
Iterating global reduction 2 with 32 rules applied. Total rules applied 1068 place count 2149 transition count 2099
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1068 place count 2149 transition count 2090
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1086 place count 2140 transition count 2090
Performed 887 Post agglomeration using F-continuation condition.Transition count delta: 887
Deduced a syphon composed of 887 places in 3 ms
Reduce places removed 887 places and 0 transitions.
Iterating global reduction 2 with 1774 rules applied. Total rules applied 2860 place count 1253 transition count 1203
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2862 place count 1251 transition count 1201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2863 place count 1250 transition count 1201
Applied a total of 2863 rules in 503 ms. Remains 1250 /2684 variables (removed 1434) and now considering 1201/2634 (removed 1433) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 503 ms. Remains : 1250/2684 places, 1201/2634 transitions.
[2023-03-22 14:28:05] [INFO ] Flatten gal took : 51 ms
[2023-03-22 14:28:05] [INFO ] Flatten gal took : 37 ms
[2023-03-22 14:28:05] [INFO ] Input system was already deterministic with 1201 transitions.
[2023-03-22 14:28:05] [INFO ] Flatten gal took : 62 ms
[2023-03-22 14:28:05] [INFO ] Flatten gal took : 65 ms
[2023-03-22 14:28:05] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-22 14:28:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2684 places, 2634 transitions and 8268 arcs took 9 ms.
Total runtime 107609 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: 2684 NrTr: 2634 NrArc: 8268)

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

net check time: 0m 0.001sec

init dd package: 0m 2.804sec


before gc: list nodes free: 1412143

after gc: idd nodes used:48578180, unused:15421820; list nodes free:67618280

RS generation: 24m11.856sec


-> last computed set: #nodes 48575498 (4.9e+07) #states 163,473,160,016,561 (14)


CANNOT_COMPUTE


BK_STOP 1679496769806

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


initing FirstDep: 0m 0.022sec

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-050B"
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 ShieldIIPs-PT-050B, 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 r394-oct2-167903717500154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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