About the Execution of ITS-Tools for ShieldPPPs-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16224.312 | 3600000.00 | 9769696.00 | 34036.90 | ?FFT?FF??T?F?T?? | normal |
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.r389-oct2-167903713700527.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 itstools
Input is ShieldPPPs-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713700527
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679212357748
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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-19 07:52:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 07:52:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 07:52:40] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2023-03-19 07:52:40] [INFO ] Transformed 6803 places.
[2023-03-19 07:52:41] [INFO ] Transformed 6303 transitions.
[2023-03-19 07:52:41] [INFO ] Found NUPN structural information;
[2023-03-19 07:52:41] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 660 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 07:52:42] [INFO ] Flatten gal took : 561 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 946 ms. (steps per millisecond=10 ) properties (out of 16) seen :4
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
[2023-03-19 07:52:42] [INFO ] Flatten gal took : 366 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) 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 12) seen :0
[2023-03-19 07:52:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10758825057564885509.gal : 88 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
[2023-03-19 07:52:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9500743861455362772.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10758825057564885509.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9500743861455362772.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 6303 rows 6803 cols
[2023-03-19 07:52:42] [INFO ] Computed 1101 place invariants in 78 ms
Loading property file /tmp/ReachabilityCardinality9500743861455362772.prop.
[2023-03-19 07:52:46] [INFO ] [Real]Absence check using 1101 positive place invariants in 1232 ms returned sat
[2023-03-19 07:52:46] [INFO ] After 3834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 07:52:50] [INFO ] [Nat]Absence check using 1101 positive place invariants in 939 ms returned sat
[2023-03-19 07:53:11] [INFO ] After 19566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 07:53:11] [INFO ] After 19584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-19 07:53:11] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 12 Parikh solutions to 2 different solutions.
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 332 ms.
Support contains 275 out of 6803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Drop transitions removed 633 transitions
Trivial Post-agglo rules discarded 633 transitions
Performed 633 trivial Post agglomeration. Transition count delta: 633
Iterating post reduction 0 with 633 rules applied. Total rules applied 633 place count 6803 transition count 5670
Reduce places removed 633 places and 0 transitions.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 655 rules applied. Total rules applied 1288 place count 6170 transition count 5648
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1310 place count 6148 transition count 5648
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :36 after 69
Performed 492 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 492 Pre rules applied. Total rules applied 1310 place count 6148 transition count 5156
Deduced a syphon composed of 492 places in 42 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 3 with 984 rules applied. Total rules applied 2294 place count 5656 transition count 5156
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :69 after 204
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :204 after 634
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :634 after 1.60471e+06
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1.60471e+06 after 5.81902e+13
Reachability property ShieldPPPs-PT-100B-ReachabilityFireability-13 is true.
Discarding 648 places :
Symmetric choice reduction at 3 with 648 rule applications. Total rules 2942 place count 5008 transition count 4508
Iterating global reduction 3 with 648 rules applied. Total rules applied 3590 place count 5008 transition count 4508
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :5.81902e+13 after 6.84907e+32
Performed 242 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 242 Pre rules applied. Total rules applied 3590 place count 5008 transition count 4266
Deduced a syphon composed of 242 places in 22 ms
Reduce places removed 242 places and 0 transitions.
Iterating global reduction 3 with 484 rules applied. Total rules applied 4074 place count 4766 transition count 4266
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :6.84907e+32 after 7.83225e+50
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :7.83225e+50 after 1.2328e+88
Performed 1382 Post agglomeration using F-continuation condition.Transition count delta: 1382
Deduced a syphon composed of 1382 places in 22 ms
Reduce places removed 1382 places and 0 transitions.
Iterating global reduction 3 with 2764 rules applied. Total rules applied 6838 place count 3384 transition count 2884
Renaming transitions due to excessive name length > 1024 char.
Reachability property ShieldPPPs-PT-100B-ReachabilityFireability-03 is true.
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :1.2328e+88 after 4.58264e+167
Partial Free-agglomeration rule applied 820 times.
Drop transitions removed 820 transitions
Iterating global reduction 3 with 820 rules applied. Total rules applied 7658 place count 3384 transition count 2884
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7659 place count 3383 transition count 2883
Applied a total of 7659 rules in 3032 ms. Remains 3383 /6803 variables (removed 3420) and now considering 2883/6303 (removed 3420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3033 ms. Remains : 3383/6803 places, 2883/6303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 10) seen :1
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2883 rows 3383 cols
[2023-03-19 07:53:16] [INFO ] Computed 1101 place invariants in 109 ms
[2023-03-19 07:53:18] [INFO ] [Real]Absence check using 1053 positive place invariants in 237 ms returned sat
[2023-03-19 07:53:18] [INFO ] [Real]Absence check using 1053 positive and 48 generalized place invariants in 9 ms returned sat
[2023-03-19 07:53:18] [INFO ] After 1223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 07:53:19] [INFO ] [Nat]Absence check using 1053 positive place invariants in 428 ms returned sat
[2023-03-19 07:53:19] [INFO ] [Nat]Absence check using 1053 positive and 48 generalized place invariants in 23 ms returned sat
[2023-03-19 07:53:28] [INFO ] After 8632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 07:53:30] [INFO ] Deduced a trap composed of 5 places in 1232 ms of which 36 ms to minimize.
[2023-03-19 07:53:31] [INFO ] Deduced a trap composed of 9 places in 1174 ms of which 25 ms to minimize.
[2023-03-19 07:53:32] [INFO ] Deduced a trap composed of 7 places in 928 ms of which 1 ms to minimize.
[2023-03-19 07:53:33] [INFO ] Deduced a trap composed of 5 places in 903 ms of which 14 ms to minimize.
[2023-03-19 07:53:35] [INFO ] Deduced a trap composed of 4 places in 1261 ms of which 2 ms to minimize.
[2023-03-19 07:53:36] [INFO ] Deduced a trap composed of 4 places in 1351 ms of which 1 ms to minimize.
[2023-03-19 07:53:37] [INFO ] Deduced a trap composed of 9 places in 885 ms of which 15 ms to minimize.
[2023-03-19 07:53:38] [INFO ] Deduced a trap composed of 4 places in 1097 ms of which 2 ms to minimize.
[2023-03-19 07:53:40] [INFO ] Deduced a trap composed of 6 places in 1091 ms of which 2 ms to minimize.
[2023-03-19 07:53:42] [INFO ] Deduced a trap composed of 16 places in 1808 ms of which 2 ms to minimize.
[2023-03-19 07:53:43] [INFO ] Deduced a trap composed of 6 places in 1162 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-19 07:53:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:53:43] [INFO ] After 25265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1788 ms.
Support contains 274 out of 3383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3383/3383 places, 2883/2883 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 3383 transition count 2882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 3382 transition count 2882
Applied a total of 2 rules in 195 ms. Remains 3382 /3383 variables (removed 1) and now considering 2882/2883 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 3382/3383 places, 2882/2883 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) 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 9) seen :1
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2882 rows 3382 cols
[2023-03-19 07:53:46] [INFO ] Computed 1101 place invariants in 101 ms
[2023-03-19 07:53:48] [INFO ] [Real]Absence check using 1046 positive place invariants in 413 ms returned sat
[2023-03-19 07:53:48] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 17 ms returned sat
[2023-03-19 07:53:48] [INFO ] After 1450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 07:53:49] [INFO ] [Nat]Absence check using 1046 positive place invariants in 414 ms returned sat
[2023-03-19 07:53:49] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 34 ms returned sat
[2023-03-19 07:53:59] [INFO ] After 8755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 07:54:00] [INFO ] Deduced a trap composed of 4 places in 1437 ms of which 3 ms to minimize.
[2023-03-19 07:54:01] [INFO ] Deduced a trap composed of 9 places in 1126 ms of which 2 ms to minimize.
[2023-03-19 07:54:03] [INFO ] Deduced a trap composed of 9 places in 1186 ms of which 3 ms to minimize.
[2023-03-19 07:54:04] [INFO ] Deduced a trap composed of 9 places in 1282 ms of which 2 ms to minimize.
[2023-03-19 07:54:07] [INFO ] Deduced a trap composed of 7 places in 2676 ms of which 2 ms to minimize.
[2023-03-19 07:54:08] [INFO ] Deduced a trap composed of 6 places in 1080 ms of which 2 ms to minimize.
[2023-03-19 07:54:10] [INFO ] Deduced a trap composed of 8 places in 1309 ms of which 2 ms to minimize.
[2023-03-19 07:54:11] [INFO ] Deduced a trap composed of 5 places in 1242 ms of which 2 ms to minimize.
[2023-03-19 07:54:13] [INFO ] Deduced a trap composed of 11 places in 1414 ms of which 2 ms to minimize.
[2023-03-19 07:54:14] [INFO ] Deduced a trap composed of 13 places in 1123 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-19 07:54:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:54:14] [INFO ] After 26107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1457 ms.
Support contains 223 out of 3382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3382/3382 places, 2882/2882 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 3382 transition count 2876
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 3376 transition count 2875
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 3375 transition count 2875
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 14 place count 3375 transition count 2868
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 28 place count 3368 transition count 2868
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 10 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 100 place count 3332 transition count 2832
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 3332 transition count 2832
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 3331 transition count 2831
Applied a total of 109 rules in 688 ms. Remains 3331 /3382 variables (removed 51) and now considering 2831/2882 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 689 ms. Remains : 3331/3382 places, 2831/2882 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 46993 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 46993 steps, saw 45201 distinct states, run finished after 3003 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2831 rows 3331 cols
[2023-03-19 07:54:20] [INFO ] Computed 1101 place invariants in 20 ms
[2023-03-19 07:54:22] [INFO ] [Real]Absence check using 1046 positive place invariants in 385 ms returned sat
[2023-03-19 07:54:22] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 21 ms returned sat
[2023-03-19 07:54:22] [INFO ] After 1425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 07:54:23] [INFO ] [Nat]Absence check using 1046 positive place invariants in 374 ms returned sat
[2023-03-19 07:54:23] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 16 ms returned sat
[2023-03-19 07:54:38] [INFO ] After 13996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 07:54:39] [INFO ] Deduced a trap composed of 4 places in 712 ms of which 10 ms to minimize.
[2023-03-19 07:54:40] [INFO ] Deduced a trap composed of 4 places in 668 ms of which 1 ms to minimize.
[2023-03-19 07:54:41] [INFO ] Deduced a trap composed of 8 places in 629 ms of which 1 ms to minimize.
[2023-03-19 07:54:41] [INFO ] Deduced a trap composed of 4 places in 736 ms of which 1 ms to minimize.
[2023-03-19 07:54:42] [INFO ] Deduced a trap composed of 4 places in 903 ms of which 1 ms to minimize.
[2023-03-19 07:54:44] [INFO ] Deduced a trap composed of 8 places in 1059 ms of which 1 ms to minimize.
[2023-03-19 07:54:45] [INFO ] Deduced a trap composed of 7 places in 1193 ms of which 2 ms to minimize.
[2023-03-19 07:54:46] [INFO ] Deduced a trap composed of 6 places in 940 ms of which 2 ms to minimize.
[2023-03-19 07:54:47] [INFO ] Deduced a trap composed of 5 places in 987 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-19 07:54:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:54:47] [INFO ] After 25412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1683 ms.
Support contains 223 out of 3331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3331/3331 places, 2831/2831 transitions.
Applied a total of 0 rules in 185 ms. Remains 3331 /3331 variables (removed 0) and now considering 2831/2831 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 3331/3331 places, 2831/2831 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3331/3331 places, 2831/2831 transitions.
Applied a total of 0 rules in 183 ms. Remains 3331 /3331 variables (removed 0) and now considering 2831/2831 (removed 0) transitions.
[2023-03-19 07:54:49] [INFO ] Invariant cache hit.
[2023-03-19 07:54:54] [INFO ] Implicit Places using invariants in 4172 ms returned []
[2023-03-19 07:54:54] [INFO ] Invariant cache hit.
[2023-03-19 07:55:02] [INFO ] Implicit Places using invariants and state equation in 8354 ms returned []
Implicit Place search using SMT with State Equation took 12543 ms to find 0 implicit places.
[2023-03-19 07:55:02] [INFO ] Redundant transitions in 186 ms returned []
[2023-03-19 07:55:02] [INFO ] Invariant cache hit.
[2023-03-19 07:55:05] [INFO ] Dead Transitions using invariants and state equation in 3140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16063 ms. Remains : 3331/3331 places, 2831/2831 transitions.
Applied a total of 0 rules in 225 ms. Remains 3331 /3331 variables (removed 0) and now considering 2831/2831 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-03-19 07:55:05] [INFO ] Invariant cache hit.
[2023-03-19 07:55:07] [INFO ] [Real]Absence check using 1046 positive place invariants in 340 ms returned sat
[2023-03-19 07:55:07] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 22 ms returned sat
[2023-03-19 07:55:07] [INFO ] After 1350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 07:55:08] [INFO ] [Nat]Absence check using 1046 positive place invariants in 301 ms returned sat
[2023-03-19 07:55:08] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 64 ms returned sat
[2023-03-19 07:55:19] [INFO ] After 10010ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 07:55:20] [INFO ] Deduced a trap composed of 4 places in 896 ms of which 2 ms to minimize.
[2023-03-19 07:55:21] [INFO ] Deduced a trap composed of 9 places in 963 ms of which 1 ms to minimize.
[2023-03-19 07:55:22] [INFO ] Deduced a trap composed of 8 places in 655 ms of which 1 ms to minimize.
[2023-03-19 07:55:23] [INFO ] Deduced a trap composed of 11 places in 1232 ms of which 13 ms to minimize.
[2023-03-19 07:55:24] [INFO ] Deduced a trap composed of 8 places in 853 ms of which 15 ms to minimize.
[2023-03-19 07:55:25] [INFO ] Deduced a trap composed of 4 places in 975 ms of which 3 ms to minimize.
[2023-03-19 07:55:26] [INFO ] Deduced a trap composed of 6 places in 799 ms of which 1 ms to minimize.
[2023-03-19 07:55:28] [INFO ] Deduced a trap composed of 7 places in 1264 ms of which 4 ms to minimize.
[2023-03-19 07:55:29] [INFO ] Deduced a trap composed of 7 places in 1091 ms of which 2 ms to minimize.
[2023-03-19 07:55:30] [INFO ] Deduced a trap composed of 7 places in 1361 ms of which 6 ms to minimize.
[2023-03-19 07:55:31] [INFO ] Deduced a trap composed of 9 places in 900 ms of which 1 ms to minimize.
[2023-03-19 07:55:32] [INFO ] Deduced a trap composed of 5 places in 918 ms of which 2 ms to minimize.
[2023-03-19 07:55:34] [INFO ] Deduced a trap composed of 6 places in 891 ms of which 2 ms to minimize.
[2023-03-19 07:55:34] [INFO ] Deduced a trap composed of 8 places in 861 ms of which 2 ms to minimize.
[2023-03-19 07:55:36] [INFO ] Deduced a trap composed of 9 places in 978 ms of which 2 ms to minimize.
[2023-03-19 07:55:37] [INFO ] Deduced a trap composed of 5 places in 840 ms of which 2 ms to minimize.
[2023-03-19 07:55:38] [INFO ] Deduced a trap composed of 5 places in 925 ms of which 2 ms to minimize.
[2023-03-19 07:55:39] [INFO ] Deduced a trap composed of 8 places in 1131 ms of which 1 ms to minimize.
[2023-03-19 07:55:40] [INFO ] Deduced a trap composed of 6 places in 721 ms of which 2 ms to minimize.
[2023-03-19 07:55:41] [INFO ] Deduced a trap composed of 4 places in 756 ms of which 1 ms to minimize.
[2023-03-19 07:55:42] [INFO ] Deduced a trap composed of 4 places in 1158 ms of which 2 ms to minimize.
[2023-03-19 07:55:43] [INFO ] Deduced a trap composed of 8 places in 891 ms of which 2 ms to minimize.
[2023-03-19 07:55:45] [INFO ] Deduced a trap composed of 12 places in 1481 ms of which 3 ms to minimize.
[2023-03-19 07:55:46] [INFO ] Deduced a trap composed of 18 places in 912 ms of which 1 ms to minimize.
[2023-03-19 07:55:48] [INFO ] Deduced a trap composed of 18 places in 1846 ms of which 1 ms to minimize.
[2023-03-19 07:55:49] [INFO ] Deduced a trap composed of 8 places in 757 ms of which 17 ms to minimize.
[2023-03-19 07:55:50] [INFO ] Deduced a trap composed of 5 places in 941 ms of which 2 ms to minimize.
[2023-03-19 07:55:51] [INFO ] Deduced a trap composed of 12 places in 724 ms of which 2 ms to minimize.
[2023-03-19 07:55:52] [INFO ] Deduced a trap composed of 11 places in 1077 ms of which 2 ms to minimize.
[2023-03-19 07:55:53] [INFO ] Deduced a trap composed of 10 places in 771 ms of which 2 ms to minimize.
[2023-03-19 07:55:54] [INFO ] Deduced a trap composed of 14 places in 816 ms of which 13 ms to minimize.
[2023-03-19 07:55:55] [INFO ] Deduced a trap composed of 8 places in 1526 ms of which 15 ms to minimize.
[2023-03-19 07:55:57] [INFO ] Deduced a trap composed of 9 places in 1207 ms of which 3 ms to minimize.
[2023-03-19 07:55:58] [INFO ] Deduced a trap composed of 10 places in 811 ms of which 10 ms to minimize.
[2023-03-19 07:55:59] [INFO ] Deduced a trap composed of 11 places in 1377 ms of which 1 ms to minimize.
[2023-03-19 07:56:00] [INFO ] Deduced a trap composed of 13 places in 930 ms of which 2 ms to minimize.
[2023-03-19 07:56:01] [INFO ] Deduced a trap composed of 11 places in 864 ms of which 2 ms to minimize.
[2023-03-19 07:56:02] [INFO ] Deduced a trap composed of 12 places in 1324 ms of which 26 ms to minimize.
[2023-03-19 07:56:04] [INFO ] Deduced a trap composed of 10 places in 1222 ms of which 7 ms to minimize.
[2023-03-19 07:56:05] [INFO ] Deduced a trap composed of 9 places in 689 ms of which 1 ms to minimize.
[2023-03-19 07:56:06] [INFO ] Deduced a trap composed of 11 places in 980 ms of which 2 ms to minimize.
[2023-03-19 07:56:07] [INFO ] Deduced a trap composed of 12 places in 872 ms of which 1 ms to minimize.
[2023-03-19 07:56:08] [INFO ] Deduced a trap composed of 9 places in 1032 ms of which 2 ms to minimize.
[2023-03-19 07:56:09] [INFO ] Deduced a trap composed of 12 places in 824 ms of which 2 ms to minimize.
[2023-03-19 07:56:10] [INFO ] Deduced a trap composed of 14 places in 753 ms of which 1 ms to minimize.
[2023-03-19 07:56:11] [INFO ] Deduced a trap composed of 10 places in 1083 ms of which 1 ms to minimize.
[2023-03-19 07:56:12] [INFO ] Deduced a trap composed of 11 places in 868 ms of which 1 ms to minimize.
[2023-03-19 07:56:13] [INFO ] Deduced a trap composed of 23 places in 800 ms of which 1 ms to minimize.
[2023-03-19 07:56:14] [INFO ] Deduced a trap composed of 9 places in 717 ms of which 2 ms to minimize.
[2023-03-19 07:56:15] [INFO ] Deduced a trap composed of 10 places in 772 ms of which 1 ms to minimize.
[2023-03-19 07:56:16] [INFO ] Deduced a trap composed of 14 places in 829 ms of which 2 ms to minimize.
[2023-03-19 07:56:17] [INFO ] Deduced a trap composed of 10 places in 886 ms of which 3 ms to minimize.
[2023-03-19 07:56:20] [INFO ] Deduced a trap composed of 10 places in 3086 ms of which 3 ms to minimize.
[2023-03-19 07:56:23] [INFO ] Deduced a trap composed of 12 places in 2628 ms of which 42 ms to minimize.
[2023-03-19 07:56:26] [INFO ] Deduced a trap composed of 12 places in 2573 ms of which 1 ms to minimize.
[2023-03-19 07:56:27] [INFO ] Deduced a trap composed of 14 places in 648 ms of which 1 ms to minimize.
[2023-03-19 07:56:27] [INFO ] Deduced a trap composed of 15 places in 701 ms of which 1 ms to minimize.
[2023-03-19 07:56:28] [INFO ] Deduced a trap composed of 14 places in 667 ms of which 2 ms to minimize.
[2023-03-19 07:56:29] [INFO ] Deduced a trap composed of 13 places in 654 ms of which 1 ms to minimize.
[2023-03-19 07:56:30] [INFO ] Deduced a trap composed of 14 places in 865 ms of which 10 ms to minimize.
[2023-03-19 07:56:31] [INFO ] Deduced a trap composed of 14 places in 1183 ms of which 1 ms to minimize.
[2023-03-19 07:56:32] [INFO ] Deduced a trap composed of 12 places in 1152 ms of which 1 ms to minimize.
[2023-03-19 07:56:34] [INFO ] Deduced a trap composed of 12 places in 1094 ms of which 2 ms to minimize.
[2023-03-19 07:56:35] [INFO ] Deduced a trap composed of 11 places in 1444 ms of which 1 ms to minimize.
[2023-03-19 07:56:36] [INFO ] Deduced a trap composed of 12 places in 809 ms of which 1 ms to minimize.
[2023-03-19 07:56:37] [INFO ] Deduced a trap composed of 20 places in 812 ms of which 2 ms to minimize.
[2023-03-19 07:56:38] [INFO ] Deduced a trap composed of 13 places in 905 ms of which 2 ms to minimize.
[2023-03-19 07:56:39] [INFO ] Deduced a trap composed of 37 places in 555 ms of which 1 ms to minimize.
[2023-03-19 07:56:40] [INFO ] Deduced a trap composed of 13 places in 706 ms of which 1 ms to minimize.
[2023-03-19 07:56:40] [INFO ] Deduced a trap composed of 29 places in 586 ms of which 3 ms to minimize.
[2023-03-19 07:56:41] [INFO ] Deduced a trap composed of 12 places in 686 ms of which 2 ms to minimize.
[2023-03-19 07:56:42] [INFO ] Deduced a trap composed of 23 places in 738 ms of which 3 ms to minimize.
[2023-03-19 07:56:43] [INFO ] Deduced a trap composed of 17 places in 819 ms of which 3 ms to minimize.
[2023-03-19 07:56:44] [INFO ] Deduced a trap composed of 14 places in 563 ms of which 2 ms to minimize.
[2023-03-19 07:56:45] [INFO ] Deduced a trap composed of 14 places in 785 ms of which 2 ms to minimize.
[2023-03-19 07:56:45] [INFO ] Deduced a trap composed of 24 places in 596 ms of which 1 ms to minimize.
[2023-03-19 07:56:46] [INFO ] Deduced a trap composed of 28 places in 602 ms of which 1 ms to minimize.
[2023-03-19 07:56:46] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 87673 ms
[2023-03-19 07:56:47] [INFO ] Deduced a trap composed of 5 places in 645 ms of which 1 ms to minimize.
[2023-03-19 07:56:48] [INFO ] Deduced a trap composed of 9 places in 498 ms of which 1 ms to minimize.
[2023-03-19 07:56:49] [INFO ] Deduced a trap composed of 10 places in 434 ms of which 1 ms to minimize.
[2023-03-19 07:56:50] [INFO ] Deduced a trap composed of 8 places in 659 ms of which 1 ms to minimize.
[2023-03-19 07:56:50] [INFO ] Deduced a trap composed of 10 places in 482 ms of which 1 ms to minimize.
[2023-03-19 07:56:51] [INFO ] Deduced a trap composed of 11 places in 439 ms of which 1 ms to minimize.
[2023-03-19 07:56:52] [INFO ] Deduced a trap composed of 12 places in 523 ms of which 1 ms to minimize.
[2023-03-19 07:56:53] [INFO ] Deduced a trap composed of 13 places in 547 ms of which 2 ms to minimize.
[2023-03-19 07:56:53] [INFO ] Deduced a trap composed of 12 places in 554 ms of which 1 ms to minimize.
[2023-03-19 07:56:54] [INFO ] Deduced a trap composed of 9 places in 536 ms of which 1 ms to minimize.
[2023-03-19 07:56:55] [INFO ] Deduced a trap composed of 6 places in 660 ms of which 2 ms to minimize.
[2023-03-19 07:56:55] [INFO ] Deduced a trap composed of 13 places in 447 ms of which 0 ms to minimize.
[2023-03-19 07:56:56] [INFO ] Deduced a trap composed of 5 places in 651 ms of which 1 ms to minimize.
[2023-03-19 07:56:57] [INFO ] Deduced a trap composed of 24 places in 664 ms of which 2 ms to minimize.
[2023-03-19 07:56:58] [INFO ] Deduced a trap composed of 18 places in 457 ms of which 1 ms to minimize.
[2023-03-19 07:56:58] [INFO ] Deduced a trap composed of 12 places in 584 ms of which 2 ms to minimize.
[2023-03-19 07:56:59] [INFO ] Deduced a trap composed of 14 places in 381 ms of which 1 ms to minimize.
[2023-03-19 07:56:59] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 12387 ms
[2023-03-19 07:57:00] [INFO ] Deduced a trap composed of 19 places in 807 ms of which 1 ms to minimize.
[2023-03-19 07:57:02] [INFO ] Deduced a trap composed of 4 places in 974 ms of which 2 ms to minimize.
[2023-03-19 07:57:03] [INFO ] Deduced a trap composed of 14 places in 1034 ms of which 2 ms to minimize.
[2023-03-19 07:57:04] [INFO ] Deduced a trap composed of 6 places in 953 ms of which 1 ms to minimize.
[2023-03-19 07:57:05] [INFO ] Deduced a trap composed of 9 places in 727 ms of which 1 ms to minimize.
[2023-03-19 07:57:06] [INFO ] Deduced a trap composed of 10 places in 658 ms of which 2 ms to minimize.
[2023-03-19 07:57:07] [INFO ] Deduced a trap composed of 9 places in 835 ms of which 2 ms to minimize.
[2023-03-19 07:57:08] [INFO ] Deduced a trap composed of 12 places in 824 ms of which 2 ms to minimize.
[2023-03-19 07:57:08] [INFO ] Deduced a trap composed of 11 places in 618 ms of which 1 ms to minimize.
[2023-03-19 07:57:09] [INFO ] Deduced a trap composed of 13 places in 606 ms of which 1 ms to minimize.
[2023-03-19 07:57:10] [INFO ] Deduced a trap composed of 13 places in 836 ms of which 2 ms to minimize.
[2023-03-19 07:57:11] [INFO ] Deduced a trap composed of 7 places in 709 ms of which 1 ms to minimize.
[2023-03-19 07:57:12] [INFO ] Deduced a trap composed of 14 places in 607 ms of which 1 ms to minimize.
[2023-03-19 07:57:13] [INFO ] Deduced a trap composed of 12 places in 649 ms of which 1 ms to minimize.
[2023-03-19 07:57:14] [INFO ] Deduced a trap composed of 13 places in 818 ms of which 2 ms to minimize.
[2023-03-19 07:57:14] [INFO ] Deduced a trap composed of 9 places in 645 ms of which 2 ms to minimize.
[2023-03-19 07:57:15] [INFO ] Deduced a trap composed of 9 places in 634 ms of which 1 ms to minimize.
[2023-03-19 07:57:16] [INFO ] Deduced a trap composed of 6 places in 898 ms of which 2 ms to minimize.
[2023-03-19 07:57:17] [INFO ] Deduced a trap composed of 7 places in 712 ms of which 2 ms to minimize.
[2023-03-19 07:57:18] [INFO ] Deduced a trap composed of 7 places in 645 ms of which 1 ms to minimize.
[2023-03-19 07:57:19] [INFO ] Deduced a trap composed of 12 places in 623 ms of which 1 ms to minimize.
[2023-03-19 07:57:19] [INFO ] Deduced a trap composed of 9 places in 652 ms of which 1 ms to minimize.
[2023-03-19 07:57:20] [INFO ] Deduced a trap composed of 12 places in 592 ms of which 1 ms to minimize.
[2023-03-19 07:57:21] [INFO ] Deduced a trap composed of 8 places in 670 ms of which 21 ms to minimize.
[2023-03-19 07:57:22] [INFO ] Deduced a trap composed of 11 places in 655 ms of which 1 ms to minimize.
[2023-03-19 07:57:23] [INFO ] Deduced a trap composed of 13 places in 931 ms of which 1 ms to minimize.
[2023-03-19 07:57:24] [INFO ] Deduced a trap composed of 16 places in 826 ms of which 2 ms to minimize.
[2023-03-19 07:57:25] [INFO ] Deduced a trap composed of 8 places in 919 ms of which 2 ms to minimize.
[2023-03-19 07:57:26] [INFO ] Deduced a trap composed of 7 places in 872 ms of which 1 ms to minimize.
[2023-03-19 07:57:27] [INFO ] Deduced a trap composed of 7 places in 1068 ms of which 1 ms to minimize.
[2023-03-19 07:57:29] [INFO ] Deduced a trap composed of 23 places in 1717 ms of which 1 ms to minimize.
[2023-03-19 07:57:30] [INFO ] Deduced a trap composed of 23 places in 687 ms of which 1 ms to minimize.
[2023-03-19 07:57:31] [INFO ] Deduced a trap composed of 16 places in 751 ms of which 1 ms to minimize.
[2023-03-19 07:57:31] [INFO ] Deduced a trap composed of 13 places in 631 ms of which 2 ms to minimize.
[2023-03-19 07:57:32] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 32359 ms
[2023-03-19 07:57:41] [INFO ] Deduced a trap composed of 17 places in 743 ms of which 1 ms to minimize.
[2023-03-19 07:57:42] [INFO ] Deduced a trap composed of 7 places in 697 ms of which 1 ms to minimize.
[2023-03-19 07:57:43] [INFO ] Deduced a trap composed of 10 places in 599 ms of which 1 ms to minimize.
[2023-03-19 07:57:44] [INFO ] Deduced a trap composed of 11 places in 1024 ms of which 1 ms to minimize.
[2023-03-19 07:57:45] [INFO ] Deduced a trap composed of 6 places in 483 ms of which 1 ms to minimize.
[2023-03-19 07:57:46] [INFO ] Deduced a trap composed of 11 places in 504 ms of which 0 ms to minimize.
[2023-03-19 07:57:46] [INFO ] Deduced a trap composed of 11 places in 560 ms of which 1 ms to minimize.
[2023-03-19 07:57:48] [INFO ] Deduced a trap composed of 10 places in 541 ms of which 1 ms to minimize.
[2023-03-19 07:57:49] [INFO ] Deduced a trap composed of 13 places in 1012 ms of which 2 ms to minimize.
[2023-03-19 07:57:50] [INFO ] Deduced a trap composed of 8 places in 575 ms of which 1 ms to minimize.
[2023-03-19 07:57:50] [INFO ] Deduced a trap composed of 12 places in 595 ms of which 1 ms to minimize.
[2023-03-19 07:57:51] [INFO ] Deduced a trap composed of 6 places in 601 ms of which 1 ms to minimize.
[2023-03-19 07:57:52] [INFO ] Deduced a trap composed of 7 places in 481 ms of which 1 ms to minimize.
[2023-03-19 07:57:53] [INFO ] Deduced a trap composed of 10 places in 561 ms of which 1 ms to minimize.
[2023-03-19 07:57:53] [INFO ] Deduced a trap composed of 11 places in 453 ms of which 1 ms to minimize.
[2023-03-19 07:57:54] [INFO ] Deduced a trap composed of 7 places in 555 ms of which 1 ms to minimize.
[2023-03-19 07:57:55] [INFO ] Deduced a trap composed of 8 places in 553 ms of which 1 ms to minimize.
[2023-03-19 07:57:56] [INFO ] Deduced a trap composed of 12 places in 552 ms of which 1 ms to minimize.
[2023-03-19 07:57:57] [INFO ] Deduced a trap composed of 12 places in 397 ms of which 1 ms to minimize.
[2023-03-19 07:57:58] [INFO ] Deduced a trap composed of 13 places in 505 ms of which 1 ms to minimize.
[2023-03-19 07:57:58] [INFO ] Deduced a trap composed of 12 places in 421 ms of which 1 ms to minimize.
[2023-03-19 07:57:59] [INFO ] Deduced a trap composed of 11 places in 561 ms of which 1 ms to minimize.
[2023-03-19 07:58:00] [INFO ] Deduced a trap composed of 8 places in 579 ms of which 0 ms to minimize.
[2023-03-19 07:58:00] [INFO ] Deduced a trap composed of 7 places in 434 ms of which 1 ms to minimize.
[2023-03-19 07:58:01] [INFO ] Deduced a trap composed of 15 places in 444 ms of which 1 ms to minimize.
[2023-03-19 07:58:02] [INFO ] Deduced a trap composed of 14 places in 542 ms of which 1 ms to minimize.
[2023-03-19 07:58:02] [INFO ] Deduced a trap composed of 13 places in 498 ms of which 1 ms to minimize.
[2023-03-19 07:58:03] [INFO ] Deduced a trap composed of 11 places in 410 ms of which 1 ms to minimize.
[2023-03-19 07:58:04] [INFO ] Deduced a trap composed of 9 places in 476 ms of which 1 ms to minimize.
[2023-03-19 07:58:04] [INFO ] Deduced a trap composed of 10 places in 408 ms of which 1 ms to minimize.
[2023-03-19 07:58:05] [INFO ] Deduced a trap composed of 9 places in 464 ms of which 1 ms to minimize.
[2023-03-19 07:58:06] [INFO ] Deduced a trap composed of 12 places in 764 ms of which 1 ms to minimize.
[2023-03-19 07:58:06] [INFO ] Deduced a trap composed of 14 places in 403 ms of which 1 ms to minimize.
[2023-03-19 07:58:07] [INFO ] Deduced a trap composed of 13 places in 450 ms of which 1 ms to minimize.
[2023-03-19 07:58:08] [INFO ] Deduced a trap composed of 13 places in 410 ms of which 1 ms to minimize.
[2023-03-19 07:58:08] [INFO ] Deduced a trap composed of 9 places in 507 ms of which 1 ms to minimize.
[2023-03-19 07:58:09] [INFO ] Deduced a trap composed of 14 places in 548 ms of which 1 ms to minimize.
[2023-03-19 07:58:10] [INFO ] Deduced a trap composed of 12 places in 379 ms of which 1 ms to minimize.
[2023-03-19 07:58:10] [INFO ] Deduced a trap composed of 12 places in 452 ms of which 1 ms to minimize.
[2023-03-19 07:58:11] [INFO ] Deduced a trap composed of 15 places in 370 ms of which 13 ms to minimize.
[2023-03-19 07:58:12] [INFO ] Deduced a trap composed of 12 places in 547 ms of which 1 ms to minimize.
[2023-03-19 07:58:13] [INFO ] Deduced a trap composed of 10 places in 460 ms of which 1 ms to minimize.
[2023-03-19 07:58:14] [INFO ] Deduced a trap composed of 7 places in 365 ms of which 0 ms to minimize.
[2023-03-19 07:58:14] [INFO ] Deduced a trap composed of 22 places in 515 ms of which 1 ms to minimize.
[2023-03-19 07:58:15] [INFO ] Deduced a trap composed of 14 places in 386 ms of which 1 ms to minimize.
[2023-03-19 07:58:16] [INFO ] Deduced a trap composed of 13 places in 429 ms of which 1 ms to minimize.
[2023-03-19 07:58:17] [INFO ] Deduced a trap composed of 11 places in 543 ms of which 1 ms to minimize.
[2023-03-19 07:58:17] [INFO ] Deduced a trap composed of 14 places in 399 ms of which 1 ms to minimize.
[2023-03-19 07:58:18] [INFO ] Deduced a trap composed of 17 places in 312 ms of which 1 ms to minimize.
[2023-03-19 07:58:18] [INFO ] Deduced a trap composed of 18 places in 404 ms of which 1 ms to minimize.
[2023-03-19 07:58:27] [INFO ] Deduced a trap composed of 7 places in 565 ms of which 1 ms to minimize.
[2023-03-19 07:58:27] [INFO ] Deduced a trap composed of 6 places in 583 ms of which 1 ms to minimize.
[2023-03-19 07:58:28] [INFO ] Deduced a trap composed of 6 places in 464 ms of which 13 ms to minimize.
[2023-03-19 07:58:28] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 1 ms to minimize.
[2023-03-19 07:58:29] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 2 ms to minimize.
[2023-03-19 07:58:30] [INFO ] Deduced a trap composed of 10 places in 427 ms of which 0 ms to minimize.
[2023-03-19 07:58:31] [INFO ] Deduced a trap composed of 12 places in 1587 ms of which 0 ms to minimize.
[2023-03-19 07:58:32] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 2 ms to minimize.
[2023-03-19 07:58:32] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 1 ms to minimize.
[2023-03-19 07:58:33] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 1 ms to minimize.
[2023-03-19 07:58:33] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 1 ms to minimize.
[2023-03-19 07:58:35] [INFO ] Deduced a trap composed of 10 places in 990 ms of which 1 ms to minimize.
[2023-03-19 07:58:35] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 1 ms to minimize.
[2023-03-19 07:58:36] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 1 ms to minimize.
[2023-03-19 07:58:36] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 1 ms to minimize.
[2023-03-19 07:58:36] [INFO ] Deduced a trap composed of 12 places in 395 ms of which 1 ms to minimize.
[2023-03-19 07:58:38] [INFO ] Deduced a trap composed of 10 places in 909 ms of which 1 ms to minimize.
[2023-03-19 07:58:38] [INFO ] Deduced a trap composed of 13 places in 372 ms of which 1 ms to minimize.
[2023-03-19 07:58:39] [INFO ] Deduced a trap composed of 11 places in 334 ms of which 1 ms to minimize.
[2023-03-19 07:58:39] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 1 ms to minimize.
[2023-03-19 07:58:40] [INFO ] Deduced a trap composed of 12 places in 327 ms of which 0 ms to minimize.
[2023-03-19 07:58:41] [INFO ] Deduced a trap composed of 12 places in 311 ms of which 1 ms to minimize.
[2023-03-19 07:58:41] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 1 ms to minimize.
[2023-03-19 07:58:41] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 0 ms to minimize.
[2023-03-19 07:58:42] [INFO ] Deduced a trap composed of 17 places in 427 ms of which 1 ms to minimize.
[2023-03-19 07:58:42] [INFO ] Trap strengthening (SAT) tested/added 76/75 trap constraints in 62612 ms
[2023-03-19 07:58:44] [INFO ] Deduced a trap composed of 12 places in 602 ms of which 1 ms to minimize.
[2023-03-19 07:58:45] [INFO ] Deduced a trap composed of 9 places in 458 ms of which 0 ms to minimize.
[2023-03-19 07:58:45] [INFO ] Deduced a trap composed of 7 places in 380 ms of which 1 ms to minimize.
[2023-03-19 07:58:46] [INFO ] Deduced a trap composed of 9 places in 398 ms of which 2 ms to minimize.
[2023-03-19 07:58:47] [INFO ] Deduced a trap composed of 9 places in 322 ms of which 1 ms to minimize.
[2023-03-19 07:58:47] [INFO ] Deduced a trap composed of 9 places in 321 ms of which 3 ms to minimize.
[2023-03-19 07:58:48] [INFO ] Deduced a trap composed of 12 places in 301 ms of which 1 ms to minimize.
[2023-03-19 07:58:48] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 1 ms to minimize.
[2023-03-19 07:58:49] [INFO ] Deduced a trap composed of 11 places in 419 ms of which 1 ms to minimize.
[2023-03-19 07:58:49] [INFO ] Deduced a trap composed of 9 places in 372 ms of which 0 ms to minimize.
[2023-03-19 07:58:50] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 1 ms to minimize.
[2023-03-19 07:58:50] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 1 ms to minimize.
[2023-03-19 07:58:52] [INFO ] Deduced a trap composed of 10 places in 368 ms of which 1 ms to minimize.
[2023-03-19 07:58:52] [INFO ] Deduced a trap composed of 10 places in 455 ms of which 14 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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
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-19 07:58:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:58:52] [INFO ] After 225331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 07:58:53] [INFO ] Flatten gal took : 235 ms
[2023-03-19 07:58:53] [INFO ] Applying decomposition
[2023-03-19 07:58:53] [INFO ] Flatten gal took : 215 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17441011226324714701.txt' '-o' '/tmp/graph17441011226324714701.bin' '-w' '/tmp/graph17441011226324714701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17441011226324714701.bin' '-l' '-1' '-v' '-w' '/tmp/graph17441011226324714701.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:58:54] [INFO ] Decomposing Gal with order
[2023-03-19 07:58:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:58:56] [INFO ] Removed a total of 900 redundant transitions.
[2023-03-19 07:58:56] [INFO ] Flatten gal took : 472 ms
[2023-03-19 07:58:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 44 ms.
[2023-03-19 07:58:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10862805643039438991.gal : 101 ms
[2023-03-19 07:58:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15756565562637593928.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10862805643039438991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15756565562637593928.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality15756565562637593928.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :1 after 8.23668e+06
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :8.23668e+06 after 7.32385e+08
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :7.32385e+08 after 3.41734e+09
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :3.41734e+09 after 3.5262e+09
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3.5262e+09 after 7.05239e+09
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :7.05239e+09 after 1.27089e+280
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 08:29:02] [INFO ] Flatten gal took : 1443 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8771651279366627656
[2023-03-19 08:29:03] [INFO ] Too many transitions (2831) to apply POR reductions. Disabling POR matrices.
[2023-03-19 08:29:03] [INFO ] Applying decomposition
[2023-03-19 08:29:03] [INFO ] Built C files in 498ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8771651279366627656
Running compilation step : cd /tmp/ltsmin8771651279366627656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '90' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 08:29:04] [INFO ] Flatten gal took : 874 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11790913939317933534.txt' '-o' '/tmp/graph11790913939317933534.bin' '-w' '/tmp/graph11790913939317933534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11790913939317933534.bin' '-l' '-1' '-v' '-w' '/tmp/graph11790913939317933534.weights' '-q' '0' '-e' '0.001'
[2023-03-19 08:29:09] [INFO ] Decomposing Gal with order
[2023-03-19 08:29:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 08:29:09] [INFO ] Removed a total of 1352 redundant transitions.
[2023-03-19 08:29:10] [INFO ] Flatten gal took : 312 ms
[2023-03-19 08:29:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 1971 labels/synchronizations in 254 ms.
[2023-03-19 08:29:10] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2011493347850423771.gal : 52 ms
[2023-03-19 08:29:10] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13686126333013974452.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability2011493347850423771.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13686126333013974452.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability13686126333013974452.prop.
Compilation finished in 8112 ms.
Running link step : cd /tmp/ltsmin8771651279366627656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin8771651279366627656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT100BReachabilityFireability00==true'
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 27
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :27 after 1023
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :1023 after 1.93934e+07
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1.93934e+07 after 2.36797e+10
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :2.36797e+10 after 1.35108e+13
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1.35108e+13 after 3.15174e+17
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3.15174e+17 after 5.08197e+25
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin8771651279366627656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT100BReachabilityFireability00==true'
Running LTSmin : cd /tmp/ltsmin8771651279366627656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT100BReachabilityFireability04==true'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin8771651279366627656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT100BReachabilityFireability04==true'
Running LTSmin : cd /tmp/ltsmin8771651279366627656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT100BReachabilityFireability07==true'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin8771651279366627656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT100BReachabilityFireability07==true'
Running LTSmin : cd /tmp/ltsmin8771651279366627656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT100BReachabilityFireability08==true'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 4608512 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16177556 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="ShieldPPPs-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPs-PT-100B, 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 r389-oct2-167903713700527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-100B.tgz
mv ShieldPPPs-PT-100B 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 '
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 ;