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.r011-oct2-167813600300479.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 smartxred
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 r011-oct2-167813600300479
=====================================================================

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

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 19:35:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:35:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:35:19] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-13 19:35:19] [INFO ] Transformed 1126 places.
[2023-03-13 19:35:19] [INFO ] Transformed 1124 transitions.
[2023-03-13 19:35:19] [INFO ] Found NUPN structural information;
[2023-03-13 19:35:19] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 352 ms. (steps per millisecond=28 ) 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 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :1
FORMULA AutoFlight-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1124 rows 1126 cols
[2023-03-13 19:35:20] [INFO ] Computed 76 place invariants in 48 ms
[2023-03-13 19:35:21] [INFO ] After 693ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 19:35:21] [INFO ] [Nat]Absence check using 75 positive place invariants in 34 ms returned sat
[2023-03-13 19:35:21] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 19:35:23] [INFO ] After 1306ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-13 19:35:24] [INFO ] Deduced a trap composed of 52 places in 1025 ms of which 13 ms to minimize.
[2023-03-13 19:35:25] [INFO ] Deduced a trap composed of 43 places in 436 ms of which 2 ms to minimize.
[2023-03-13 19:35:25] [INFO ] Deduced a trap composed of 44 places in 354 ms of which 1 ms to minimize.
[2023-03-13 19:35:25] [INFO ] Deduced a trap composed of 148 places in 332 ms of which 1 ms to minimize.
[2023-03-13 19:35:26] [INFO ] Deduced a trap composed of 136 places in 336 ms of which 1 ms to minimize.
[2023-03-13 19:35:26] [INFO ] Deduced a trap composed of 142 places in 284 ms of which 1 ms to minimize.
[2023-03-13 19:35:26] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 1 ms to minimize.
[2023-03-13 19:35:27] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 1 ms to minimize.
[2023-03-13 19:35:27] [INFO ] Deduced a trap composed of 133 places in 335 ms of which 1 ms to minimize.
[2023-03-13 19:35:28] [INFO ] Deduced a trap composed of 49 places in 475 ms of which 1 ms to minimize.
[2023-03-13 19:35:28] [INFO ] Deduced a trap composed of 51 places in 275 ms of which 1 ms to minimize.
[2023-03-13 19:35:28] [INFO ] Deduced a trap composed of 120 places in 339 ms of which 3 ms to minimize.
[2023-03-13 19:35:29] [INFO ] Deduced a trap composed of 61 places in 329 ms of which 1 ms to minimize.
[2023-03-13 19:35:29] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 1 ms to minimize.
[2023-03-13 19:35:30] [INFO ] Deduced a trap composed of 168 places in 275 ms of which 1 ms to minimize.
[2023-03-13 19:35:30] [INFO ] Deduced a trap composed of 57 places in 352 ms of which 1 ms to minimize.
[2023-03-13 19:35:30] [INFO ] Deduced a trap composed of 89 places in 308 ms of which 1 ms to minimize.
[2023-03-13 19:35:31] [INFO ] Deduced a trap composed of 93 places in 267 ms of which 1 ms to minimize.
[2023-03-13 19:35:31] [INFO ] Deduced a trap composed of 141 places in 340 ms of which 1 ms to minimize.
[2023-03-13 19:35:31] [INFO ] Deduced a trap composed of 104 places in 221 ms of which 0 ms to minimize.
[2023-03-13 19:35:32] [INFO ] Deduced a trap composed of 153 places in 234 ms of which 1 ms to minimize.
[2023-03-13 19:35:32] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 1 ms to minimize.
[2023-03-13 19:35:32] [INFO ] Deduced a trap composed of 86 places in 231 ms of which 0 ms to minimize.
[2023-03-13 19:35:32] [INFO ] Deduced a trap composed of 103 places in 314 ms of which 1 ms to minimize.
[2023-03-13 19:35:33] [INFO ] Deduced a trap composed of 87 places in 244 ms of which 1 ms to minimize.
[2023-03-13 19:35:33] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 1 ms to minimize.
[2023-03-13 19:35:33] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 13 ms to minimize.
[2023-03-13 19:35:34] [INFO ] Deduced a trap composed of 67 places in 227 ms of which 0 ms to minimize.
[2023-03-13 19:35:34] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 1 ms to minimize.
[2023-03-13 19:35:34] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 1 ms to minimize.
[2023-03-13 19:35:34] [INFO ] Deduced a trap composed of 111 places in 228 ms of which 1 ms to minimize.
[2023-03-13 19:35:35] [INFO ] Deduced a trap composed of 105 places in 249 ms of which 0 ms to minimize.
[2023-03-13 19:35:35] [INFO ] Deduced a trap composed of 174 places in 234 ms of which 0 ms to minimize.
[2023-03-13 19:35:35] [INFO ] Deduced a trap composed of 162 places in 274 ms of which 28 ms to minimize.
[2023-03-13 19:35:36] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 1 ms to minimize.
[2023-03-13 19:35:36] [INFO ] Deduced a trap composed of 162 places in 561 ms of which 2 ms to minimize.
[2023-03-13 19:35:37] [INFO ] Deduced a trap composed of 152 places in 288 ms of which 0 ms to minimize.
[2023-03-13 19:35:37] [INFO ] Deduced a trap composed of 148 places in 306 ms of which 0 ms to minimize.
[2023-03-13 19:35:37] [INFO ] Deduced a trap composed of 183 places in 313 ms of which 1 ms to minimize.
[2023-03-13 19:35:38] [INFO ] Deduced a trap composed of 150 places in 230 ms of which 1 ms to minimize.
[2023-03-13 19:35:38] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 14694 ms
[2023-03-13 19:35:38] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 0 ms to minimize.
[2023-03-13 19:35:39] [INFO ] Deduced a trap composed of 51 places in 289 ms of which 1 ms to minimize.
[2023-03-13 19:35:39] [INFO ] Deduced a trap composed of 173 places in 240 ms of which 1 ms to minimize.
[2023-03-13 19:35:39] [INFO ] Deduced a trap composed of 202 places in 253 ms of which 1 ms to minimize.
[2023-03-13 19:35:40] [INFO ] Deduced a trap composed of 218 places in 277 ms of which 1 ms to minimize.
[2023-03-13 19:35:40] [INFO ] Deduced a trap composed of 222 places in 384 ms of which 1 ms to minimize.
[2023-03-13 19:35:40] [INFO ] Deduced a trap composed of 183 places in 233 ms of which 1 ms to minimize.
[2023-03-13 19:35:41] [INFO ] Deduced a trap composed of 177 places in 232 ms of which 4 ms to minimize.
[2023-03-13 19:35:41] [INFO ] Deduced a trap composed of 56 places in 303 ms of which 1 ms to minimize.
[2023-03-13 19:35:41] [INFO ] Deduced a trap composed of 206 places in 241 ms of which 1 ms to minimize.
[2023-03-13 19:35:42] [INFO ] Deduced a trap composed of 200 places in 216 ms of which 1 ms to minimize.
[2023-03-13 19:35:42] [INFO ] Deduced a trap composed of 181 places in 207 ms of which 1 ms to minimize.
[2023-03-13 19:35:42] [INFO ] Deduced a trap composed of 88 places in 258 ms of which 1 ms to minimize.
[2023-03-13 19:35:43] [INFO ] Deduced a trap composed of 83 places in 204 ms of which 0 ms to minimize.
[2023-03-13 19:35:43] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 1 ms to minimize.
[2023-03-13 19:35:43] [INFO ] Deduced a trap composed of 221 places in 210 ms of which 1 ms to minimize.
[2023-03-13 19:35:43] [INFO ] Deduced a trap composed of 204 places in 236 ms of which 23 ms to minimize.
[2023-03-13 19:35:44] [INFO ] Deduced a trap composed of 197 places in 212 ms of which 14 ms to minimize.
[2023-03-13 19:35:44] [INFO ] Deduced a trap composed of 99 places in 321 ms of which 2 ms to minimize.
[2023-03-13 19:35:44] [INFO ] Deduced a trap composed of 35 places in 286 ms of which 0 ms to minimize.
[2023-03-13 19:35:45] [INFO ] Deduced a trap composed of 102 places in 252 ms of which 2 ms to minimize.
[2023-03-13 19:35:45] [INFO ] Deduced a trap composed of 100 places in 278 ms of which 0 ms to minimize.
[2023-03-13 19:35:45] [INFO ] Deduced a trap composed of 107 places in 233 ms of which 1 ms to minimize.
[2023-03-13 19:35:46] [INFO ] Deduced a trap composed of 79 places in 289 ms of which 14 ms to minimize.
[2023-03-13 19:35:46] [INFO ] Deduced a trap composed of 71 places in 339 ms of which 2 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 19:35:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 19:35:46] [INFO ] After 25098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA AutoFlight-PT-12b-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 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 166 ms.
Support contains 78 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 98 places :
Symmetric choice reduction at 5 with 98 rule applications. Total rules 1218 place count 493 transition count 441
Iterating global reduction 5 with 98 rules applied. Total rules applied 1316 place count 493 transition count 441
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1317 place count 493 transition count 440
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 26 Pre rules applied. Total rules applied 1317 place count 493 transition count 414
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 1369 place count 467 transition count 414
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 6 with 178 rules applied. Total rules applied 1547 place count 378 transition count 325
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 1554 place count 378 transition count 318
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1558 place count 376 transition count 316
Free-agglomeration rule applied 39 times.
Iterating global reduction 6 with 39 rules applied. Total rules applied 1597 place count 376 transition count 277
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 6 with 39 rules applied. Total rules applied 1636 place count 337 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1637 place count 336 transition count 276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1639 place count 334 transition count 276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1639 place count 334 transition count 274
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1643 place count 332 transition count 274
Applied a total of 1643 rules in 204 ms. Remains 332 /1126 variables (removed 794) and now considering 274/1124 (removed 850) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 332/1126 places, 274/1124 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 651864 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 651864 steps, saw 94155 distinct states, run finished after 3002 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 274 rows 332 cols
[2023-03-13 19:35:50] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-13 19:35:50] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 19:35:50] [INFO ] [Nat]Absence check using 72 positive place invariants in 17 ms returned sat
[2023-03-13 19:35:50] [INFO ] [Nat]Absence check using 72 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-13 19:35:50] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 19:35:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-13 19:35:50] [INFO ] After 180ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 19:35:51] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 0 ms to minimize.
[2023-03-13 19:35:51] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2023-03-13 19:35:51] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 10 ms to minimize.
[2023-03-13 19:35:51] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 21 ms to minimize.
[2023-03-13 19:35:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 513 ms
[2023-03-13 19:35:51] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 0 ms to minimize.
[2023-03-13 19:35:51] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2023-03-13 19:35:51] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2023-03-13 19:35:51] [INFO ] Deduced a trap composed of 124 places in 76 ms of which 1 ms to minimize.
[2023-03-13 19:35:52] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2023-03-13 19:35:52] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-13 19:35:52] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 1 ms to minimize.
[2023-03-13 19:35:52] [INFO ] Deduced a trap composed of 110 places in 70 ms of which 0 ms to minimize.
[2023-03-13 19:35:52] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 0 ms to minimize.
[2023-03-13 19:35:52] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 0 ms to minimize.
[2023-03-13 19:35:52] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-13 19:35:52] [INFO ] Deduced a trap composed of 109 places in 66 ms of which 1 ms to minimize.
[2023-03-13 19:35:52] [INFO ] Deduced a trap composed of 99 places in 67 ms of which 0 ms to minimize.
[2023-03-13 19:35:53] [INFO ] Deduced a trap composed of 111 places in 79 ms of which 1 ms to minimize.
[2023-03-13 19:35:53] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1605 ms
[2023-03-13 19:35:53] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 1 ms to minimize.
[2023-03-13 19:35:53] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2023-03-13 19:35:53] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2023-03-13 19:35:53] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2023-03-13 19:35:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 442 ms
[2023-03-13 19:35:53] [INFO ] After 2928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 268 ms.
[2023-03-13 19:35:53] [INFO ] After 3593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 59 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 11 ms. Remains 332 /332 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2023-03-13 19:35:53] [INFO ] Invariant cache hit.
[2023-03-13 19:35:54] [INFO ] Implicit Places using invariants in 213 ms returned [306]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 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 11 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 237 ms. Remains : 331/332 places, 274/274 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) 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
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 654841 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 654841 steps, saw 94465 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 274 rows 331 cols
[2023-03-13 19:35:57] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-13 19:35:57] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 19:35:57] [INFO ] [Nat]Absence check using 73 positive place invariants in 30 ms returned sat
[2023-03-13 19:35:57] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 19:35:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-13 19:35:58] [INFO ] After 273ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 19:35:58] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 1 ms to minimize.
[2023-03-13 19:35:58] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:35:58] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 0 ms to minimize.
[2023-03-13 19:35:58] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 0 ms to minimize.
[2023-03-13 19:35:59] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
[2023-03-13 19:35:59] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 0 ms to minimize.
[2023-03-13 19:35:59] [INFO ] Deduced a trap composed of 115 places in 94 ms of which 1 ms to minimize.
[2023-03-13 19:35:59] [INFO ] Deduced a trap composed of 120 places in 54 ms of which 0 ms to minimize.
[2023-03-13 19:35:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1146 ms
[2023-03-13 19:35:59] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-13 19:35:59] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2023-03-13 19:35:59] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 0 ms to minimize.
[2023-03-13 19:35:59] [INFO ] Deduced a trap composed of 109 places in 83 ms of which 0 ms to minimize.
[2023-03-13 19:36:00] [INFO ] Deduced a trap composed of 107 places in 91 ms of which 0 ms to minimize.
[2023-03-13 19:36:00] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-13 19:36:00] [INFO ] Deduced a trap composed of 108 places in 265 ms of which 0 ms to minimize.
[2023-03-13 19:36:00] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 1 ms to minimize.
[2023-03-13 19:36:00] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 1 ms to minimize.
[2023-03-13 19:36:00] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 0 ms to minimize.
[2023-03-13 19:36:01] [INFO ] Deduced a trap composed of 111 places in 90 ms of which 0 ms to minimize.
[2023-03-13 19:36:01] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 0 ms to minimize.
[2023-03-13 19:36:01] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 0 ms to minimize.
[2023-03-13 19:36:01] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 1 ms to minimize.
[2023-03-13 19:36:01] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 0 ms to minimize.
[2023-03-13 19:36:01] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2023-03-13 19:36:01] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2023-03-13 19:36:01] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2385 ms
[2023-03-13 19:36:02] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
[2023-03-13 19:36:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-13 19:36:02] [INFO ] After 4165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 220 ms.
[2023-03-13 19:36:02] [INFO ] After 4760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 50 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 15 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 15 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 11 ms. Remains 331 /331 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2023-03-13 19:36:02] [INFO ] Invariant cache hit.
[2023-03-13 19:36:02] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-13 19:36:02] [INFO ] Invariant cache hit.
[2023-03-13 19:36:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-13 19:36:03] [INFO ] Implicit Places using invariants and state equation in 774 ms returned [17, 38, 51, 53, 54, 71, 90]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 1127 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 30 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 19:36:03] [INFO ] Computed 66 place invariants in 3 ms
[2023-03-13 19:36:03] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-13 19:36:03] [INFO ] Invariant cache hit.
[2023-03-13 19:36:03] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-13 19:36:04] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 653 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 1821 ms. Remains : 303/331 places, 253/274 transitions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 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 10 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 727570 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 727570 steps, saw 102409 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 19:36:07] [INFO ] Invariant cache hit.
[2023-03-13 19:36:07] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 19:36:07] [INFO ] [Nat]Absence check using 66 positive place invariants in 88 ms returned sat
[2023-03-13 19:36:08] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 19:36:08] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-13 19:36:08] [INFO ] After 118ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 19:36:08] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-13 19:36:08] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2023-03-13 19:36:08] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 0 ms to minimize.
[2023-03-13 19:36:08] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 0 ms to minimize.
[2023-03-13 19:36:08] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2023-03-13 19:36:08] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2023-03-13 19:36:09] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2023-03-13 19:36:09] [INFO ] Deduced a trap composed of 96 places in 206 ms of which 1 ms to minimize.
[2023-03-13 19:36:09] [INFO ] Deduced a trap composed of 92 places in 73 ms of which 0 ms to minimize.
[2023-03-13 19:36:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1120 ms
[2023-03-13 19:36:09] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 0 ms to minimize.
[2023-03-13 19:36:09] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2023-03-13 19:36:09] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 1 ms to minimize.
[2023-03-13 19:36:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 400 ms
[2023-03-13 19:36:09] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2023-03-13 19:36:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-13 19:36:09] [INFO ] After 1846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-13 19:36:10] [INFO ] After 2480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 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 7 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 7 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 6 ms. Remains 303 /303 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-13 19:36:10] [INFO ] Invariant cache hit.
[2023-03-13 19:36:10] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-13 19:36:10] [INFO ] Invariant cache hit.
[2023-03-13 19:36:10] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-13 19:36:10] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-13 19:36:10] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-13 19:36:10] [INFO ] Invariant cache hit.
[2023-03-13 19:36:10] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 740 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 18 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 19:36:10] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-13 19:36:10] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 19:36:11] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2023-03-13 19:36:11] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 19:36:11] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2023-03-13 19:36:11] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 1 ms to minimize.
[2023-03-13 19:36:11] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 0 ms to minimize.
[2023-03-13 19:36:11] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 0 ms to minimize.
[2023-03-13 19:36:11] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2023-03-13 19:36:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 695 ms
[2023-03-13 19:36:12] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 0 ms to minimize.
[2023-03-13 19:36:12] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2023-03-13 19:36:12] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2023-03-13 19:36:12] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-03-13 19:36:12] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2023-03-13 19:36:12] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2023-03-13 19:36:12] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 0 ms to minimize.
[2023-03-13 19:36:12] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2023-03-13 19:36:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 973 ms
[2023-03-13 19:36:13] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 13 ms to minimize.
[2023-03-13 19:36:13] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2023-03-13 19:36:13] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 0 ms to minimize.
[2023-03-13 19:36:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 398 ms
[2023-03-13 19:36:13] [INFO ] After 2381ms 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-13 19:36:13] [INFO ] After 2651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-13 19:36:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2023-03-13 19:36:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 303 places, 253 transitions and 811 arcs took 4 ms.
[2023-03-13 19:36:13] [INFO ] Flatten gal took : 55 ms
Total runtime 54630 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutoFlight (PT), instance 12b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 303 places, 253 transitions, 811 arcs.
Final Score: 5860.974
Took : 8 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678736183368

--------------------
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
ERROR in file model.sm near line 1381:
syntax error

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="smartxred"
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 smartxred"
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 r011-oct2-167813600300479"
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 ;