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.r393-oct2-167903716700154.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 ltsminxred
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 r393-oct2-167903716700154
=====================================================================

--------------------
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 1679428468534

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 19:54:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 19:54:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:54:31] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2023-03-21 19:54:32] [INFO ] Transformed 3003 places.
[2023-03-21 19:54:32] [INFO ] Transformed 2953 transitions.
[2023-03-21 19:54:32] [INFO ] Found NUPN structural information;
[2023-03-21 19:54:32] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 547 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 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 976 ms. Remains 2684 /3003 variables (removed 319) and now considering 2634/2953 (removed 319) transitions.
// Phase 1: matrix 2634 rows 2684 cols
[2023-03-21 19:54:33] [INFO ] Computed 451 place invariants in 50 ms
[2023-03-21 19:54:35] [INFO ] Implicit Places using invariants in 2404 ms returned []
[2023-03-21 19:54:35] [INFO ] Invariant cache hit.
[2023-03-21 19:54:38] [INFO ] Implicit Places using invariants and state equation in 2436 ms returned []
Implicit Place search using SMT with State Equation took 4886 ms to find 0 implicit places.
[2023-03-21 19:54:38] [INFO ] Invariant cache hit.
[2023-03-21 19:54:40] [INFO ] Dead Transitions using invariants and state equation in 2700 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 8568 ms. Remains : 2684/3003 places, 2634/2953 transitions.
Support contains 196 out of 2684 places after structural reductions.
[2023-03-21 19:54:41] [INFO ] Flatten gal took : 192 ms
[2023-03-21 19:54:41] [INFO ] Flatten gal took : 119 ms
[2023-03-21 19:54:41] [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 660 ms. (steps per millisecond=15 ) properties (out of 105) seen :57
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) 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 48) 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 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) 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 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 48) 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 48) 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 48) 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 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 48) 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 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) seen :0
Running SMT prover for 48 properties.
[2023-03-21 19:54:42] [INFO ] Invariant cache hit.
[2023-03-21 19:54:47] [INFO ] [Real]Absence check using 451 positive place invariants in 362 ms returned sat
[2023-03-21 19:54:47] [INFO ] After 4425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:48
[2023-03-21 19:54:51] [INFO ] [Nat]Absence check using 451 positive place invariants in 305 ms returned sat
[2023-03-21 19:55:04] [INFO ] After 10145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :48
[2023-03-21 19:55:05] [INFO ] Deduced a trap composed of 26 places in 830 ms of which 12 ms to minimize.
[2023-03-21 19:55:07] [INFO ] Deduced a trap composed of 23 places in 1645 ms of which 1 ms to minimize.
[2023-03-21 19:55:08] [INFO ] Deduced a trap composed of 21 places in 779 ms of which 2 ms to minimize.
[2023-03-21 19:55:09] [INFO ] Deduced a trap composed of 30 places in 721 ms of which 15 ms to minimize.
[2023-03-21 19:55:10] [INFO ] Deduced a trap composed of 29 places in 809 ms of which 14 ms to minimize.
[2023-03-21 19:55:11] [INFO ] Deduced a trap composed of 37 places in 791 ms of which 1 ms to minimize.
[2023-03-21 19:55:11] [INFO ] Deduced a trap composed of 21 places in 694 ms of which 2 ms to minimize.
[2023-03-21 19:55:12] [INFO ] Deduced a trap composed of 23 places in 663 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 19:55:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:55:12] [INFO ] After 25404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:48
Parikh walk visited 1 properties in 7725 ms.
Support contains 90 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 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 971 place count 2191 transition count 2141
Iterating global reduction 3 with 15 rules applied. Total rules applied 986 place count 2191 transition count 2141
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 986 place count 2191 transition count 2135
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 998 place count 2185 transition count 2135
Performed 864 Post agglomeration using F-continuation condition.Transition count delta: 864
Deduced a syphon composed of 864 places in 10 ms
Reduce places removed 864 places and 0 transitions.
Iterating global reduction 3 with 1728 rules applied. Total rules applied 2726 place count 1321 transition count 1271
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 323 times.
Drop transitions removed 323 transitions
Iterating global reduction 3 with 323 rules applied. Total rules applied 3049 place count 1321 transition count 1271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3050 place count 1320 transition count 1270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3051 place count 1319 transition count 1270
Applied a total of 3051 rules in 910 ms. Remains 1319 /2684 variables (removed 1365) and now considering 1270/2634 (removed 1364) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 910 ms. Remains : 1319/2684 places, 1270/2634 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 47) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1270 rows 1319 cols
[2023-03-21 19:55:22] [INFO ] Computed 450 place invariants in 26 ms
[2023-03-21 19:55:22] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 19:55:23] [INFO ] [Nat]Absence check using 442 positive place invariants in 137 ms returned sat
[2023-03-21 19:55:23] [INFO ] [Nat]Absence check using 442 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-21 19:55:25] [INFO ] After 1512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 19:55:25] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2023-03-21 19:55:25] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 0 ms to minimize.
[2023-03-21 19:55:26] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 0 ms to minimize.
[2023-03-21 19:55:26] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-21 19:55:26] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 6 ms to minimize.
[2023-03-21 19:55:27] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 1 ms to minimize.
[2023-03-21 19:55:27] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-21 19:55:28] [INFO ] Deduced a trap composed of 15 places in 521 ms of which 1 ms to minimize.
[2023-03-21 19:55:28] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2023-03-21 19:55:28] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2023-03-21 19:55:28] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2023-03-21 19:55:29] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-21 19:55:29] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 2 ms to minimize.
[2023-03-21 19:55:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4102 ms
[2023-03-21 19:55:30] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 1 ms to minimize.
[2023-03-21 19:55:30] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 0 ms to minimize.
[2023-03-21 19:55:30] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2023-03-21 19:55:30] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-21 19:55:30] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-21 19:55:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1117 ms
[2023-03-21 19:55:31] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2023-03-21 19:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-21 19:55:31] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-21 19:55:31] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2023-03-21 19:55:32] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 1 ms to minimize.
[2023-03-21 19:55:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 740 ms
[2023-03-21 19:55:32] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2023-03-21 19:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2023-03-21 19:55:32] [INFO ] After 9153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 963 ms.
[2023-03-21 19:55:33] [INFO ] After 10872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 681 ms.
Support contains 28 out of 1319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1319/1319 places, 1270/1270 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 1319 transition count 1268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1317 transition count 1268
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 4 place count 1317 transition count 1255
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 30 place count 1304 transition count 1255
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 98 place count 1270 transition count 1221
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 116 place count 1270 transition count 1221
Applied a total of 116 rules in 164 ms. Remains 1270 /1319 variables (removed 49) and now considering 1221/1270 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 1270/1319 places, 1221/1270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1221 rows 1270 cols
[2023-03-21 19:55:35] [INFO ] Computed 450 place invariants in 66 ms
[2023-03-21 19:55:35] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 19:55:36] [INFO ] [Nat]Absence check using 445 positive place invariants in 315 ms returned sat
[2023-03-21 19:55:36] [INFO ] [Nat]Absence check using 445 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-21 19:55:38] [INFO ] After 1303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 19:55:38] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 0 ms to minimize.
[2023-03-21 19:55:38] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 27 ms to minimize.
[2023-03-21 19:55:39] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 1 ms to minimize.
[2023-03-21 19:55:39] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 0 ms to minimize.
[2023-03-21 19:55:40] [INFO ] Deduced a trap composed of 9 places in 407 ms of which 1 ms to minimize.
[2023-03-21 19:55:40] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2023-03-21 19:55:40] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2023-03-21 19:55:40] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 0 ms to minimize.
[2023-03-21 19:55:41] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2023-03-21 19:55:41] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2023-03-21 19:55:41] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2023-03-21 19:55:41] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 0 ms to minimize.
[2023-03-21 19:55:42] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 0 ms to minimize.
[2023-03-21 19:55:42] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
[2023-03-21 19:55:42] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4133 ms
[2023-03-21 19:55:42] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 1 ms to minimize.
[2023-03-21 19:55:43] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2023-03-21 19:55:43] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-21 19:55:43] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
[2023-03-21 19:55:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1031 ms
[2023-03-21 19:55:43] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 1 ms to minimize.
[2023-03-21 19:55:44] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2023-03-21 19:55:44] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 1 ms to minimize.
[2023-03-21 19:55:44] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 24 ms to minimize.
[2023-03-21 19:55:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1040 ms
[2023-03-21 19:55:44] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 0 ms to minimize.
[2023-03-21 19:55:45] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 8 ms to minimize.
[2023-03-21 19:55:45] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-21 19:55:45] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2023-03-21 19:55:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 851 ms
[2023-03-21 19:55:45] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2023-03-21 19:55:46] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-21 19:55:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2023-03-21 19:55:46] [INFO ] After 9435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 574 ms.
[2023-03-21 19:55:46] [INFO ] After 10792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 462 ms.
Support contains 22 out of 1270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1270/1270 places, 1221/1221 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1268 transition count 1219
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 1268 transition count 1219
Applied a total of 7 rules in 185 ms. Remains 1268 /1270 variables (removed 2) and now considering 1219/1221 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 1268/1270 places, 1219/1221 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1219 rows 1268 cols
[2023-03-21 19:55:48] [INFO ] Computed 450 place invariants in 11 ms
[2023-03-21 19:55:48] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 19:55:48] [INFO ] [Nat]Absence check using 448 positive place invariants in 119 ms returned sat
[2023-03-21 19:55:48] [INFO ] [Nat]Absence check using 448 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 19:55:50] [INFO ] After 1603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 19:55:51] [INFO ] Deduced a trap composed of 8 places in 804 ms of which 0 ms to minimize.
[2023-03-21 19:55:51] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 0 ms to minimize.
[2023-03-21 19:55:52] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 28 ms to minimize.
[2023-03-21 19:55:52] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 0 ms to minimize.
[2023-03-21 19:55:54] [INFO ] Deduced a trap composed of 10 places in 1696 ms of which 26 ms to minimize.
[2023-03-21 19:55:54] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-21 19:55:54] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 20 ms to minimize.
[2023-03-21 19:55:54] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 39 ms to minimize.
[2023-03-21 19:55:55] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4384 ms
[2023-03-21 19:55:55] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2023-03-21 19:55:55] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 1 ms to minimize.
[2023-03-21 19:55:55] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2023-03-21 19:55:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 801 ms
[2023-03-21 19:55:56] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2023-03-21 19:55:56] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 4 ms to minimize.
[2023-03-21 19:55:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 460 ms
[2023-03-21 19:55:56] [INFO ] After 7718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 456 ms.
[2023-03-21 19:55:57] [INFO ] After 8807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 625 ms.
Support contains 19 out of 1268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1268/1268 places, 1219/1219 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 1264 transition count 1215
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 1264 transition count 1215
Applied a total of 10 rules in 92 ms. Remains 1264 /1268 variables (removed 4) and now considering 1215/1219 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 1264/1268 places, 1215/1219 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 71275 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71275 steps, saw 69718 distinct states, run finished after 3004 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1215 rows 1264 cols
[2023-03-21 19:56:01] [INFO ] Computed 450 place invariants in 7 ms
[2023-03-21 19:56:01] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 19:56:02] [INFO ] [Nat]Absence check using 448 positive place invariants in 102 ms returned sat
[2023-03-21 19:56:02] [INFO ] [Nat]Absence check using 448 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 19:56:03] [INFO ] After 1303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 19:56:04] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2023-03-21 19:56:04] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
[2023-03-21 19:56:04] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 1 ms to minimize.
[2023-03-21 19:56:04] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2023-03-21 19:56:05] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2023-03-21 19:56:05] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 0 ms to minimize.
[2023-03-21 19:56:05] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2023-03-21 19:56:06] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2023-03-21 19:56:06] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2023-03-21 19:56:06] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 1 ms to minimize.
[2023-03-21 19:56:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2821 ms
[2023-03-21 19:56:06] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2023-03-21 19:56:07] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-21 19:56:07] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-21 19:56:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 667 ms
[2023-03-21 19:56:07] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2023-03-21 19:56:07] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-03-21 19:56:08] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2023-03-21 19:56:08] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2023-03-21 19:56:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 767 ms
[2023-03-21 19:56:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2023-03-21 19:56:08] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2023-03-21 19:56:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2023-03-21 19:56:08] [INFO ] After 6414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 585 ms.
[2023-03-21 19:56:09] [INFO ] After 7468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 500 ms.
Support contains 19 out of 1264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1264/1264 places, 1215/1215 transitions.
Applied a total of 0 rules in 77 ms. Remains 1264 /1264 variables (removed 0) and now considering 1215/1215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1264/1264 places, 1215/1215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1264/1264 places, 1215/1215 transitions.
Applied a total of 0 rules in 60 ms. Remains 1264 /1264 variables (removed 0) and now considering 1215/1215 (removed 0) transitions.
[2023-03-21 19:56:09] [INFO ] Invariant cache hit.
[2023-03-21 19:56:12] [INFO ] Implicit Places using invariants in 2329 ms returned []
[2023-03-21 19:56:12] [INFO ] Invariant cache hit.
[2023-03-21 19:56:16] [INFO ] Implicit Places using invariants and state equation in 3906 ms returned []
Implicit Place search using SMT with State Equation took 6251 ms to find 0 implicit places.
[2023-03-21 19:56:16] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-21 19:56:16] [INFO ] Invariant cache hit.
[2023-03-21 19:56:17] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7433 ms. Remains : 1264/1264 places, 1215/1215 transitions.
Applied a total of 0 rules in 37 ms. Remains 1264 /1264 variables (removed 0) and now considering 1215/1215 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-21 19:56:17] [INFO ] Invariant cache hit.
[2023-03-21 19:56:17] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 19:56:18] [INFO ] [Nat]Absence check using 448 positive place invariants in 98 ms returned sat
[2023-03-21 19:56:18] [INFO ] [Nat]Absence check using 448 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-21 19:56:19] [INFO ] After 1592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 19:56:20] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 0 ms to minimize.
[2023-03-21 19:56:20] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 0 ms to minimize.
[2023-03-21 19:56:20] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 0 ms to minimize.
[2023-03-21 19:56:21] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 1 ms to minimize.
[2023-03-21 19:56:21] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2023-03-21 19:56:21] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-21 19:56:21] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2023-03-21 19:56:22] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2023-03-21 19:56:22] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 0 ms to minimize.
[2023-03-21 19:56:22] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 0 ms to minimize.
[2023-03-21 19:56:22] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 0 ms to minimize.
[2023-03-21 19:56:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2745 ms
[2023-03-21 19:56:23] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2023-03-21 19:56:23] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 3 ms to minimize.
[2023-03-21 19:56:23] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 0 ms to minimize.
[2023-03-21 19:56:24] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 1 ms to minimize.
[2023-03-21 19:56:24] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 1 ms to minimize.
[2023-03-21 19:56:24] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2023-03-21 19:56:24] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 1 ms to minimize.
[2023-03-21 19:56:25] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2023-03-21 19:56:25] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2023-03-21 19:56:25] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2023-03-21 19:56:25] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2023-03-21 19:56:25] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2023-03-21 19:56:25] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2862 ms
[2023-03-21 19:56:26] [INFO ] After 7807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 556 ms.
[2023-03-21 19:56:26] [INFO ] After 9018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-21 19:56:26] [INFO ] Flatten gal took : 108 ms
[2023-03-21 19:56:26] [INFO ] Flatten gal took : 91 ms
[2023-03-21 19:56:27] [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 252 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 253 ms. Remains : 2654/2684 places, 2604/2634 transitions.
[2023-03-21 19:56:27] [INFO ] Flatten gal took : 75 ms
[2023-03-21 19:56:27] [INFO ] Flatten gal took : 86 ms
[2023-03-21 19:56:27] [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 260 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 261 ms. Remains : 2655/2684 places, 2605/2634 transitions.
[2023-03-21 19:56:28] [INFO ] Flatten gal took : 95 ms
[2023-03-21 19:56:28] [INFO ] Flatten gal took : 104 ms
[2023-03-21 19:56:28] [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 311 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 313 ms. Remains : 2652/2684 places, 2602/2634 transitions.
[2023-03-21 19:56:29] [INFO ] Flatten gal took : 80 ms
[2023-03-21 19:56:29] [INFO ] Flatten gal took : 94 ms
[2023-03-21 19:56:29] [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 224 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 232 ms. Remains : 2658/2684 places, 2608/2634 transitions.
[2023-03-21 19:56:29] [INFO ] Flatten gal took : 80 ms
[2023-03-21 19:56:29] [INFO ] Flatten gal took : 84 ms
[2023-03-21 19:56:30] [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 362 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 362 ms. Remains : 2655/2684 places, 2605/2634 transitions.
[2023-03-21 19:56:30] [INFO ] Flatten gal took : 61 ms
[2023-03-21 19:56:30] [INFO ] Flatten gal took : 74 ms
[2023-03-21 19:56:30] [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 221 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 222 ms. Remains : 2654/2684 places, 2604/2634 transitions.
[2023-03-21 19:56:30] [INFO ] Flatten gal took : 60 ms
[2023-03-21 19:56:31] [INFO ] Flatten gal took : 140 ms
[2023-03-21 19:56:31] [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 6 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 7 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 5 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 655 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 655 ms. Remains : 1253/2684 places, 1204/2634 transitions.
[2023-03-21 19:56:31] [INFO ] Flatten gal took : 51 ms
[2023-03-21 19:56:32] [INFO ] Flatten gal took : 72 ms
[2023-03-21 19:56:32] [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 6 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 4 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 576 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 576 ms. Remains : 1250/2684 places, 1201/2634 transitions.
[2023-03-21 19:56:32] [INFO ] Flatten gal took : 37 ms
[2023-03-21 19:56:32] [INFO ] Flatten gal took : 65 ms
[2023-03-21 19:56:33] [INFO ] Input system was already deterministic with 1201 transitions.
Finished random walk after 263 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=65 )
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 7 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 7 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 4 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 616 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 616 ms. Remains : 1271/2684 places, 1222/2634 transitions.
[2023-03-21 19:56:33] [INFO ] Flatten gal took : 38 ms
[2023-03-21 19:56:33] [INFO ] Flatten gal took : 41 ms
[2023-03-21 19:56:33] [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 307 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 321 ms. Remains : 2653/2684 places, 2603/2634 transitions.
[2023-03-21 19:56:34] [INFO ] Flatten gal took : 67 ms
[2023-03-21 19:56:34] [INFO ] Flatten gal took : 74 ms
[2023-03-21 19:56:34] [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 5 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 490 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 490 ms. Remains : 1250/2684 places, 1201/2634 transitions.
[2023-03-21 19:56:34] [INFO ] Flatten gal took : 35 ms
[2023-03-21 19:56:35] [INFO ] Flatten gal took : 79 ms
[2023-03-21 19:56:35] [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 259 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 259 ms. Remains : 2653/2684 places, 2603/2634 transitions.
[2023-03-21 19:56:35] [INFO ] Flatten gal took : 67 ms
[2023-03-21 19:56:35] [INFO ] Flatten gal took : 79 ms
[2023-03-21 19:56:35] [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 277 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 277 ms. Remains : 2656/2684 places, 2606/2634 transitions.
[2023-03-21 19:56:36] [INFO ] Flatten gal took : 90 ms
[2023-03-21 19:56:36] [INFO ] Flatten gal took : 77 ms
[2023-03-21 19:56:36] [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 11 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 7 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 507 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 507 ms. Remains : 1250/2684 places, 1201/2634 transitions.
[2023-03-21 19:56:36] [INFO ] Flatten gal took : 34 ms
[2023-03-21 19:56:36] [INFO ] Flatten gal took : 38 ms
[2023-03-21 19:56:37] [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 294 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 294 ms. Remains : 2658/2684 places, 2608/2634 transitions.
[2023-03-21 19:56:37] [INFO ] Flatten gal took : 63 ms
[2023-03-21 19:56:37] [INFO ] Flatten gal took : 71 ms
[2023-03-21 19:56:37] [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 8 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 6 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 4 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 533 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 533 ms. Remains : 1250/2684 places, 1201/2634 transitions.
[2023-03-21 19:56:38] [INFO ] Flatten gal took : 34 ms
[2023-03-21 19:56:38] [INFO ] Flatten gal took : 37 ms
[2023-03-21 19:56:38] [INFO ] Input system was already deterministic with 1201 transitions.
[2023-03-21 19:56:38] [INFO ] Flatten gal took : 61 ms
[2023-03-21 19:56:38] [INFO ] Flatten gal took : 65 ms
[2023-03-21 19:56:38] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-21 19:56:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2684 places, 2634 transitions and 8268 arcs took 18 ms.
Total runtime 127094 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/902/ctl_0_ --ctl=/tmp/902/ctl_1_ --ctl=/tmp/902/ctl_2_ --ctl=/tmp/902/ctl_3_ --ctl=/tmp/902/ctl_4_ --ctl=/tmp/902/ctl_5_ --ctl=/tmp/902/ctl_6_ --ctl=/tmp/902/ctl_7_ --ctl=/tmp/902/ctl_8_ --ctl=/tmp/902/ctl_9_ --ctl=/tmp/902/ctl_10_ --ctl=/tmp/902/ctl_11_ --ctl=/tmp/902/ctl_12_ --ctl=/tmp/902/ctl_13_ --ctl=/tmp/902/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12081472 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16093884 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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="ltsminxred"
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 ltsminxred"
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 r393-oct2-167903716700154"
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 ;