fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r339-tall-167889212000133
Last Updated
May 14, 2023

About the Execution of ITS-Tools for RERS17pb115-PT-9

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16217.955 1800000.00 3368717.00 30790.00 [undef] Time out reached

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.r339-tall-167889212000133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 RERS17pb115-PT-9, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r339-tall-167889212000133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 25 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 13:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 13:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 69M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679097301380

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb115-PT-9
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202303021504
[2023-03-17 23:55:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-17 23:55:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 23:55:05] [INFO ] Load time of PNML (sax parser for PT used): 1957 ms
[2023-03-17 23:55:05] [INFO ] Transformed 1399 places.
[2023-03-17 23:55:05] [INFO ] Transformed 144369 transitions.
[2023-03-17 23:55:05] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2535 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2015 ms. (steps per millisecond=4 ) properties (out of 1399) seen :909
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=4 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=4 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=1 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=3 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=1 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 490) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 490) seen :0
Running SMT prover for 490 properties.
[2023-03-17 23:55:09] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1399 cols
[2023-03-17 23:55:10] [INFO ] Computed 37 place invariants in 584 ms
[2023-03-17 23:55:12] [INFO ] Flatten gal took : 4768 ms
[2023-03-17 23:55:16] [INFO ] Flatten gal took : 3814 ms
[2023-03-17 23:55:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7065019169113461767.gal : 713 ms
[2023-03-17 23:55:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17603790149014064180.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/ReachabilityCardinality7065019169113461767.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17603790149014064180.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
[2023-03-17 23:55:24] [INFO ] After 13960ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:490
[2023-03-17 23:55:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2023-03-17 23:55:34] [INFO ] [Nat]Absence check using 19 positive and 18 generalized place invariants in 3 ms returned sat
Loading property file /tmp/ReachabilityCardinality17603790149014064180.prop.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-17 23:55:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 23:55:49] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:490
Fused 490 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 490 out of 1399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1380 transition count 144368
Applied a total of 19 rules in 3053 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3073 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted random walk after 205536 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 474
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=209 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=206 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=204 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=222 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=219 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 541 ms. (steps per millisecond=184 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=215 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 480 ms. (steps per millisecond=208 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=240 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 442 ms. (steps per millisecond=226 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=218 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-17 23:56:29] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-17 23:56:30] [INFO ] Computed 19 place invariants in 440 ms
[2023-03-17 23:56:30] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-17 23:56:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2023-03-17 23:57:02] [INFO ] After 31560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-17 23:57:03] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-17 23:57:26] [INFO ] After 22619ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-17 23:57:34] [INFO ] Deduced a trap composed of 72 places in 7166 ms of which 13 ms to minimize.
[2023-03-17 23:57:42] [INFO ] Deduced a trap composed of 34 places in 6613 ms of which 1 ms to minimize.
[2023-03-17 23:57:50] [INFO ] Deduced a trap composed of 48 places in 6643 ms of which 2 ms to minimize.
[2023-03-17 23:57:57] [INFO ] Deduced a trap composed of 128 places in 5539 ms of which 3 ms to minimize.
[2023-03-17 23:58:03] [INFO ] Deduced a trap composed of 40 places in 4790 ms of which 0 ms to minimize.
[2023-03-17 23:58:08] [INFO ] Deduced a trap composed of 96 places in 4270 ms of which 1 ms to minimize.
[2023-03-17 23:58:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 46415 ms
[2023-03-17 23:59:12] [INFO ] After 128506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 14054 ms.
[2023-03-17 23:59:26] [INFO ] After 175866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1162 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1162 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted random walk after 219324 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4244 ms. (steps per millisecond=235 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4068 ms. (steps per millisecond=245 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3690 ms. (steps per millisecond=271 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3645 ms. (steps per millisecond=274 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3629 ms. (steps per millisecond=275 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3663 ms. (steps per millisecond=273 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 00:00:21] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:00:21] [INFO ] Invariant cache hit.
[2023-03-18 00:00:21] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 00:00:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-18 00:00:45] [INFO ] After 23449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 00:00:45] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 00:00:58] [INFO ] After 12227ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-18 00:01:07] [INFO ] Deduced a trap composed of 72 places in 8290 ms of which 4 ms to minimize.
[2023-03-18 00:01:15] [INFO ] Deduced a trap composed of 96 places in 6295 ms of which 0 ms to minimize.
[2023-03-18 00:01:22] [INFO ] Deduced a trap composed of 48 places in 6124 ms of which 0 ms to minimize.
[2023-03-18 00:01:30] [INFO ] Deduced a trap composed of 40 places in 7117 ms of which 1 ms to minimize.
[2023-03-18 00:01:38] [INFO ] Deduced a trap composed of 128 places in 6392 ms of which 0 ms to minimize.
[2023-03-18 00:01:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 45241 ms
[2023-03-18 00:02:00] [INFO ] After 75068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5013 ms.
[2023-03-18 00:02:05] [INFO ] After 104743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1097 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1098 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted random walk after 231689 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4074 ms. (steps per millisecond=245 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 00:02:41] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:02:41] [INFO ] Invariant cache hit.
[2023-03-18 00:02:41] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:02:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-18 00:03:01] [INFO ] After 19930ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:03:02] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 00:03:11] [INFO ] After 8750ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 00:03:22] [INFO ] Deduced a trap composed of 72 places in 10334 ms of which 2 ms to minimize.
[2023-03-18 00:03:33] [INFO ] Deduced a trap composed of 48 places in 8837 ms of which 1 ms to minimize.
[2023-03-18 00:03:42] [INFO ] Deduced a trap composed of 40 places in 8288 ms of which 1 ms to minimize.
SDD proceeding with computation,490 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,490 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,490 properties remain. new max is 16
SDD size :5 after 6
[2023-03-18 00:03:51] [INFO ] Deduced a trap composed of 72 places in 7593 ms of which 1 ms to minimize.
SDD proceeding with computation,490 properties remain. new max is 32
SDD size :6 after 9
SDD proceeding with computation,490 properties remain. new max is 64
SDD size :9 after 10
[2023-03-18 00:03:58] [INFO ] Deduced a trap composed of 96 places in 6586 ms of which 0 ms to minimize.
SDD proceeding with computation,490 properties remain. new max is 128
SDD size :10 after 12
SDD proceeding with computation,490 properties remain. new max is 256
SDD size :12 after 20
SDD proceeding with computation,490 properties remain. new max is 512
SDD size :20 after 22
SDD proceeding with computation,490 properties remain. new max is 1024
SDD size :22 after 26
[2023-03-18 00:04:05] [INFO ] Deduced a trap composed of 128 places in 6021 ms of which 1 ms to minimize.
[2023-03-18 00:04:12] [INFO ] Deduced a trap composed of 96 places in 5512 ms of which 1 ms to minimize.
[2023-03-18 00:04:18] [INFO ] Deduced a trap composed of 128 places in 4859 ms of which 0 ms to minimize.
[2023-03-18 00:04:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 71721 ms
[2023-03-18 00:04:23] [INFO ] After 81185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1192 ms.
[2023-03-18 00:04:25] [INFO ] After 103285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1198 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1198 ms. Remains : 1380/1380 places, 144368/144368 transitions.
SDD proceeding with computation,490 properties remain. new max is 2048
SDD size :26 after 146
SDD proceeding with computation,490 properties remain. new max is 4096
SDD size :146 after 236
Interrupted random walk after 250876 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3626 ms. (steps per millisecond=275 ) properties (out of 1) seen :0
Detected timeout of ITS tools.
[2023-03-18 00:05:21] [INFO ] Flatten gal took : 3891 ms
[2023-03-18 00:05:21] [INFO ] Applying decomposition
[2023-03-18 00:05:25] [INFO ] Flatten gal took : 3579 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/graph11149681659314109193.txt' '-o' '/tmp/graph11149681659314109193.bin' '-w' '/tmp/graph11149681659314109193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11149681659314109193.bin' '-l' '-1' '-v' '-w' '/tmp/graph11149681659314109193.weights' '-q' '0' '-e' '0.001'
[2023-03-18 00:05:34] [INFO ] Decomposing Gal with order
[2023-03-18 00:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 00:05:44] [INFO ] Removed a total of 435189 redundant transitions.
[2023-03-18 00:05:46] [INFO ] Flatten gal took : 6579 ms
[2023-03-18 00:06:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4035 labels/synchronizations in 11280 ms.
[2023-03-18 00:06:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7562010329450575709.gal : 418 ms
[2023-03-18 00:06:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11521004325817626107.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/ReachabilityCardinality7562010329450575709.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11521004325817626107.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
Interrupted probabilistic random walk after 115873 steps, run timeout after 99009 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 115873 steps, saw 104483 distinct states, run finished after 99010 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 00:06:39] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:06:39] [INFO ] Invariant cache hit.
[2023-03-18 00:06:39] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:06:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2023-03-18 00:07:00] [INFO ] After 20247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:07:00] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 00:07:10] [INFO ] After 9876ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 00:07:22] [INFO ] Deduced a trap composed of 72 places in 10170 ms of which 4 ms to minimize.
[2023-03-18 00:07:31] [INFO ] Deduced a trap composed of 48 places in 8189 ms of which 2 ms to minimize.
[2023-03-18 00:07:39] [INFO ] Deduced a trap composed of 40 places in 6952 ms of which 1 ms to minimize.
[2023-03-18 00:07:47] [INFO ] Deduced a trap composed of 72 places in 6889 ms of which 1 ms to minimize.
[2023-03-18 00:07:55] [INFO ] Deduced a trap composed of 96 places in 6204 ms of which 1 ms to minimize.
[2023-03-18 00:08:02] [INFO ] Deduced a trap composed of 128 places in 5934 ms of which 0 ms to minimize.
[2023-03-18 00:08:09] [INFO ] Deduced a trap composed of 96 places in 5434 ms of which 1 ms to minimize.
[2023-03-18 00:08:17] [INFO ] Deduced a trap composed of 128 places in 6763 ms of which 1 ms to minimize.
[2023-03-18 00:08:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 71479 ms
[2023-03-18 00:08:23] [INFO ] After 82389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1479 ms.
[2023-03-18 00:08:24] [INFO ] After 105273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1130 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1130 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1195 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 00:08:27] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:08:27] [INFO ] Invariant cache hit.
[2023-03-18 00:08:37] [INFO ] Implicit Places using invariants in 10215 ms returned []
Implicit Place search using SMT only with invariants took 10234 ms to find 0 implicit places.
[2023-03-18 00:08:37] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:08:37] [INFO ] Invariant cache hit.
[2023-03-18 00:09:07] [INFO ] Performed 92182/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 00:09:23] [INFO ] Dead Transitions using invariants and state equation in 46386 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57835 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Loading property file /tmp/ReachabilityCardinality11521004325817626107.prop.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 12633 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 00:09:37] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:09:37] [INFO ] Invariant cache hit.
[2023-03-18 00:09:37] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-18 00:09:56] [INFO ] After 19003ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 00:09:57] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 00:10:05] [INFO ] After 7689ms SMT Verify possible using 741 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-18 00:10:18] [INFO ] Deduced a trap composed of 72 places in 11539 ms of which 2 ms to minimize.
[2023-03-18 00:10:27] [INFO ] Deduced a trap composed of 48 places in 7819 ms of which 1 ms to minimize.
[2023-03-18 00:10:35] [INFO ] Deduced a trap composed of 40 places in 6915 ms of which 1 ms to minimize.
[2023-03-18 00:10:43] [INFO ] Deduced a trap composed of 72 places in 6807 ms of which 1 ms to minimize.
[2023-03-18 00:10:51] [INFO ] Deduced a trap composed of 96 places in 6484 ms of which 1 ms to minimize.
[2023-03-18 00:10:58] [INFO ] Deduced a trap composed of 128 places in 6224 ms of which 1 ms to minimize.
[2023-03-18 00:11:05] [INFO ] Deduced a trap composed of 96 places in 5574 ms of which 0 ms to minimize.
[2023-03-18 00:11:11] [INFO ] Deduced a trap composed of 128 places in 4824 ms of which 3 ms to minimize.
[2023-03-18 00:11:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 71219 ms
[2023-03-18 00:11:17] [INFO ] After 79720ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:11:17] [INFO ] After 100138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:11:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-18 00:11:36] [INFO ] After 18930ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:11:43] [INFO ] After 7334ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 00:11:56] [INFO ] Deduced a trap composed of 72 places in 11357 ms of which 2 ms to minimize.
[2023-03-18 00:12:05] [INFO ] Deduced a trap composed of 48 places in 8709 ms of which 1 ms to minimize.
[2023-03-18 00:12:15] [INFO ] Deduced a trap composed of 40 places in 8180 ms of which 1 ms to minimize.
[2023-03-18 00:12:24] [INFO ] Deduced a trap composed of 72 places in 7933 ms of which 14 ms to minimize.
[2023-03-18 00:12:32] [INFO ] Deduced a trap composed of 96 places in 7079 ms of which 13 ms to minimize.
[2023-03-18 00:12:40] [INFO ] Deduced a trap composed of 128 places in 6543 ms of which 1 ms to minimize.
[2023-03-18 00:12:47] [INFO ] Deduced a trap composed of 96 places in 5439 ms of which 1 ms to minimize.
[2023-03-18 00:12:53] [INFO ] Deduced a trap composed of 128 places in 4804 ms of which 0 ms to minimize.
[2023-03-18 00:12:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 74508 ms
[2023-03-18 00:12:58] [INFO ] After 81902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-18 00:12:58] [INFO ] After 100983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Interrupted random walk after 269066 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4288 ms. (steps per millisecond=233 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122468 steps, run timeout after 102007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 122468 steps, saw 110156 distinct states, run finished after 102014 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 00:15:14] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:15:14] [INFO ] Invariant cache hit.
[2023-03-18 00:15:15] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:15:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2023-03-18 00:15:35] [INFO ] After 20478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:15:36] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 00:15:51] [INFO ] After 15101ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2072864837119090419
[2023-03-18 00:16:05] [INFO ] Built C files in 1772ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2072864837119090419
Running compilation step : cd /tmp/ltsmin2072864837119090419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '120' '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-18 00:16:08] [INFO ] Deduced a trap composed of 72 places in 15267 ms of which 9 ms to minimize.
[2023-03-18 00:16:18] [INFO ] Deduced a trap composed of 48 places in 9084 ms of which 15 ms to minimize.
[2023-03-18 00:16:28] [INFO ] Deduced a trap composed of 40 places in 8171 ms of which 1 ms to minimize.
[2023-03-18 00:16:36] [INFO ] Deduced a trap composed of 72 places in 7191 ms of which 0 ms to minimize.
[2023-03-18 00:16:44] [INFO ] Deduced a trap composed of 96 places in 6917 ms of which 2 ms to minimize.
[2023-03-18 00:16:52] [INFO ] Deduced a trap composed of 128 places in 6214 ms of which 2 ms to minimize.
[2023-03-18 00:16:59] [INFO ] Deduced a trap composed of 96 places in 5730 ms of which 1 ms to minimize.
[2023-03-18 00:17:05] [INFO ] Deduced a trap composed of 128 places in 5079 ms of which 0 ms to minimize.
[2023-03-18 00:17:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 78437 ms
[2023-03-18 00:17:11] [INFO ] After 94831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1337 ms.
[2023-03-18 00:17:12] [INFO ] After 117608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1172 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1172 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1165 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 00:17:15] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:17:15] [INFO ] Invariant cache hit.
[2023-03-18 00:17:27] [INFO ] Implicit Places using invariants in 11951 ms returned []
Implicit Place search using SMT only with invariants took 11965 ms to find 0 implicit places.
[2023-03-18 00:17:27] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:17:27] [INFO ] Invariant cache hit.
[2023-03-18 00:17:57] [INFO ] Performed 56194/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2072864837119090419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '120' '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' killed by timeout after 120 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2072864837119090419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '120' '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' killed by timeout after 120 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 00:18:27] [INFO ] Dead Transitions using invariants and state equation in 60077 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73225 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 10584 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 00:18:38] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:18:38] [INFO ] Invariant cache hit.
[2023-03-18 00:18:38] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-18 00:18:58] [INFO ] After 20525ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 00:19:02] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 00:19:10] [INFO ] After 7545ms SMT Verify possible using 741 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-18 00:19:22] [INFO ] Deduced a trap composed of 72 places in 10797 ms of which 3 ms to minimize.
[2023-03-18 00:19:32] [INFO ] Deduced a trap composed of 48 places in 8716 ms of which 1 ms to minimize.
[2023-03-18 00:19:41] [INFO ] Deduced a trap composed of 40 places in 7812 ms of which 1 ms to minimize.
[2023-03-18 00:19:49] [INFO ] Deduced a trap composed of 72 places in 7301 ms of which 1 ms to minimize.
[2023-03-18 00:19:57] [INFO ] Deduced a trap composed of 96 places in 6519 ms of which 1 ms to minimize.
[2023-03-18 00:20:05] [INFO ] Deduced a trap composed of 128 places in 6084 ms of which 2 ms to minimize.
[2023-03-18 00:20:12] [INFO ] Deduced a trap composed of 96 places in 5389 ms of which 0 ms to minimize.
[2023-03-18 00:20:18] [INFO ] Deduced a trap composed of 128 places in 4950 ms of which 1 ms to minimize.
[2023-03-18 00:20:18] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 67749 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 00:20:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 00:20:18] [INFO ] After 100030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2448 steps, run timeout after 3008 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 2448 steps, saw 2082 distinct states, run finished after 3009 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 00:20:22] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:20:22] [INFO ] Invariant cache hit.
[2023-03-18 00:20:23] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:20:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-03-18 00:20:43] [INFO ] After 20314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:20:44] [INFO ] State equation strengthened by 741 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 00:20:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 00:20:48] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1246 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1251 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1965 steps, run timeout after 3001 ms. (steps per millisecond=0 ) properties seen :{}
Probabilistic random walk after 1965 steps, saw 1673 distinct states, run finished after 3002 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 00:20:53] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:20:53] [INFO ] Invariant cache hit.
[2023-03-18 00:20:53] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:20:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-18 00:21:15] [INFO ] After 21723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:21:17] [INFO ] State equation strengthened by 741 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 00:21:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 00:21:18] [INFO ] After 25218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 2317 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2317 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1014 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 00:21:22] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:21:22] [INFO ] Invariant cache hit.
[2023-03-18 00:21:32] [INFO ] Implicit Places using invariants in 10447 ms returned []
Implicit Place search using SMT only with invariants took 10448 ms to find 0 implicit places.
[2023-03-18 00:21:32] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 00:21:32] [INFO ] Invariant cache hit.
[2023-03-18 00:22:02] [INFO ] Performed 86612/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 00:22:23] [INFO ] Dead Transitions using invariants and state equation in 50377 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61860 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Ensure Unique test removed 63131 transitions
Reduce isomorphic transitions removed 63131 transitions.
Iterating post reduction 0 with 63131 rules applied. Total rules applied 63131 place count 1380 transition count 81237
Applied a total of 63131 rules in 2966 ms. Remains 1380 /1380 variables (removed 0) and now considering 81237/144368 (removed 63131) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 00:22:26] [INFO ] Computed 19 place invariants in 412 ms
[2023-03-18 00:22:27] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:22:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-18 00:22:47] [INFO ] After 19766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:22:51] [INFO ] Deduced a trap composed of 72 places in 3536 ms of which 2 ms to minimize.
[2023-03-18 00:22:55] [INFO ] Deduced a trap composed of 128 places in 2939 ms of which 2 ms to minimize.
[2023-03-18 00:22:58] [INFO ] Deduced a trap composed of 128 places in 1913 ms of which 1 ms to minimize.
[2023-03-18 00:23:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 13734 ms
[2023-03-18 00:23:01] [INFO ] After 34206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1118 ms.
[2023-03-18 00:23:02] [INFO ] After 35506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-18 00:23:06] [INFO ] Flatten gal took : 3337 ms
[2023-03-18 00:23:11] [INFO ] Flatten gal took : 4485 ms
[2023-03-18 00:23:11] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9086413151073305674.gal : 529 ms
[2023-03-18 00:23:11] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16993699213999033104.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/ReachabilityFireability9086413151073305674.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16993699213999033104.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
Detected timeout of ITS tools.
[2023-03-18 00:23:19] [INFO ] Flatten gal took : 4514 ms
[2023-03-18 00:23:19] [INFO ] Applying decomposition
[2023-03-18 00:23:23] [INFO ] Flatten gal took : 3835 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/graph230041169131819593.txt' '-o' '/tmp/graph230041169131819593.bin' '-w' '/tmp/graph230041169131819593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph230041169131819593.bin' '-l' '-1' '-v' '-w' '/tmp/graph230041169131819593.weights' '-q' '0' '-e' '0.001'
[2023-03-18 00:23:31] [INFO ] Decomposing Gal with order
[2023-03-18 00:23:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 00:23:45] [INFO ] Removed a total of 435435 redundant transitions.
[2023-03-18 00:23:46] [INFO ] Flatten gal took : 8829 ms
[2023-03-18 00:24:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2910 labels/synchronizations in 18753 ms.
[2023-03-18 00:24:10] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability270180697823615016.gal : 328 ms
[2023-03-18 00:24:10] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13548658485989328769.prop : 0 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/ReachabilityFireability270180697823615016.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13548658485989328769.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 ...307
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2457716317558737397
[2023-03-18 00:24:14] [INFO ] Built C files in 977ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2457716317558737397
Running compilation step : cd /tmp/ltsmin2457716317558737397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2457716317558737397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' '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' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2457716317558737397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' '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' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 00:24:20] [INFO ] Flatten gal took : 3583 ms
[2023-03-18 00:24:24] [INFO ] Flatten gal took : 3353 ms
[2023-03-18 00:24:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15690222127482826612.gal : 484 ms
[2023-03-18 00:24:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12506874491091859643.prop : 0 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/ReachabilityFireability15690222127482826612.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12506874491091859643.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 ...330
Detected timeout of ITS tools.
[2023-03-18 00:24:59] [INFO ] Flatten gal took : 3584 ms
[2023-03-18 00:24:59] [INFO ] Applying decomposition
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 3147632 kB
After kill :
MemTotal: 16393216 kB
MemFree: 3907960 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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="RERS17pb115-PT-9"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 RERS17pb115-PT-9, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r339-tall-167889212000133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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