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-167903713400302.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 ShieldIIPt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713400302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 512K 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 ShieldIIPt-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679187397248

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-19 00:56:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 00:56:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:56:39] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-19 00:56:40] [INFO ] Transformed 2103 places.
[2023-03-19 00:56:40] [INFO ] Transformed 1953 transitions.
[2023-03-19 00:56:40] [INFO ] Found NUPN structural information;
[2023-03-19 00:56:40] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 00:56:40] [INFO ] Flatten gal took : 255 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 15) seen :10
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
[2023-03-19 00:56:40] [INFO ] Flatten gal took : 117 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
[2023-03-19 00:56:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15501132044160211382.gal : 49 ms
[2023-03-19 00:56:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality108760007731840660.prop : 2 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/ReachabilityCardinality15501132044160211382.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality108760007731840660.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) 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 ...328
Running SMT prover for 5 properties.
// Phase 1: matrix 1953 rows 2103 cols
[2023-03-19 00:56:40] [INFO ] Computed 271 place invariants in 20 ms
Loading property file /tmp/ReachabilityCardinality108760007731840660.prop.
[2023-03-19 00:56:41] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 00:56:42] [INFO ] [Nat]Absence check using 271 positive place invariants in 80 ms returned sat
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :36 after 136
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :136 after 671
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :671 after 90101
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :90101 after 2.31482e+09
Invariant property ShieldIIPt-PT-030B-ReachabilityCardinality-13 does not hold.
Invariant property ShieldIIPt-PT-030B-ReachabilityCardinality-05 does not hold.
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :2.31482e+09 after 4.68295e+19
Invariant property ShieldIIPt-PT-030B-ReachabilityCardinality-14 does not hold.
[2023-03-19 00:56:46] [INFO ] After 4029ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 00:56:47] [INFO ] Deduced a trap composed of 21 places in 700 ms of which 18 ms to minimize.
[2023-03-19 00:56:48] [INFO ] Deduced a trap composed of 18 places in 892 ms of which 3 ms to minimize.
[2023-03-19 00:56:48] [INFO ] Deduced a trap composed of 19 places in 659 ms of which 2 ms to minimize.
[2023-03-19 00:56:49] [INFO ] Deduced a trap composed of 28 places in 584 ms of which 2 ms to minimize.
[2023-03-19 00:56:50] [INFO ] Deduced a trap composed of 18 places in 1317 ms of which 7 ms to minimize.
[2023-03-19 00:56:51] [INFO ] Deduced a trap composed of 31 places in 684 ms of which 3 ms to minimize.
[2023-03-19 00:56:52] [INFO ] Deduced a trap composed of 45 places in 791 ms of which 29 ms to minimize.
[2023-03-19 00:56:53] [INFO ] Deduced a trap composed of 37 places in 1115 ms of which 2 ms to minimize.
[2023-03-19 00:56:54] [INFO ] Deduced a trap composed of 28 places in 1152 ms of which 1 ms to minimize.
[2023-03-19 00:56:55] [INFO ] Deduced a trap composed of 28 places in 659 ms of which 1 ms to minimize.
[2023-03-19 00:56:56] [INFO ] Deduced a trap composed of 29 places in 578 ms of which 2 ms to minimize.
[2023-03-19 00:56:57] [INFO ] Deduced a trap composed of 19 places in 730 ms of which 21 ms to minimize.
[2023-03-19 00:56:57] [INFO ] Deduced a trap composed of 50 places in 579 ms of which 1 ms to minimize.
[2023-03-19 00:56:58] [INFO ] Deduced a trap composed of 27 places in 605 ms of which 2 ms to minimize.
[2023-03-19 00:56:59] [INFO ] Deduced a trap composed of 28 places in 534 ms of which 1 ms to minimize.
[2023-03-19 00:56:59] [INFO ] Deduced a trap composed of 22 places in 617 ms of which 1 ms to minimize.
[2023-03-19 00:57:00] [INFO ] Deduced a trap composed of 35 places in 810 ms of which 1 ms to minimize.
[2023-03-19 00:57:01] [INFO ] Deduced a trap composed of 26 places in 634 ms of which 23 ms to minimize.
[2023-03-19 00:57:02] [INFO ] Deduced a trap composed of 26 places in 664 ms of which 2 ms to minimize.
[2023-03-19 00:57:03] [INFO ] Deduced a trap composed of 26 places in 604 ms of which 1 ms to minimize.
[2023-03-19 00:57:03] [INFO ] Deduced a trap composed of 38 places in 714 ms of which 1 ms to minimize.
[2023-03-19 00:57:04] [INFO ] Deduced a trap composed of 22 places in 528 ms of which 2 ms to minimize.
[2023-03-19 00:57:05] [INFO ] Deduced a trap composed of 45 places in 489 ms of which 1 ms to minimize.
[2023-03-19 00:57:05] [INFO ] Deduced a trap composed of 22 places in 505 ms of which 1 ms to minimize.
[2023-03-19 00:57:06] [INFO ] Deduced a trap composed of 33 places in 679 ms of which 1 ms to minimize.
[2023-03-19 00:57:06] [INFO ] Deduced a trap composed of 24 places in 528 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 00:57:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:57:06] [INFO ] After 25396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 282 ms.
Support contains 113 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 2103 transition count 1516
Reduce places removed 437 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 439 rules applied. Total rules applied 876 place count 1666 transition count 1514
Reduce places removed 1 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 30 rules applied. Total rules applied 906 place count 1665 transition count 1485
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 935 place count 1636 transition count 1485
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 935 place count 1636 transition count 1360
Deduced a syphon composed of 125 places in 2 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 1185 place count 1511 transition count 1360
Discarding 188 places :
Symmetric choice reduction at 4 with 188 rule applications. Total rules 1373 place count 1323 transition count 1172
Iterating global reduction 4 with 188 rules applied. Total rules applied 1561 place count 1323 transition count 1172
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 1561 place count 1323 transition count 1098
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 1709 place count 1249 transition count 1098
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 1 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 4 with 900 rules applied. Total rules applied 2609 place count 799 transition count 648
Renaming transitions due to excessive name length > 1024 char.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 2763 place count 722 transition count 688
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2765 place count 722 transition count 686
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2767 place count 720 transition count 686
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 2793 place count 720 transition count 686
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2794 place count 719 transition count 685
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2796 place count 717 transition count 685
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2796 place count 717 transition count 684
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2798 place count 716 transition count 684
Applied a total of 2798 rules in 605 ms. Remains 716 /2103 variables (removed 1387) and now considering 684/1953 (removed 1269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 606 ms. Remains : 716/2103 places, 684/1953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 128995 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128995 steps, saw 73014 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 684 rows 716 cols
[2023-03-19 00:57:11] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-19 00:57:11] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 00:57:11] [INFO ] [Nat]Absence check using 269 positive place invariants in 54 ms returned sat
[2023-03-19 00:57:13] [INFO ] After 888ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 00:57:13] [INFO ] State equation strengthened by 107 read => feed constraints.
[2023-03-19 00:57:13] [INFO ] After 610ms SMT Verify possible using 107 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 00:57:13] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-19 00:57:14] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2023-03-19 00:57:14] [INFO ] Deduced a trap composed of 3 places in 553 ms of which 1 ms to minimize.
[2023-03-19 00:57:14] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2023-03-19 00:57:15] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2023-03-19 00:57:15] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 0 ms to minimize.
[2023-03-19 00:57:15] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 0 ms to minimize.
[2023-03-19 00:57:15] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2023-03-19 00:57:15] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-03-19 00:57:16] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2023-03-19 00:57:16] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-19 00:57:16] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 0 ms to minimize.
[2023-03-19 00:57:16] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2023-03-19 00:57:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2811 ms
[2023-03-19 00:57:17] [INFO ] Deduced a trap composed of 3 places in 500 ms of which 2 ms to minimize.
[2023-03-19 00:57:17] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 0 ms to minimize.
[2023-03-19 00:57:17] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2023-03-19 00:57:18] [INFO ] Deduced a trap composed of 6 places in 512 ms of which 13 ms to minimize.
[2023-03-19 00:57:18] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 0 ms to minimize.
[2023-03-19 00:57:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1846 ms
[2023-03-19 00:57:19] [INFO ] Deduced a trap composed of 8 places in 326 ms of which 0 ms to minimize.
[2023-03-19 00:57:19] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 1 ms to minimize.
[2023-03-19 00:57:19] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-19 00:57:19] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 0 ms to minimize.
[2023-03-19 00:57:20] [INFO ] Deduced a trap composed of 6 places in 699 ms of which 0 ms to minimize.
[2023-03-19 00:57:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1786 ms
[2023-03-19 00:57:20] [INFO ] After 7511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 539 ms.
[2023-03-19 00:57:21] [INFO ] After 9528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 127 ms.
Support contains 113 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 684/684 transitions.
Applied a total of 0 rules in 59 ms. Remains 716 /716 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 716/716 places, 684/684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 684/684 transitions.
Applied a total of 0 rules in 35 ms. Remains 716 /716 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2023-03-19 00:57:21] [INFO ] Invariant cache hit.
[2023-03-19 00:57:21] [INFO ] Implicit Places using invariants in 469 ms returned [702]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 474 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 715/716 places, 684/684 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 714 transition count 683
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 714 transition count 683
Applied a total of 2 rules in 89 ms. Remains 714 /715 variables (removed 1) and now considering 683/684 (removed 1) transitions.
// Phase 1: matrix 683 rows 714 cols
[2023-03-19 00:57:21] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-19 00:57:23] [INFO ] Implicit Places using invariants in 1450 ms returned []
[2023-03-19 00:57:23] [INFO ] Invariant cache hit.
[2023-03-19 00:57:24] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-19 00:57:25] [INFO ] Implicit Places using invariants and state equation in 1744 ms returned []
Implicit Place search using SMT with State Equation took 3237 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 714/716 places, 683/684 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3835 ms. Remains : 714/716 places, 683/684 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 124930 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124930 steps, saw 71924 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-19 00:57:28] [INFO ] Invariant cache hit.
[2023-03-19 00:57:28] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 00:57:29] [INFO ] [Nat]Absence check using 268 positive place invariants in 299 ms returned sat
[2023-03-19 00:57:30] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 00:57:30] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-19 00:57:30] [INFO ] After 496ms SMT Verify possible using 106 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 00:57:31] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2023-03-19 00:57:31] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 1 ms to minimize.
[2023-03-19 00:57:31] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 1 ms to minimize.
[2023-03-19 00:57:31] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2023-03-19 00:57:31] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2023-03-19 00:57:32] [INFO ] Deduced a trap composed of 6 places in 425 ms of which 1 ms to minimize.
[2023-03-19 00:57:32] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-19 00:57:32] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-19 00:57:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2115 ms
[2023-03-19 00:57:33] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2023-03-19 00:57:33] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2023-03-19 00:57:33] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2023-03-19 00:57:34] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2023-03-19 00:57:34] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2023-03-19 00:57:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1156 ms
[2023-03-19 00:57:34] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 2 ms to minimize.
[2023-03-19 00:57:34] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 1 ms to minimize.
[2023-03-19 00:57:35] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 1 ms to minimize.
[2023-03-19 00:57:35] [INFO ] Deduced a trap composed of 7 places in 301 ms of which 0 ms to minimize.
[2023-03-19 00:57:35] [INFO ] Deduced a trap composed of 9 places in 325 ms of which 1 ms to minimize.
[2023-03-19 00:57:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1630 ms
[2023-03-19 00:57:36] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-19 00:57:36] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 14 ms to minimize.
[2023-03-19 00:57:36] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2023-03-19 00:57:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 565 ms
[2023-03-19 00:57:36] [INFO ] After 6614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 632 ms.
[2023-03-19 00:57:37] [INFO ] After 8546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 211 ms.
Support contains 113 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 683/683 transitions.
Applied a total of 0 rules in 72 ms. Remains 714 /714 variables (removed 0) and now considering 683/683 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 714/714 places, 683/683 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 683/683 transitions.
Applied a total of 0 rules in 28 ms. Remains 714 /714 variables (removed 0) and now considering 683/683 (removed 0) transitions.
[2023-03-19 00:57:37] [INFO ] Invariant cache hit.
[2023-03-19 00:57:38] [INFO ] Implicit Places using invariants in 554 ms returned []
[2023-03-19 00:57:38] [INFO ] Invariant cache hit.
[2023-03-19 00:57:38] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-19 00:57:40] [INFO ] Implicit Places using invariants and state equation in 2339 ms returned []
Implicit Place search using SMT with State Equation took 2895 ms to find 0 implicit places.
[2023-03-19 00:57:40] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-19 00:57:40] [INFO ] Invariant cache hit.
[2023-03-19 00:57:41] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3406 ms. Remains : 714/714 places, 683/683 transitions.
Partial Free-agglomeration rule applied 73 times.
Drop transitions removed 73 transitions
Iterating global reduction 0 with 73 rules applied. Total rules applied 73 place count 714 transition count 683
Applied a total of 73 rules in 46 ms. Remains 714 /714 variables (removed 0) and now considering 683/683 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 683 rows 714 cols
[2023-03-19 00:57:41] [INFO ] Computed 268 place invariants in 5 ms
[2023-03-19 00:57:41] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 00:57:41] [INFO ] [Nat]Absence check using 268 positive place invariants in 41 ms returned sat
[2023-03-19 00:57:42] [INFO ] After 645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 00:57:42] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 00:57:42] [INFO ] After 478ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 00:57:42] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
[2023-03-19 00:57:43] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-19 00:57:43] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2023-03-19 00:57:43] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 0 ms to minimize.
[2023-03-19 00:57:43] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2023-03-19 00:57:43] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-19 00:57:44] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-03-19 00:57:44] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 0 ms to minimize.
[2023-03-19 00:57:44] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2023-03-19 00:57:44] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
[2023-03-19 00:57:45] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2023-03-19 00:57:45] [INFO ] Deduced a trap composed of 8 places in 834 ms of which 1 ms to minimize.
[2023-03-19 00:57:46] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-19 00:57:46] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2023-03-19 00:57:46] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 0 ms to minimize.
[2023-03-19 00:57:46] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2023-03-19 00:57:46] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2023-03-19 00:57:46] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-19 00:57:47] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-19 00:57:47] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4457 ms
[2023-03-19 00:57:47] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-19 00:57:47] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 0 ms to minimize.
[2023-03-19 00:57:48] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-19 00:57:48] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2023-03-19 00:57:48] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2023-03-19 00:57:48] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2023-03-19 00:57:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1147 ms
[2023-03-19 00:57:49] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2023-03-19 00:57:49] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 0 ms to minimize.
[2023-03-19 00:57:49] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2023-03-19 00:57:49] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2023-03-19 00:57:49] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2023-03-19 00:57:50] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-03-19 00:57:50] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2023-03-19 00:57:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1537 ms
[2023-03-19 00:57:50] [INFO ] After 8124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 401 ms.
[2023-03-19 00:57:50] [INFO ] After 9415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-19 00:57:50] [INFO ] Flatten gal took : 34 ms
[2023-03-19 00:57:50] [INFO ] Flatten gal took : 33 ms
[2023-03-19 00:57:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16169549959672004409.gal : 5 ms
[2023-03-19 00:57:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4887259790271554835.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/ReachabilityCardinality16169549959672004409.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4887259790271554835.prop' '--nowitness' '--gen-order' 'FOLLOW'

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
Loading property file /tmp/ReachabilityCardinality4887259790271554835.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :11 after 74
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :74 after 652
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :652 after 6952
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :6952 after 1.5642e+06
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1.5642e+06 after 7.46264e+10
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :7.46264e+10 after 6.4481e+15
Detected timeout of ITS tools.
[2023-03-19 00:58:06] [INFO ] Flatten gal took : 72 ms
[2023-03-19 00:58:06] [INFO ] Applying decomposition
[2023-03-19 00:58:06] [INFO ] Flatten gal took : 58 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/graph5403666423384459860.txt' '-o' '/tmp/graph5403666423384459860.bin' '-w' '/tmp/graph5403666423384459860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5403666423384459860.bin' '-l' '-1' '-v' '-w' '/tmp/graph5403666423384459860.weights' '-q' '0' '-e' '0.001'
[2023-03-19 00:58:06] [INFO ] Decomposing Gal with order
[2023-03-19 00:58:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 00:58:06] [INFO ] Removed a total of 335 redundant transitions.
[2023-03-19 00:58:06] [INFO ] Flatten gal took : 124 ms
[2023-03-19 00:58:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 34 ms.
[2023-03-19 00:58:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10394769940181326178.gal : 18 ms
[2023-03-19 00:58:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14049472496570554538.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/ReachabilityCardinality10394769940181326178.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14049472496570554538.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/ReachabilityCardinality14049472496570554538.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :15 after 15
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :15 after 25
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :25 after 869
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :869 after 1738
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1738 after 2.76394e+09
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2.76394e+09 after 4.83579e+13
Invariant property ShieldIIPt-PT-030B-ReachabilityCardinality-12 does not hold.
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-11 is true.
Invariant property ShieldIIPt-PT-030B-ReachabilityCardinality-00 does not hold.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.11417e+17 after 9.44649e+31
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-07 is true.
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-02 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.87489e+44,3.33289,90656,3008,451,147959,4261,1441,496211,242,38854,0
Total reachable state count : 2.874888476966382722892779768156046137313e+44

Verifying 5 reachability properties.
Invariant property ShieldIIPt-PT-030B-ReachabilityCardinality-00 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-030B-ReachabilityCardinality-00,3.12272e+28,3.34078,90656,846,219,147959,4261,1449,496211,247,38854,0
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-030B-ReachabilityCardinality-02,1.74655e+37,3.34197,90656,831,233,147959,4261,1459,496211,251,38854,0
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-030B-ReachabilityCardinality-07,6.04186e+39,3.48253,90656,1421,284,147959,4261,1683,496211,270,38854,0
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-030B-ReachabilityCardinality-11,1.02699e+29,3.48354,90656,836,238,147959,4261,1689,496211,270,38854,0
Invariant property ShieldIIPt-PT-030B-ReachabilityCardinality-12 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-030B-ReachabilityCardinality-12,6.91255e+43,3.65962,90656,4141,454,147959,4261,1897,496211,272,38854,0
ITS tools runner thread asked to quit. Dying gracefully.
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 00:58:10] [INFO ] Flatten gal took : 50 ms
[2023-03-19 00:58:10] [INFO ] Applying decomposition
[2023-03-19 00:58:10] [INFO ] Flatten gal took : 49 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/graph5136489279636405878.txt' '-o' '/tmp/graph5136489279636405878.bin' '-w' '/tmp/graph5136489279636405878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5136489279636405878.bin' '-l' '-1' '-v' '-w' '/tmp/graph5136489279636405878.weights' '-q' '0' '-e' '0.001'
[2023-03-19 00:58:10] [INFO ] Decomposing Gal with order
[2023-03-19 00:58:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 00:58:10] [INFO ] Removed a total of 180 redundant transitions.
[2023-03-19 00:58:10] [INFO ] Flatten gal took : 116 ms
[2023-03-19 00:58:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2023-03-19 00:58:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11359258143598122116.gal : 28 ms
[2023-03-19 00:58:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14956934353998726790.prop : 2 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/ReachabilityCardinality11359258143598122116.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14956934353998726790.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/ReachabilityCardinality14956934353998726790.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 8988
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :8988 after 8.36608e+41
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :8.36608e+41 after 1.5006e+90
Invariant property ShieldIIPt-PT-030B-ReachabilityCardinality-12 does not hold.
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-11 is true.
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-07 is true.
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-02 is true.
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-030B-ReachabilityCardinality-00 does not hold.
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.62349e+101,2.44868,60496,4051,35,113568,794,1668,175636,47,2929,0
Total reachable state count : 8.623487880493083566516550614151544834669e+101

Verifying 5 reachability properties.
Invariant property ShieldIIPt-PT-030B-ReachabilityCardinality-00 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-030B-ReachabilityCardinality-00,2.56624e+99,2.47145,60760,2829,35,113568,794,1678,175636,52,2929,0
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-030B-ReachabilityCardinality-02,5.24164e+98,2.47306,60760,1079,36,113568,794,1687,175636,54,2929,0
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-030B-ReachabilityCardinality-07,3.62865e+96,2.56076,60760,1212,37,113568,794,1922,175636,66,2929,0
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-030B-ReachabilityCardinality-11,1.33352e+100,2.56416,60760,2533,35,113568,794,1928,175636,66,2929,0
Invariant property ShieldIIPt-PT-030B-ReachabilityCardinality-12 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-030B-ReachabilityCardinality-12,9.02303e+99,2.69686,60760,4639,42,113568,794,2143,175636,68,2929,0
All properties solved without resorting to model-checking.
Total runtime 94072 ms.

BK_STOP 1679187498655

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 ReachabilityCardinality -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="ShieldIIPt-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldIIPt-PT-030B, examination is ReachabilityCardinality"
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-167903713400302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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