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.r009-oct2-167813598000479.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 AutoFlight-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598000479
=====================================================================

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

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:32:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 14:32:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:32:44] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-12 14:32:44] [INFO ] Transformed 1126 places.
[2023-03-12 14:32:44] [INFO ] Transformed 1124 transitions.
[2023-03-12 14:32:44] [INFO ] Found NUPN structural information;
[2023-03-12 14:32:44] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 16) seen :8
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
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :1
FORMULA AutoFlight-PT-12b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1124 rows 1126 cols
[2023-03-12 14:32:45] [INFO ] Computed 76 place invariants in 22 ms
[2023-03-12 14:32:45] [INFO ] After 622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 14:32:46] [INFO ] [Nat]Absence check using 75 positive place invariants in 42 ms returned sat
[2023-03-12 14:32:46] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 14:32:48] [INFO ] After 1662ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-12 14:32:49] [INFO ] Deduced a trap composed of 61 places in 693 ms of which 10 ms to minimize.
[2023-03-12 14:32:49] [INFO ] Deduced a trap composed of 48 places in 305 ms of which 2 ms to minimize.
[2023-03-12 14:32:49] [INFO ] Deduced a trap composed of 165 places in 412 ms of which 1 ms to minimize.
[2023-03-12 14:32:50] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 6 ms to minimize.
[2023-03-12 14:32:50] [INFO ] Deduced a trap composed of 141 places in 558 ms of which 1 ms to minimize.
[2023-03-12 14:32:51] [INFO ] Deduced a trap composed of 47 places in 512 ms of which 2 ms to minimize.
[2023-03-12 14:32:51] [INFO ] Deduced a trap composed of 137 places in 341 ms of which 0 ms to minimize.
[2023-03-12 14:32:52] [INFO ] Deduced a trap composed of 59 places in 522 ms of which 9 ms to minimize.
[2023-03-12 14:32:52] [INFO ] Deduced a trap composed of 60 places in 326 ms of which 0 ms to minimize.
[2023-03-12 14:32:53] [INFO ] Deduced a trap composed of 44 places in 384 ms of which 0 ms to minimize.
[2023-03-12 14:32:54] [INFO ] Deduced a trap composed of 172 places in 881 ms of which 1 ms to minimize.
[2023-03-12 14:32:57] [INFO ] Deduced a trap composed of 46 places in 3610 ms of which 1 ms to minimize.
[2023-03-12 14:32:58] [INFO ] Deduced a trap composed of 132 places in 304 ms of which 0 ms to minimize.
[2023-03-12 14:32:58] [INFO ] Deduced a trap composed of 51 places in 348 ms of which 15 ms to minimize.
[2023-03-12 14:32:59] [INFO ] Deduced a trap composed of 89 places in 376 ms of which 1 ms to minimize.
[2023-03-12 14:32:59] [INFO ] Deduced a trap composed of 43 places in 451 ms of which 1 ms to minimize.
[2023-03-12 14:32:59] [INFO ] Deduced a trap composed of 99 places in 325 ms of which 0 ms to minimize.
[2023-03-12 14:33:00] [INFO ] Deduced a trap composed of 105 places in 344 ms of which 24 ms to minimize.
[2023-03-12 14:33:00] [INFO ] Deduced a trap composed of 146 places in 293 ms of which 1 ms to minimize.
[2023-03-12 14:33:01] [INFO ] Deduced a trap composed of 159 places in 560 ms of which 1 ms to minimize.
[2023-03-12 14:33:01] [INFO ] Deduced a trap composed of 146 places in 276 ms of which 1 ms to minimize.
[2023-03-12 14:33:01] [INFO ] Deduced a trap composed of 57 places in 265 ms of which 1 ms to minimize.
[2023-03-12 14:33:02] [INFO ] Deduced a trap composed of 93 places in 301 ms of which 1 ms to minimize.
[2023-03-12 14:33:02] [INFO ] Deduced a trap composed of 172 places in 388 ms of which 1 ms to minimize.
[2023-03-12 14:33:03] [INFO ] Deduced a trap composed of 100 places in 266 ms of which 0 ms to minimize.
[2023-03-12 14:33:03] [INFO ] Deduced a trap composed of 154 places in 295 ms of which 1 ms to minimize.
[2023-03-12 14:33:03] [INFO ] Deduced a trap composed of 91 places in 286 ms of which 1 ms to minimize.
[2023-03-12 14:33:04] [INFO ] Deduced a trap composed of 120 places in 292 ms of which 1 ms to minimize.
[2023-03-12 14:33:04] [INFO ] Deduced a trap composed of 149 places in 405 ms of which 1 ms to minimize.
[2023-03-12 14:33:04] [INFO ] Deduced a trap composed of 133 places in 291 ms of which 1 ms to minimize.
[2023-03-12 14:33:05] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 0 ms to minimize.
[2023-03-12 14:33:05] [INFO ] Deduced a trap composed of 84 places in 266 ms of which 1 ms to minimize.
[2023-03-12 14:33:05] [INFO ] Deduced a trap composed of 93 places in 299 ms of which 0 ms to minimize.
[2023-03-12 14:33:06] [INFO ] Deduced a trap composed of 111 places in 370 ms of which 1 ms to minimize.
[2023-03-12 14:33:06] [INFO ] Deduced a trap composed of 103 places in 285 ms of which 13 ms to minimize.
[2023-03-12 14:33:06] [INFO ] Deduced a trap composed of 157 places in 229 ms of which 0 ms to minimize.
[2023-03-12 14:33:07] [INFO ] Deduced a trap composed of 89 places in 271 ms of which 1 ms to minimize.
[2023-03-12 14:33:07] [INFO ] Deduced a trap composed of 120 places in 236 ms of which 0 ms to minimize.
[2023-03-12 14:33:07] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 1 ms to minimize.
[2023-03-12 14:33:08] [INFO ] Deduced a trap composed of 105 places in 159 ms of which 1 ms to minimize.
[2023-03-12 14:33:08] [INFO ] Deduced a trap composed of 175 places in 351 ms of which 1 ms to minimize.
[2023-03-12 14:33:08] [INFO ] Deduced a trap composed of 152 places in 289 ms of which 0 ms to minimize.
[2023-03-12 14:33:09] [INFO ] Deduced a trap composed of 179 places in 284 ms of which 1 ms to minimize.
[2023-03-12 14:33:09] [INFO ] Deduced a trap composed of 169 places in 265 ms of which 1 ms to minimize.
[2023-03-12 14:33:09] [INFO ] Deduced a trap composed of 102 places in 284 ms of which 1 ms to minimize.
[2023-03-12 14:33:10] [INFO ] Deduced a trap composed of 102 places in 369 ms of which 1 ms to minimize.
[2023-03-12 14:33:10] [INFO ] Deduced a trap composed of 192 places in 324 ms of which 1 ms to minimize.
[2023-03-12 14:33:11] [INFO ] Deduced a trap composed of 172 places in 489 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-12 14:33:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 14:33:11] [INFO ] After 25235ms 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-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 188 ms.
Support contains 80 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 3 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 5 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 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 6 with 176 rules applied. Total rules applied 1543 place count 380 transition count 327
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 1550 place count 380 transition count 320
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 1552 place count 379 transition count 319
Free-agglomeration rule applied 39 times.
Iterating global reduction 6 with 39 rules applied. Total rules applied 1591 place count 379 transition count 280
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 6 with 39 rules applied. Total rules applied 1630 place count 340 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1631 place count 339 transition count 279
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1633 place count 337 transition count 279
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1633 place count 337 transition count 277
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 1637 place count 335 transition count 277
Applied a total of 1637 rules in 338 ms. Remains 335 /1126 variables (removed 791) and now considering 277/1124 (removed 847) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 339 ms. Remains : 335/1126 places, 277/1124 transitions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 5) seen :2
FORMULA AutoFlight-PT-12b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 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 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 277 rows 335 cols
[2023-03-12 14:33:12] [INFO ] Computed 74 place invariants in 3 ms
[2023-03-12 14:33:12] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:33:12] [INFO ] [Nat]Absence check using 72 positive place invariants in 16 ms returned sat
[2023-03-12 14:33:12] [INFO ] [Nat]Absence check using 72 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-12 14:33:12] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:33:12] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-12 14:33:12] [INFO ] After 197ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:33:12] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 1 ms to minimize.
[2023-03-12 14:33:13] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2023-03-12 14:33:13] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 23 ms to minimize.
[2023-03-12 14:33:13] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2023-03-12 14:33:13] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2023-03-12 14:33:13] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 0 ms to minimize.
[2023-03-12 14:33:13] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 1 ms to minimize.
[2023-03-12 14:33:13] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 1 ms to minimize.
[2023-03-12 14:33:13] [INFO ] Deduced a trap composed of 109 places in 69 ms of which 4 ms to minimize.
[2023-03-12 14:33:14] [INFO ] Deduced a trap composed of 108 places in 84 ms of which 1 ms to minimize.
[2023-03-12 14:33:14] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 0 ms to minimize.
[2023-03-12 14:33:14] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2023-03-12 14:33:14] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2023-03-12 14:33:14] [INFO ] Deduced a trap composed of 110 places in 73 ms of which 0 ms to minimize.
[2023-03-12 14:33:14] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1677 ms
[2023-03-12 14:33:14] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2023-03-12 14:33:14] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2023-03-12 14:33:14] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2023-03-12 14:33:14] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 0 ms to minimize.
[2023-03-12 14:33:14] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2023-03-12 14:33:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 468 ms
[2023-03-12 14:33:15] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 9 ms to minimize.
[2023-03-12 14:33:15] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2023-03-12 14:33:15] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2023-03-12 14:33:15] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2023-03-12 14:33:15] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2023-03-12 14:33:15] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 0 ms to minimize.
[2023-03-12 14:33:15] [INFO ] Deduced a trap composed of 109 places in 91 ms of which 0 ms to minimize.
[2023-03-12 14:33:15] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 0 ms to minimize.
[2023-03-12 14:33:16] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 0 ms to minimize.
[2023-03-12 14:33:16] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2023-03-12 14:33:16] [INFO ] Deduced a trap composed of 108 places in 61 ms of which 1 ms to minimize.
[2023-03-12 14:33:16] [INFO ] Deduced a trap composed of 107 places in 72 ms of which 0 ms to minimize.
[2023-03-12 14:33:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1337 ms
[2023-03-12 14:33:16] [INFO ] After 3896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-12 14:33:16] [INFO ] After 4374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 20 ms.
Support contains 78 out of 335 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 335/335 places, 277/277 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 335 transition count 276
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 334 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 333 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 333 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 332 transition count 274
Applied a total of 6 rules in 31 ms. Remains 332 /335 variables (removed 3) and now considering 274/277 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 332/335 places, 274/277 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 467730 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 467730 steps, saw 69361 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 274 rows 332 cols
[2023-03-12 14:33:19] [INFO ] Computed 74 place invariants in 38 ms
[2023-03-12 14:33:19] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:33:20] [INFO ] [Nat]Absence check using 72 positive place invariants in 23 ms returned sat
[2023-03-12 14:33:20] [INFO ] [Nat]Absence check using 72 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-12 14:33:20] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:33:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-12 14:33:20] [INFO ] After 178ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:33:20] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 0 ms to minimize.
[2023-03-12 14:33:20] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2023-03-12 14:33:20] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 0 ms to minimize.
[2023-03-12 14:33:21] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2023-03-12 14:33:21] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2023-03-12 14:33:21] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 1 ms to minimize.
[2023-03-12 14:33:21] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2023-03-12 14:33:21] [INFO ] Deduced a trap composed of 113 places in 102 ms of which 0 ms to minimize.
[2023-03-12 14:33:21] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 0 ms to minimize.
[2023-03-12 14:33:21] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 1 ms to minimize.
[2023-03-12 14:33:22] [INFO ] Deduced a trap composed of 112 places in 97 ms of which 1 ms to minimize.
[2023-03-12 14:33:22] [INFO ] Deduced a trap composed of 107 places in 69 ms of which 0 ms to minimize.
[2023-03-12 14:33:22] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 1 ms to minimize.
[2023-03-12 14:33:22] [INFO ] Deduced a trap composed of 107 places in 62 ms of which 1 ms to minimize.
[2023-03-12 14:33:22] [INFO ] Deduced a trap composed of 108 places in 64 ms of which 0 ms to minimize.
[2023-03-12 14:33:22] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2023-03-12 14:33:22] [INFO ] Deduced a trap composed of 109 places in 62 ms of which 1 ms to minimize.
[2023-03-12 14:33:22] [INFO ] Deduced a trap composed of 110 places in 65 ms of which 0 ms to minimize.
[2023-03-12 14:33:22] [INFO ] Deduced a trap composed of 119 places in 74 ms of which 1 ms to minimize.
[2023-03-12 14:33:22] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2199 ms
[2023-03-12 14:33:22] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 1 ms to minimize.
[2023-03-12 14:33:23] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 1 ms to minimize.
[2023-03-12 14:33:23] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 0 ms to minimize.
[2023-03-12 14:33:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 390 ms
[2023-03-12 14:33:23] [INFO ] After 2897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-12 14:33:23] [INFO ] After 3501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 49 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 8 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 8 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 24 ms. Remains 332 /332 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2023-03-12 14:33:23] [INFO ] Invariant cache hit.
[2023-03-12 14:33:23] [INFO ] Implicit Places using invariants in 314 ms returned [306]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 319 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 9 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 352 ms. Remains : 331/332 places, 274/274 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 457919 steps, run timeout after 3007 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 457919 steps, saw 67952 distinct states, run finished after 3007 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 274 rows 331 cols
[2023-03-12 14:33:27] [INFO ] Computed 73 place invariants in 24 ms
[2023-03-12 14:33:27] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:33:27] [INFO ] [Nat]Absence check using 73 positive place invariants in 18 ms returned sat
[2023-03-12 14:33:27] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:33:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-12 14:33:27] [INFO ] After 164ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:33:28] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 0 ms to minimize.
[2023-03-12 14:33:28] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-12 14:33:28] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2023-03-12 14:33:28] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2023-03-12 14:33:28] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2023-03-12 14:33:28] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-12 14:33:28] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2023-03-12 14:33:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 795 ms
[2023-03-12 14:33:29] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2023-03-12 14:33:29] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 0 ms to minimize.
[2023-03-12 14:33:29] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 20 ms to minimize.
[2023-03-12 14:33:29] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 1 ms to minimize.
[2023-03-12 14:33:29] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2023-03-12 14:33:29] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 0 ms to minimize.
[2023-03-12 14:33:30] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2023-03-12 14:33:30] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 0 ms to minimize.
[2023-03-12 14:33:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1305 ms
[2023-03-12 14:33:30] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 0 ms to minimize.
[2023-03-12 14:33:30] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-12 14:33:30] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 0 ms to minimize.
[2023-03-12 14:33:30] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 0 ms to minimize.
[2023-03-12 14:33:30] [INFO ] Deduced a trap composed of 111 places in 86 ms of which 0 ms to minimize.
[2023-03-12 14:33:30] [INFO ] Deduced a trap composed of 112 places in 78 ms of which 1 ms to minimize.
[2023-03-12 14:33:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 718 ms
[2023-03-12 14:33:30] [INFO ] After 3195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-12 14:33:31] [INFO ] After 3741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 31 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 10 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 10 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 6 ms. Remains 331 /331 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2023-03-12 14:33:31] [INFO ] Invariant cache hit.
[2023-03-12 14:33:31] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-12 14:33:31] [INFO ] Invariant cache hit.
[2023-03-12 14:33:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-12 14:33:32] [INFO ] Implicit Places using invariants and state equation in 660 ms returned [17, 38, 51, 53, 54, 71, 90]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 860 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 26 ms. Remains 303 /324 variables (removed 21) and now considering 253/274 (removed 21) transitions.
// Phase 1: matrix 253 rows 303 cols
[2023-03-12 14:33:32] [INFO ] Computed 66 place invariants in 1 ms
[2023-03-12 14:33:32] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 14:33:32] [INFO ] Invariant cache hit.
[2023-03-12 14:33:32] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-12 14:33:32] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 632 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 1528 ms. Remains : 303/331 places, 253/274 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 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 7 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 616516 steps, run timeout after 3003 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 616516 steps, saw 89840 distinct states, run finished after 3004 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:33:35] [INFO ] Invariant cache hit.
[2023-03-12 14:33:36] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:33:36] [INFO ] [Nat]Absence check using 66 positive place invariants in 38 ms returned sat
[2023-03-12 14:33:36] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:33:36] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-12 14:33:36] [INFO ] After 128ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:33:36] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2023-03-12 14:33:36] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2023-03-12 14:33:36] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2023-03-12 14:33:37] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2023-03-12 14:33:37] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2023-03-12 14:33:37] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2023-03-12 14:33:37] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2023-03-12 14:33:37] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 0 ms to minimize.
[2023-03-12 14:33:37] [INFO ] Deduced a trap composed of 115 places in 110 ms of which 1 ms to minimize.
[2023-03-12 14:33:37] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-03-12 14:33:37] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 0 ms to minimize.
[2023-03-12 14:33:37] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 0 ms to minimize.
[2023-03-12 14:33:37] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 0 ms to minimize.
[2023-03-12 14:33:37] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 0 ms to minimize.
[2023-03-12 14:33:38] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1495 ms
[2023-03-12 14:33:38] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2023-03-12 14:33:38] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2023-03-12 14:33:38] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2023-03-12 14:33:38] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2023-03-12 14:33:38] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 1 ms to minimize.
[2023-03-12 14:33:38] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 0 ms to minimize.
[2023-03-12 14:33:38] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 0 ms to minimize.
[2023-03-12 14:33:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 822 ms
[2023-03-12 14:33:38] [INFO ] After 2654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 199 ms.
[2023-03-12 14:33:39] [INFO ] After 3182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 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 19 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 19 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 23 ms. Remains 303 /303 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-12 14:33:39] [INFO ] Invariant cache hit.
[2023-03-12 14:33:39] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-12 14:33:39] [INFO ] Invariant cache hit.
[2023-03-12 14:33:39] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-12 14:33:40] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2023-03-12 14:33:40] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-12 14:33:40] [INFO ] Invariant cache hit.
[2023-03-12 14:33:40] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1170 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 1 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 32 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-12 14:33:40] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-12 14:33:40] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:33:40] [INFO ] [Nat]Absence check using 46 positive place invariants in 9 ms returned sat
[2023-03-12 14:33:40] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:33:41] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2023-03-12 14:33:41] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 1 ms to minimize.
[2023-03-12 14:33:41] [INFO ] Deduced a trap composed of 54 places in 486 ms of which 1 ms to minimize.
[2023-03-12 14:33:41] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 0 ms to minimize.
[2023-03-12 14:33:41] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2023-03-12 14:33:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1013 ms
[2023-03-12 14:33:42] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
[2023-03-12 14:33:42] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2023-03-12 14:33:42] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2023-03-12 14:33:42] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2023-03-12 14:33:42] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2023-03-12 14:33:42] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 0 ms to minimize.
[2023-03-12 14:33:42] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2023-03-12 14:33:42] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2023-03-12 14:33:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 936 ms
[2023-03-12 14:33:43] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-03-12 14:33:43] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 1 ms to minimize.
[2023-03-12 14:33:43] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 13 ms to minimize.
[2023-03-12 14:33:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 351 ms
[2023-03-12 14:33:43] [INFO ] After 2700ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 192 ms.
[2023-03-12 14:33:43] [INFO ] After 2995ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:33:43] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-12 14:33:43] [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-12 14:33:43] [INFO ] Flatten gal took : 73 ms
Total runtime 59854 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 --inv-bin-par --invariant=/tmp/1033/inv_0_ --invariant=/tmp/1033/inv_1_ --invariant=/tmp/1033/inv_2_ --inv-par
FORMULA AutoFlight-PT-12b-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-12b-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-12b-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678631676918

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name AutoFlight-PT-12b-ReachabilityFireability-00
rfs formula type AG
rfs formula formula --invariant=/tmp/1033/inv_0_
rfs formula name AutoFlight-PT-12b-ReachabilityFireability-07
rfs formula type AG
rfs formula formula --invariant=/tmp/1033/inv_1_
rfs formula name AutoFlight-PT-12b-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/1033/inv_2_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 303 places, 253 transitions and 811 arcs
pnml2lts-sym: Petri net AutoFlight_PT_12b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 253->235 groups
pnml2lts-sym: Regrouping took 0.050 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 303; there are 235 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/1033/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/1033/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/1033/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 52.270 real 208.610 user 0.270 sys
pnml2lts-sym: max token count: 1

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="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 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 r009-oct2-167813598000479"
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 ;