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.r010-oct2-167813599100479.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is AutoFlight-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599100479
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.6K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 18:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 266K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-12b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678692429098

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 07:27:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 07:27:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:27:12] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-13 07:27:12] [INFO ] Transformed 1126 places.
[2023-03-13 07:27:12] [INFO ] Transformed 1124 transitions.
[2023-03-13 07:27:12] [INFO ] Found NUPN structural information;
[2023-03-13 07:27:12] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 364 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 16) seen :9
FORMULA AutoFlight-PT-12b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1124 rows 1126 cols
[2023-03-13 07:27:13] [INFO ] Computed 76 place invariants in 25 ms
[2023-03-13 07:27:14] [INFO ] After 907ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 07:27:14] [INFO ] [Nat]Absence check using 75 positive place invariants in 31 ms returned sat
[2023-03-13 07:27:14] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 07:27:16] [INFO ] After 1514ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-13 07:27:17] [INFO ] Deduced a trap composed of 61 places in 558 ms of which 13 ms to minimize.
[2023-03-13 07:27:18] [INFO ] Deduced a trap composed of 48 places in 851 ms of which 2 ms to minimize.
[2023-03-13 07:27:18] [INFO ] Deduced a trap composed of 165 places in 469 ms of which 2 ms to minimize.
[2023-03-13 07:27:19] [INFO ] Deduced a trap composed of 42 places in 411 ms of which 1 ms to minimize.
[2023-03-13 07:27:19] [INFO ] Deduced a trap composed of 141 places in 464 ms of which 4 ms to minimize.
[2023-03-13 07:27:20] [INFO ] Deduced a trap composed of 47 places in 386 ms of which 1 ms to minimize.
[2023-03-13 07:27:20] [INFO ] Deduced a trap composed of 137 places in 296 ms of which 0 ms to minimize.
[2023-03-13 07:27:20] [INFO ] Deduced a trap composed of 59 places in 525 ms of which 1 ms to minimize.
[2023-03-13 07:27:21] [INFO ] Deduced a trap composed of 60 places in 305 ms of which 2 ms to minimize.
[2023-03-13 07:27:21] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 1 ms to minimize.
[2023-03-13 07:27:22] [INFO ] Deduced a trap composed of 172 places in 311 ms of which 1 ms to minimize.
[2023-03-13 07:27:22] [INFO ] Deduced a trap composed of 46 places in 295 ms of which 0 ms to minimize.
[2023-03-13 07:27:22] [INFO ] Deduced a trap composed of 132 places in 297 ms of which 1 ms to minimize.
[2023-03-13 07:27:22] [INFO ] Deduced a trap composed of 51 places in 232 ms of which 1 ms to minimize.
[2023-03-13 07:27:23] [INFO ] Deduced a trap composed of 89 places in 348 ms of which 1 ms to minimize.
[2023-03-13 07:27:24] [INFO ] Deduced a trap composed of 43 places in 797 ms of which 1 ms to minimize.
[2023-03-13 07:27:24] [INFO ] Deduced a trap composed of 99 places in 302 ms of which 0 ms to minimize.
[2023-03-13 07:27:25] [INFO ] Deduced a trap composed of 105 places in 407 ms of which 0 ms to minimize.
[2023-03-13 07:27:25] [INFO ] Deduced a trap composed of 146 places in 348 ms of which 1 ms to minimize.
[2023-03-13 07:27:25] [INFO ] Deduced a trap composed of 159 places in 298 ms of which 1 ms to minimize.
[2023-03-13 07:27:26] [INFO ] Deduced a trap composed of 146 places in 297 ms of which 1 ms to minimize.
[2023-03-13 07:27:26] [INFO ] Deduced a trap composed of 57 places in 351 ms of which 2 ms to minimize.
[2023-03-13 07:27:27] [INFO ] Deduced a trap composed of 93 places in 380 ms of which 1 ms to minimize.
[2023-03-13 07:27:29] [INFO ] Deduced a trap composed of 172 places in 1995 ms of which 1 ms to minimize.
[2023-03-13 07:27:29] [INFO ] Deduced a trap composed of 100 places in 392 ms of which 1 ms to minimize.
[2023-03-13 07:27:29] [INFO ] Deduced a trap composed of 154 places in 259 ms of which 1 ms to minimize.
[2023-03-13 07:27:30] [INFO ] Deduced a trap composed of 91 places in 275 ms of which 1 ms to minimize.
[2023-03-13 07:27:30] [INFO ] Deduced a trap composed of 120 places in 324 ms of which 0 ms to minimize.
[2023-03-13 07:27:30] [INFO ] Deduced a trap composed of 149 places in 289 ms of which 9 ms to minimize.
[2023-03-13 07:27:31] [INFO ] Deduced a trap composed of 133 places in 289 ms of which 1 ms to minimize.
[2023-03-13 07:27:31] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 0 ms to minimize.
[2023-03-13 07:27:31] [INFO ] Deduced a trap composed of 84 places in 268 ms of which 0 ms to minimize.
[2023-03-13 07:27:32] [INFO ] Deduced a trap composed of 93 places in 353 ms of which 1 ms to minimize.
[2023-03-13 07:27:32] [INFO ] Deduced a trap composed of 111 places in 266 ms of which 0 ms to minimize.
[2023-03-13 07:27:32] [INFO ] Deduced a trap composed of 103 places in 239 ms of which 1 ms to minimize.
[2023-03-13 07:27:33] [INFO ] Deduced a trap composed of 157 places in 246 ms of which 1 ms to minimize.
[2023-03-13 07:27:33] [INFO ] Deduced a trap composed of 89 places in 268 ms of which 2 ms to minimize.
[2023-03-13 07:27:33] [INFO ] Deduced a trap composed of 120 places in 288 ms of which 0 ms to minimize.
[2023-03-13 07:27:34] [INFO ] Deduced a trap composed of 59 places in 197 ms of which 1 ms to minimize.
[2023-03-13 07:27:34] [INFO ] Deduced a trap composed of 105 places in 355 ms of which 14 ms to minimize.
[2023-03-13 07:27:35] [INFO ] Deduced a trap composed of 175 places in 319 ms of which 0 ms to minimize.
[2023-03-13 07:27:35] [INFO ] Deduced a trap composed of 152 places in 289 ms of which 1 ms to minimize.
[2023-03-13 07:27:35] [INFO ] Deduced a trap composed of 179 places in 352 ms of which 1 ms to minimize.
[2023-03-13 07:27:36] [INFO ] Deduced a trap composed of 169 places in 375 ms of which 1 ms to minimize.
[2023-03-13 07:27:36] [INFO ] Deduced a trap composed of 102 places in 424 ms of which 0 ms to minimize.
[2023-03-13 07:27:37] [INFO ] Deduced a trap composed of 102 places in 294 ms of which 0 ms to minimize.
[2023-03-13 07:27:37] [INFO ] Deduced a trap composed of 192 places in 271 ms of which 2 ms to minimize.
[2023-03-13 07:27:37] [INFO ] Deduced a trap composed of 172 places in 290 ms of which 1 ms to minimize.
[2023-03-13 07:27:38] [INFO ] Deduced a trap composed of 104 places in 241 ms of which 1 ms to minimize.
[2023-03-13 07:27:38] [INFO ] Deduced a trap composed of 156 places in 423 ms of which 1 ms to minimize.
[2023-03-13 07:27:38] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 22042 ms
[2023-03-13 07:27:39] [INFO ] Deduced a trap composed of 15 places in 436 ms of which 1 ms to minimize.
[2023-03-13 07:27:39] [INFO ] Deduced a trap composed of 60 places in 268 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.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 07:27:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 07:27:39] [INFO ] After 25220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA AutoFlight-PT-12b-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
FORMULA AutoFlight-PT-12b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-12b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 136 ms.
Support contains 79 out of 1126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 1126 transition count 769
Reduce places removed 355 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 406 rules applied. Total rules applied 761 place count 771 transition count 718
Reduce places removed 9 places and 0 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 2 with 47 rules applied. Total rules applied 808 place count 762 transition count 680
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 49 rules applied. Total rules applied 857 place count 724 transition count 669
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 860 place count 721 transition count 669
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 130 Pre rules applied. Total rules applied 860 place count 721 transition count 539
Deduced a syphon composed of 130 places in 2 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 5 with 260 rules applied. Total rules applied 1120 place count 591 transition count 539
Discarding 97 places :
Symmetric choice reduction at 5 with 97 rule applications. Total rules 1217 place count 494 transition count 442
Iterating global reduction 5 with 97 rules applied. Total rules applied 1314 place count 494 transition count 442
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1315 place count 494 transition count 441
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 26 Pre rules applied. Total rules applied 1315 place count 494 transition count 415
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 1367 place count 468 transition count 415
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 6 with 178 rules applied. Total rules applied 1545 place count 379 transition count 326
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 1552 place count 379 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1554 place count 378 transition count 318
Free-agglomeration rule applied 39 times.
Iterating global reduction 6 with 39 rules applied. Total rules applied 1593 place count 378 transition count 279
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 6 with 39 rules applied. Total rules applied 1632 place count 339 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1633 place count 338 transition count 278
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1635 place count 336 transition count 278
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1635 place count 336 transition count 276
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1639 place count 334 transition count 276
Applied a total of 1639 rules in 215 ms. Remains 334 /1126 variables (removed 792) and now considering 276/1124 (removed 848) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 334/1126 places, 276/1124 transitions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 4) seen :1
FORMULA AutoFlight-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 276 rows 334 cols
[2023-03-13 07:27:40] [INFO ] Computed 74 place invariants in 3 ms
[2023-03-13 07:27:40] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 07:27:40] [INFO ] [Nat]Absence check using 72 positive place invariants in 17 ms returned sat
[2023-03-13 07:27:40] [INFO ] [Nat]Absence check using 72 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-13 07:27:40] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 07:27:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-13 07:27:40] [INFO ] After 153ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 07:27:41] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2023-03-13 07:27:41] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-13 07:27:41] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 1 ms to minimize.
[2023-03-13 07:27:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 436 ms
[2023-03-13 07:27:41] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-13 07:27:41] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2023-03-13 07:27:41] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2023-03-13 07:27:41] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 0 ms to minimize.
[2023-03-13 07:27:42] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 1 ms to minimize.
[2023-03-13 07:27:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 710 ms
[2023-03-13 07:27:42] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 1 ms to minimize.
[2023-03-13 07:27:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-13 07:27:42] [INFO ] After 1649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-13 07:27:42] [INFO ] After 2186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 78 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 276/276 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 334 transition count 275
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 333 transition count 275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 332 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 332 transition count 274
Applied a total of 4 rules in 21 ms. Remains 332 /334 variables (removed 2) and now considering 274/276 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 332/334 places, 274/276 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 522726 steps, run timeout after 3004 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 522726 steps, saw 76680 distinct states, run finished after 3018 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 274 rows 332 cols
[2023-03-13 07:27:45] [INFO ] Computed 74 place invariants in 5 ms
[2023-03-13 07:27:45] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 07:27:46] [INFO ] [Nat]Absence check using 72 positive place invariants in 53 ms returned sat
[2023-03-13 07:27:46] [INFO ] [Nat]Absence check using 72 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-13 07:27:46] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 07:27:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-13 07:27:46] [INFO ] After 146ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 07:27:46] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2023-03-13 07:27:46] [INFO ] Deduced a trap composed of 103 places in 79 ms of which 7 ms to minimize.
[2023-03-13 07:27:47] [INFO ] Deduced a trap composed of 110 places in 78 ms of which 1 ms to minimize.
[2023-03-13 07:27:47] [INFO ] Deduced a trap composed of 104 places in 65 ms of which 0 ms to minimize.
[2023-03-13 07:27:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 494 ms
[2023-03-13 07:27:47] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-13 07:27:47] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 19 ms to minimize.
[2023-03-13 07:27:47] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 13 ms to minimize.
[2023-03-13 07:27:50] [INFO ] Deduced a trap composed of 48 places in 2698 ms of which 14 ms to minimize.
[2023-03-13 07:27:50] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 1 ms to minimize.
[2023-03-13 07:27:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3199 ms
[2023-03-13 07:27:50] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 0 ms to minimize.
[2023-03-13 07:27:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-13 07:27:50] [INFO ] After 4248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-13 07:27:50] [INFO ] After 4910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 78 out of 332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 332/332 places, 274/274 transitions.
Applied a total of 0 rules in 19 ms. Remains 332 /332 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 332/332 places, 274/274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 332/332 places, 274/274 transitions.
Applied a total of 0 rules in 30 ms. Remains 332 /332 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2023-03-13 07:27:50] [INFO ] Invariant cache hit.
[2023-03-13 07:27:51] [INFO ] Implicit Places using invariants in 959 ms returned [306]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 962 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 331/332 places, 274/274 transitions.
Applied a total of 0 rules in 12 ms. Remains 331 /331 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1006 ms. Remains : 331/332 places, 274/274 transitions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 589264 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 589264 steps, saw 86365 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 274 rows 331 cols
[2023-03-13 07:27:55] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-13 07:27:55] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 07:27:55] [INFO ] [Nat]Absence check using 73 positive place invariants in 24 ms returned sat
[2023-03-13 07:27:56] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 07:27:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-13 07:27:56] [INFO ] After 148ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 07:27:56] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-13 07:27:56] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 0 ms to minimize.
[2023-03-13 07:27:56] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2023-03-13 07:27:57] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2023-03-13 07:27:57] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2023-03-13 07:27:57] [INFO ] Deduced a trap composed of 105 places in 94 ms of which 1 ms to minimize.
[2023-03-13 07:27:57] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 1 ms to minimize.
[2023-03-13 07:27:57] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2023-03-13 07:27:57] [INFO ] Deduced a trap composed of 112 places in 104 ms of which 0 ms to minimize.
[2023-03-13 07:27:57] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 1 ms to minimize.
[2023-03-13 07:27:58] [INFO ] Deduced a trap composed of 106 places in 464 ms of which 0 ms to minimize.
[2023-03-13 07:27:58] [INFO ] Deduced a trap composed of 102 places in 82 ms of which 1 ms to minimize.
[2023-03-13 07:27:58] [INFO ] Deduced a trap composed of 107 places in 64 ms of which 8 ms to minimize.
[2023-03-13 07:27:58] [INFO ] Deduced a trap composed of 108 places in 80 ms of which 1 ms to minimize.
[2023-03-13 07:27:58] [INFO ] Deduced a trap composed of 110 places in 66 ms of which 0 ms to minimize.
[2023-03-13 07:27:58] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2284 ms
[2023-03-13 07:27:58] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2023-03-13 07:27:58] [INFO ] Deduced a trap composed of 109 places in 80 ms of which 1 ms to minimize.
[2023-03-13 07:27:59] [INFO ] Deduced a trap composed of 109 places in 182 ms of which 1 ms to minimize.
[2023-03-13 07:27:59] [INFO ] Deduced a trap composed of 111 places in 90 ms of which 0 ms to minimize.
[2023-03-13 07:27:59] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 1 ms to minimize.
[2023-03-13 07:27:59] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 0 ms to minimize.
[2023-03-13 07:27:59] [INFO ] Deduced a trap composed of 114 places in 105 ms of which 1 ms to minimize.
[2023-03-13 07:27:59] [INFO ] Deduced a trap composed of 111 places in 75 ms of which 0 ms to minimize.
[2023-03-13 07:27:59] [INFO ] Deduced a trap composed of 109 places in 85 ms of which 0 ms to minimize.
[2023-03-13 07:27:59] [INFO ] Deduced a trap composed of 111 places in 71 ms of which 1 ms to minimize.
[2023-03-13 07:28:00] [INFO ] Deduced a trap composed of 109 places in 89 ms of which 0 ms to minimize.
[2023-03-13 07:28:00] [INFO ] Deduced a trap composed of 107 places in 70 ms of which 0 ms to minimize.
[2023-03-13 07:28:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1368 ms
[2023-03-13 07:28:00] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 0 ms to minimize.
[2023-03-13 07:28:00] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2023-03-13 07:28:00] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 0 ms to minimize.
[2023-03-13 07:28:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 428 ms
[2023-03-13 07:28:00] [INFO ] After 4417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 190 ms.
[2023-03-13 07:28:00] [INFO ] After 5623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 77 ms.
Support contains 78 out of 331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 274/274 transitions.
Applied a total of 0 rules in 9 ms. Remains 331 /331 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 331/331 places, 274/274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 274/274 transitions.
Applied a total of 0 rules in 10 ms. Remains 331 /331 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2023-03-13 07:28:00] [INFO ] Invariant cache hit.
[2023-03-13 07:28:01] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-13 07:28:01] [INFO ] Invariant cache hit.
[2023-03-13 07:28:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-13 07:28:01] [INFO ] Implicit Places using invariants and state equation in 655 ms returned [17, 38, 51, 53, 54, 71, 90]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 954 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 324/331 places, 274/274 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 324 transition count 273
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 323 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 322 transition count 272
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 4 place count 322 transition count 253
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 42 place count 303 transition count 253
Applied a total of 42 rules in 23 ms. Remains 303 /324 variables (removed 21) and now considering 253/274 (removed 21) transitions.
// Phase 1: matrix 253 rows 303 cols
[2023-03-13 07:28:01] [INFO ] Computed 66 place invariants in 2 ms
[2023-03-13 07:28:02] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-13 07:28:02] [INFO ] Invariant cache hit.
[2023-03-13 07:28:02] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-13 07:28:03] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 303/331 places, 253/274 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2357 ms. Remains : 303/331 places, 253/274 transitions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 617106 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617106 steps, saw 89905 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 07:28:06] [INFO ] Invariant cache hit.
[2023-03-13 07:28:06] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 07:28:06] [INFO ] [Nat]Absence check using 66 positive place invariants in 18 ms returned sat
[2023-03-13 07:28:07] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 07:28:07] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-13 07:28:07] [INFO ] After 235ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 07:28:07] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-13 07:28:07] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2023-03-13 07:28:07] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2023-03-13 07:28:07] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 0 ms to minimize.
[2023-03-13 07:28:08] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 0 ms to minimize.
[2023-03-13 07:28:08] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 0 ms to minimize.
[2023-03-13 07:28:08] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2023-03-13 07:28:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1105 ms
[2023-03-13 07:28:08] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-13 07:28:08] [INFO ] Deduced a trap composed of 35 places in 278 ms of which 0 ms to minimize.
[2023-03-13 07:28:08] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2023-03-13 07:28:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 512 ms
[2023-03-13 07:28:09] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2023-03-13 07:28:09] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 0 ms to minimize.
[2023-03-13 07:28:09] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 0 ms to minimize.
[2023-03-13 07:28:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 408 ms
[2023-03-13 07:28:09] [INFO ] After 2433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-13 07:28:09] [INFO ] After 3068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 42 ms.
Support contains 78 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 253/253 transitions.
Applied a total of 0 rules in 12 ms. Remains 303 /303 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 303/303 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 303 /303 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-13 07:28:09] [INFO ] Invariant cache hit.
[2023-03-13 07:28:09] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-13 07:28:09] [INFO ] Invariant cache hit.
[2023-03-13 07:28:10] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-13 07:28:10] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2023-03-13 07:28:10] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-13 07:28:10] [INFO ] Invariant cache hit.
[2023-03-13 07:28:10] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 840 ms. Remains : 303/303 places, 253/253 transitions.
Graph (complete) has 503 edges and 303 vertex of which 283 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 0 output transitions
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 283 transition count 239
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 269 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 268 transition count 238
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 31 place count 268 transition count 210
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 87 place count 240 transition count 210
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 240 transition count 207
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 93 place count 237 transition count 207
Applied a total of 93 rules in 16 ms. Remains 237 /303 variables (removed 66) and now considering 207/253 (removed 46) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 207 rows 237 cols
[2023-03-13 07:28:10] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-13 07:28:10] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 07:28:10] [INFO ] [Nat]Absence check using 46 positive place invariants in 16 ms returned sat
[2023-03-13 07:28:11] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 07:28:11] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-13 07:28:11] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2023-03-13 07:28:11] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2023-03-13 07:28:11] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 0 ms to minimize.
[2023-03-13 07:28:11] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 0 ms to minimize.
[2023-03-13 07:28:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 618 ms
[2023-03-13 07:28:12] [INFO ] Deduced a trap composed of 6 places in 352 ms of which 4 ms to minimize.
[2023-03-13 07:28:12] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2023-03-13 07:28:12] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2023-03-13 07:28:12] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2023-03-13 07:28:12] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2023-03-13 07:28:12] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2023-03-13 07:28:12] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2023-03-13 07:28:12] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2023-03-13 07:28:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1271 ms
[2023-03-13 07:28:13] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2023-03-13 07:28:13] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2023-03-13 07:28:13] [INFO ] Deduced a trap composed of 63 places in 195 ms of which 1 ms to minimize.
[2023-03-13 07:28:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 458 ms
[2023-03-13 07:28:13] [INFO ] After 2716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-13 07:28:13] [INFO ] After 3044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 07:28:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 36 ms.
[2023-03-13 07:28:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 303 places, 253 transitions and 811 arcs took 2 ms.
[2023-03-13 07:28:14] [INFO ] Flatten gal took : 55 ms
Total runtime 62400 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: AutoFlight_PT_12b
(NrP: 303 NrTr: 253 NrArc: 811)

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

net check time: 0m 0.000sec

init dd package: 0m 2.905sec


RS generation: 3m17.084sec


-> reachability set: #nodes 1467813 (1.5e+06) #states 188,575,960,929,919,154,127 (20)



starting MCC model checker
--------------------------

checking: AG [[[[[[[[p65<=1 & 1<=p65] | [[[p86<=0 & 0<=p86] | [p78<=0 & 0<=p78]] & [[p71<=0 & 0<=p71] | [[p289<=0 & 0<=p289] | [p299<=0 & 0<=p299]]]]] | [p80<=1 & 1<=p80]] & [p254<=0 & 0<=p254]] & [[[p22<=0 & 0<=p22] | [p106<=0 & 0<=p106]] & [[p100<=1 & 1<=p100] | [[p5<=1 & 1<=p5] | [[p63<=1 & 1<=p63] & [[p78<=1 & 1<=p78] & [p191<=1 & 1<=p191]]]]]]] | [[p60<=1 & 1<=p60] & [[p215<=0 & 0<=p215] & [p9<=1 & 1<=p9]]]] | [[p183<=0 & 0<=p183] | [p301<=0 & 0<=p301]]]]
normalized: ~ [E [true U ~ [[[[p301<=0 & 0<=p301] | [p183<=0 & 0<=p183]] | [[[[[[[[p71<=0 & 0<=p71] | [[p299<=0 & 0<=p299] | [p289<=0 & 0<=p289]]] & [[p78<=0 & 0<=p78] | [p86<=0 & 0<=p86]]] | [p65<=1 & 1<=p65]] | [p80<=1 & 1<=p80]] & [p254<=0 & 0<=p254]] & [[[p22<=0 & 0<=p22] | [p106<=0 & 0<=p106]] & [[[[p63<=1 & 1<=p63] & [[p191<=1 & 1<=p191] & [p78<=1 & 1<=p78]]] | [p5<=1 & 1<=p5]] | [p100<=1 & 1<=p100]]]] | [[[p9<=1 & 1<=p9] & [p215<=0 & 0<=p215]] & [p60<=1 & 1<=p60]]]]]]]

abstracting: (1<=p60)
states: 14,041,509,469,829,568,000 (19)
abstracting: (p60<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p215)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p215<=0)
states: 129,353,304,842,403,252,111 (20)
abstracting: (1<=p9)
states: 42,359,602,481,568,000 (16)
abstracting: (p9<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p100)
states: 62,858,653,643,304,735,930 (19)
abstracting: (p100<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p5)
states: 67,934,171,556,000 (13)
abstracting: (p5<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p78)
states: 42,965,182,339,519,555,800 (19)
abstracting: (p78<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p191)
states: 21,158,324,305,920,000 (16)
abstracting: (p191<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p63)
states: 11,776,117,030,004,736,000 (19)
abstracting: (p63<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p106)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p106<=0)
states: 150,860,768,743,936,312,569 (20)
abstracting: (0<=p22)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p22<=0)
states: 187,730,463,842,099,378,127 (20)
abstracting: (0<=p254)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p254<=0)
states: 185,087,945,147,642,579,727 (20)
abstracting: (1<=p80)
states: 54,724,873,722,970,204,800 (19)
abstracting: (p80<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p65)
states: 53,956,235,524,057,740,000 (19)
abstracting: (p65<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p86)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p86<=0)
states: 150,860,768,744,449,583,487 (20)
abstracting: (0<=p78)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p78<=0)
states: 145,610,778,590,399,598,327 (20)
abstracting: (0<=p289)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p289<=0)
states: 114,998,875,814,579,315,445 (20)
abstracting: (0<=p299)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p299<=0)
states: 186,831,852,167,741,773,167 (20)
abstracting: (0<=p71)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p71<=0)
states: 128,184,536,670,960,626,127 (20)
abstracting: (0<=p183)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p183<=0)
states: 188,544,223,443,460,274,127 (20)
abstracting: (0<=p301)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p301<=0)
states: 96,032,089,247,199,286,563 (19)

before gc: list nodes free: 106805

after gc: idd nodes used:5378632, unused:58621368; list nodes free:263227809

before gc: list nodes free: 1147616

after gc: idd nodes used:6229596, unused:57770404; list nodes free:261602037

before gc: list nodes free: 7427852

after gc: idd nodes used:6842276, unused:57157724; list nodes free:258855711
MC time: 18m54.042sec

checking: AG [[[p56<=0 & 0<=p56] | [[p33<=0 & 0<=p33] & [[[[p45<=0 & 0<=p45] | [[p150<=0 & 0<=p150] | [p116<=0 & 0<=p116]]] | [[p140<=1 & 1<=p140] | [[p60<=1 & 1<=p60] | [p275<=0 & 0<=p275]]]] | [[[p18<=1 & 1<=p18] | [[p243<=0 & 0<=p243] | [p138<=1 & 1<=p138]]] | [[[[p24<=1 & 1<=p24] & [p143<=1 & 1<=p143]] | [[p48<=1 & 1<=p48] & [p196<=1 & 1<=p196]]] | [[[[p263<=1 & 1<=p263] | [[p118<=0 & 0<=p118] | [p11<=0 & 0<=p11]]] & [[p41<=1 & 1<=p41] | [p179<=1 & 1<=p179]]] | [[[p298<=1 & 1<=p298] | [[p93<=0 & 0<=p93] | [p45<=0 & 0<=p45]]] & [[p3<=1 & 1<=p3] | [[p290<=0 & 0<=p290] & [[p237<=0 & 0<=p237] & [[p177<=1 & 1<=p177] | [[p181<=1 & 1<=p181] & [p9<=1 & 1<=p9]]]]]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[[[[[p9<=1 & 1<=p9] & [p181<=1 & 1<=p181]] | [p177<=1 & 1<=p177]] & [p237<=0 & 0<=p237]] & [p290<=0 & 0<=p290]] | [p3<=1 & 1<=p3]] & [[[p45<=0 & 0<=p45] | [p93<=0 & 0<=p93]] | [p298<=1 & 1<=p298]]] | [[[p179<=1 & 1<=p179] | [p41<=1 & 1<=p41]] & [[[p11<=0 & 0<=p11] | [p118<=0 & 0<=p118]] | [p263<=1 & 1<=p263]]]] | [[[p196<=1 & 1<=p196] & [p48<=1 & 1<=p48]] | [[p143<=1 & 1<=p143] & [p24<=1 & 1<=p24]]]] | [[[p138<=1 & 1<=p138] | [p243<=0 & 0<=p243]] | [p18<=1 & 1<=p18]]] | [[[[p275<=0 & 0<=p275] | [p60<=1 & 1<=p60]] | [p140<=1 & 1<=p140]] | [[[p116<=0 & 0<=p116] | [p150<=0 & 0<=p150]] | [p45<=0 & 0<=p45]]]] & [p33<=0 & 0<=p33]] | [p56<=0 & 0<=p56]]]]]

abstracting: (0<=p56)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p56<=0)
states: 187,597,027,955,615,512,527 (20)
abstracting: (0<=p33)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p33<=0)
states: 141,456,505,068,652,850,127 (20)
abstracting: (0<=p45)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p45<=0)
states: 133,842,723,206,842,034,127 (20)
abstracting: (0<=p150)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p150<=0)
states: 188,327,285,315,854,514,127 (20)
abstracting: (0<=p116)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p116<=0)
states: 125,717,307,286,614,418,197 (20)
abstracting: (1<=p140)
states: 2,054,668,708,910,796,858 (18)
abstracting: (p140<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p60)
states: 14,041,509,469,829,568,000 (19)
abstracting: (p60<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p275)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p275<=0)
states: 155,848,134,805,744,257,783 (20)
abstracting: (1<=p18)
states: 59,337,143,156,929,536,000 (19)
abstracting: (p18<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p243)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p243<=0)
states: 128,042,792,812,691,006,139 (20)
abstracting: (1<=p138)
states: 1,723,976,106,162,642 (15)
abstracting: (p138<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p24)
states: 46,908,081,589,311,360,000 (19)
abstracting: (p24<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p143)
states: 1,492,053,684,387,840,000 (18)
abstracting: (p143<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p48)
states: 94,287,934,635,953,472,000 (19)
abstracting: (p48<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p196)
states: 49,369,423,380,480,000 (16)
abstracting: (p196<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p263)
states: 61,307,484,157,281,395,988 (19)
abstracting: (p263<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p118)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p118<=0)
states: 109,074,806,984,857,018,032 (20)
abstracting: (0<=p11)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p11<=0)
states: 125,750,019,781,564,082,127 (20)
abstracting: (1<=p41)
states: 93,702,101,152,263,552,000 (19)
abstracting: (p41<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p179)
states: 6,557,524,895,383,856,694 (18)
abstracting: (p179<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p298)
states: 29,184,111,419,347,129,896 (19)
abstracting: (p298<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p93)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p93<=0)
states: 144,047,082,615,834,034,827 (20)
abstracting: (0<=p45)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p45<=0)
states: 133,842,723,206,842,034,127 (20)
abstracting: (1<=p3)
states: 1,016,482,851,000 (12)
abstracting: (p3<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p290)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p290<=0)
states: 171,451,952,582,808,947,445 (20)
abstracting: (0<=p237)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p237<=0)
states: 187,414,088,120,602,802,127 (20)
abstracting: (1<=p177)
states: 6,557,524,895,383,856,694 (18)
abstracting: (p177<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p181)
states: 6,557,524,895,383,856,694 (18)
abstracting: (p181<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p9)
states: 42,359,602,481,568,000 (16)
abstracting: (p9<=1)
states: 188,575,960,929,919,154,127 (20)

before gc: list nodes free: 4906433

after gc: idd nodes used:17532731, unused:46467269; list nodes free:211504034

before gc: list nodes free: 968303

after gc: idd nodes used:18013706, unused:45986294; list nodes free:209361340

before gc: list nodes free: 653963

after gc: idd nodes used:18580325, unused:45419675; list nodes free:206866399
MC time: 12m38.124sec

checking: EF [[[[p88<=1 & 1<=p88] & [p108<=1 & 1<=p108]] & [[p152<=1 & 1<=p152] & [[[[p128<=1 & 1<=p128] | [[p52<=0 & 0<=p52] | [p173<=0 & 0<=p173]]] | [[[p103<=0 & 0<=p103] | [[[p28<=1 & 1<=p28] & [p55<=1 & 1<=p55]] & [[p198<=1 & 1<=p198] & [p150<=0 & 0<=p150]]]] | [[[[p125<=1 & 1<=p125] & [p30<=1 & 1<=p30]] & [[[p39<=0 & 0<=p39] | [[p59<=1 & 1<=p59] | [p277<=1 & 1<=p277]]] & [[[p35<=0 & 0<=p35] | [[p238<=0 & 0<=p238] | [p243<=0 & 0<=p243]]] | [[[p15<=1 & 1<=p15] | [p13<=1 & 1<=p13]] | [[p70<=0 & 0<=p70] | [p159<=0 & 0<=p159]]]]]] | [[p43<=0 & 0<=p43] & [[p113<=0 & 0<=p113] | [[p75<=0 & 0<=p75] | [[p68<=1 & 1<=p68] & [p211<=1 & 1<=p211]]]]]]]] & [[[p7<=0 & 0<=p7] | [[p175<=0 & 0<=p175] | [p130<=0 & 0<=p130]]] | [[[p28<=0 & 0<=p28] | [p231<=0 & 0<=p231]] | [[p135<=0 & 0<=p135] | [[p94<=0 & 0<=p94] & [p172<=0 & 0<=p172]]]]]]]]]
normalized: E [true U [[[[[[[[p172<=0 & 0<=p172] & [p94<=0 & 0<=p94]] | [p135<=0 & 0<=p135]] | [[p231<=0 & 0<=p231] | [p28<=0 & 0<=p28]]] | [[[p130<=0 & 0<=p130] | [p175<=0 & 0<=p175]] | [p7<=0 & 0<=p7]]] & [[[[[[[[p211<=1 & 1<=p211] & [p68<=1 & 1<=p68]] | [p75<=0 & 0<=p75]] | [p113<=0 & 0<=p113]] & [p43<=0 & 0<=p43]] | [[[[[[p159<=0 & 0<=p159] | [p70<=0 & 0<=p70]] | [[p13<=1 & 1<=p13] | [p15<=1 & 1<=p15]]] | [[[p243<=0 & 0<=p243] | [p238<=0 & 0<=p238]] | [p35<=0 & 0<=p35]]] & [[[p277<=1 & 1<=p277] | [p59<=1 & 1<=p59]] | [p39<=0 & 0<=p39]]] & [[p30<=1 & 1<=p30] & [p125<=1 & 1<=p125]]]] | [[[[p150<=0 & 0<=p150] & [p198<=1 & 1<=p198]] & [[p55<=1 & 1<=p55] & [p28<=1 & 1<=p28]]] | [p103<=0 & 0<=p103]]] | [[[p173<=0 & 0<=p173] | [p52<=0 & 0<=p52]] | [p128<=1 & 1<=p128]]]] & [p152<=1 & 1<=p152]] & [[p108<=1 & 1<=p108] & [p88<=1 & 1<=p88]]]]

abstracting: (1<=p88)
states: 37,715,192,185,469,570,640 (19)
abstracting: (p88<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p108)
states: 94,286,527,191,148,190,400 (19)
abstracting: (p108<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p152)
states: 248,675,614,064,640,000 (17)
abstracting: (p152<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p128)
states: 62,858,653,643,306,384,709 (19)
abstracting: (p128<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p52)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p52<=0)
states: 135,687,078,879,586,917,327 (20)
abstracting: (0<=p173)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p173<=0)
states: 182,018,436,034,535,297,433 (20)
abstracting: (0<=p103)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p103<=0)
states: 150,860,768,743,936,312,569 (20)
abstracting: (1<=p28)
states: 62,825,941,148,355,072,000 (19)
abstracting: (p28<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p55)
states: 39,633,746,095,910,131,200 (19)
abstracting: (p55<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p198)
states: 68,411,915,255,808,000 (16)
abstracting: (p198<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p150)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p150<=0)
states: 188,327,285,315,854,514,127 (20)
abstracting: (1<=p125)
states: 62,858,653,643,306,384,709 (19)
abstracting: (p125<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p30)
states: 35,064,013,879,089,561,600 (19)
abstracting: (p30<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p39)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p39<=0)
states: 125,721,780,046,576,370,127 (20)
abstracting: (1<=p59)
states: 39,633,746,095,910,131,200 (19)
abstracting: (p59<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p277)
states: 32,727,826,124,174,896,344 (19)
abstracting: (p277<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p35)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p35<=0)
states: 141,456,505,068,652,850,127 (20)
abstracting: (0<=p238)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p238<=0)
states: 187,414,088,120,602,802,127 (20)
abstracting: (0<=p243)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p243<=0)
states: 128,042,792,812,691,006,139 (20)
abstracting: (1<=p15)
states: 46,815,876,483,222,528,000 (19)
abstracting: (p15<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p13)
states: 47,068,130,727,447,552,000 (19)
abstracting: (p13<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p70)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p70<=0)
states: 94,287,981,076,134,938,127 (19)
abstracting: (0<=p159)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p159<=0)
states: 187,276,996,545,863,858,127 (20)
abstracting: (0<=p43)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p43<=0)
states: 136,038,138,563,820,107,727 (20)
abstracting: (0<=p113)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p113<=0)
states: 125,717,307,286,614,418,197 (20)
abstracting: (0<=p75)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p75<=0)
states: 171,860,729,563,946,094,327 (20)
abstracting: (1<=p68)
states: 94,287,979,853,784,216,000 (19)
abstracting: (p68<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (1<=p211)
states: 1,165,143,273,610,752,000 (18)
abstracting: (p211<=1)
states: 188,575,960,929,919,154,127 (20)
abstracting: (0<=p7)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p7<=0)
states: 188,569,297,618,979,858,127 (20)
abstracting: (0<=p175)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p175<=0)
states: 182,018,436,034,535,297,433 (20)
abstracting: (0<=p130)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p130<=0)
states: 137,133,313,062,931,597,167 (20)
abstracting: (0<=p28)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p28<=0)
states: 125,750,019,781,564,082,127 (20)
abstracting: (0<=p231)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p231<=0)
states: 185,959,950,915,377,258,127 (20)
abstracting: (0<=p135)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p135<=0)
states: 138,337,903,755,447,719,247 (20)
abstracting: (0<=p94)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p94<=0)
states: 140,560,266,725,498,242,827 (20)
abstracting: (0<=p172)
states: 188,575,960,929,919,154,127 (20)
abstracting: (p172<=0)
states: 182,018,436,034,535,297,433 (20)

before gc: list nodes free: 4011309

after gc: idd nodes used:29581245, unused:34418755; list nodes free:157968435

before gc: list nodes free: 3800653

after gc: idd nodes used:30178279, unused:33821721; list nodes free:155352934

before gc: list nodes free: 6250112

after gc: idd nodes used:30790911, unused:33209089; list nodes free:152601107
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5939452 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097612 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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:75398 (298), effective:2159 (8)

initing FirstDep: 0m 0.013sec


sat_reach.icc:155: Timeout: after 1133 sec


sat_reach.icc:155: Timeout: after 755 sec


sat_reach.icc:155: Timeout: after 502 sec

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="AutoFlight-PT-12b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is AutoFlight-PT-12b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813599100479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-12b.tgz
mv AutoFlight-PT-12b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;