./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:25:19,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:25:20,073 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-23 22:25:20,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:25:20,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:25:20,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:25:20,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:25:20,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:25:20,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:25:20,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:25:20,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:25:20,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:25:20,113 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:25:20,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:25:20,114 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:25:20,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:25:20,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:25:20,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:25:20,118 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 22:25:20,119 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 22:25:20,120 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 22:25:20,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:25:20,122 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 22:25:20,122 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 22:25:20,123 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:25:20,124 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:25:20,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:25:20,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:25:20,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:25:20,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:25:20,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:25:20,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:25:20,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:25:20,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:25:20,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:25:20,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:25:20,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:25:20,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:25:20,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:25:20,132 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b [2023-11-23 22:25:20,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:25:20,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:25:20,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:25:20,423 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:25:20,423 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:25:20,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2023-11-23 22:25:23,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:25:23,794 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:25:23,794 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2023-11-23 22:25:23,813 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/data/baec84eef/71bef849eb8643a38f2844829e97d5df/FLAG14d5bad17 [2023-11-23 22:25:23,831 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/data/baec84eef/71bef849eb8643a38f2844829e97d5df [2023-11-23 22:25:23,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:25:23,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:25:23,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:25:23,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:25:23,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:25:23,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:25:23" (1/1) ... [2023-11-23 22:25:23,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6ad2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:23, skipping insertion in model container [2023-11-23 22:25:23,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:25:23" (1/1) ... [2023-11-23 22:25:23,905 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:25:24,151 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-23 22:25:24,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:25:24,388 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:25:24,409 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-23 22:25:24,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:25:24,495 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:25:24,495 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:25:24,495 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:25:24,504 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:25:24,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24 WrapperNode [2023-11-23 22:25:24,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:25:24,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:25:24,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:25:24,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:25:24,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24" (1/1) ... [2023-11-23 22:25:24,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24" (1/1) ... [2023-11-23 22:25:24,603 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2023-11-23 22:25:24,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:25:24,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:25:24,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:25:24,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:25:24,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24" (1/1) ... [2023-11-23 22:25:24,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24" (1/1) ... [2023-11-23 22:25:24,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24" (1/1) ... [2023-11-23 22:25:24,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24" (1/1) ... [2023-11-23 22:25:24,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24" (1/1) ... [2023-11-23 22:25:24,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24" (1/1) ... [2023-11-23 22:25:24,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24" (1/1) ... [2023-11-23 22:25:24,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24" (1/1) ... [2023-11-23 22:25:24,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:25:24,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:25:24,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:25:24,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:25:24,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24" (1/1) ... [2023-11-23 22:25:24,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:25:24,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:25:24,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:25:24,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1859472c-d20d-4bd3-aeb5-cadb32dff945/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:25:24,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 22:25:24,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 22:25:24,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 22:25:24,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:25:24,796 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-11-23 22:25:24,797 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-11-23 22:25:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:25:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:25:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 22:25:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 22:25:24,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:25:24,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:25:24,801 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-11-23 22:25:24,801 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-11-23 22:25:24,803 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 22:25:24,976 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:25:24,979 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:25:25,270 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:25:25,424 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:25:25,424 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 22:25:25,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:25 BoogieIcfgContainer [2023-11-23 22:25:25,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:25:25,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:25:25,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:25:25,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:25:25,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:25:23" (1/3) ... [2023-11-23 22:25:25,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b58c8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:25:25, skipping insertion in model container [2023-11-23 22:25:25,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:24" (2/3) ... [2023-11-23 22:25:25,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b58c8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:25:25, skipping insertion in model container [2023-11-23 22:25:25,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:25" (3/3) ... [2023-11-23 22:25:25,438 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2023-11-23 22:25:25,460 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:25:25,460 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-23 22:25:25,461 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 22:25:25,560 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-23 22:25:25,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 87 transitions, 202 flow [2023-11-23 22:25:25,701 INFO L124 PetriNetUnfolderBase]: 4/83 cut-off events. [2023-11-23 22:25:25,701 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-23 22:25:25,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 83 events. 4/83 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 190 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-11-23 22:25:25,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 87 transitions, 202 flow [2023-11-23 22:25:25,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 82 transitions, 188 flow [2023-11-23 22:25:25,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:25:25,736 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f7bcb79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:25:25,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-11-23 22:25:25,740 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 22:25:25,740 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-23 22:25:25,740 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:25:25,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:25,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 22:25:25,742 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:25,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash 8822, now seen corresponding path program 1 times [2023-11-23 22:25:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:25,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519513608] [2023-11-23 22:25:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:25,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:26,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519513608] [2023-11-23 22:25:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519513608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:26,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:26,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:25:26,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461354504] [2023-11-23 22:25:26,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:26,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:25:26,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:26,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:25:26,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:25:26,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2023-11-23 22:25:26,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:26,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:26,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2023-11-23 22:25:26,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:27,949 INFO L124 PetriNetUnfolderBase]: 3169/6129 cut-off events. [2023-11-23 22:25:27,950 INFO L125 PetriNetUnfolderBase]: For 415/416 co-relation queries the response was YES. [2023-11-23 22:25:28,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10847 conditions, 6129 events. 3169/6129 cut-off events. For 415/416 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 49046 event pairs, 3169 based on Foata normal form. 725/6362 useless extension candidates. Maximal degree in co-relation 9422. Up to 4426 conditions per place. [2023-11-23 22:25:28,157 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 28 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-23 22:25:28,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 74 transitions, 232 flow [2023-11-23 22:25:28,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:25:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:25:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-23 22:25:28,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-23 22:25:28,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-23 22:25:28,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-23 22:25:28,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:28,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-23 22:25:28,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:28,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:28,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:28,196 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 188 flow. Second operand 3 states and 186 transitions. [2023-11-23 22:25:28,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 74 transitions, 232 flow [2023-11-23 22:25:28,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 74 transitions, 216 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-23 22:25:28,212 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 160 flow [2023-11-23 22:25:28,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2023-11-23 22:25:28,220 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -10 predicate places. [2023-11-23 22:25:28,220 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 160 flow [2023-11-23 22:25:28,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:28,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:28,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 22:25:28,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:25:28,222 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:28,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash 8823, now seen corresponding path program 1 times [2023-11-23 22:25:28,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:28,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598109301] [2023-11-23 22:25:28,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:28,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:28,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:28,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598109301] [2023-11-23 22:25:28,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598109301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:28,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:28,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:25:28,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588222606] [2023-11-23 22:25:28,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:28,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:25:28,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:28,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:25:28,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:25:28,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-23 22:25:28,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:28,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:28,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-23 22:25:28,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:29,243 INFO L124 PetriNetUnfolderBase]: 2197/4338 cut-off events. [2023-11-23 22:25:29,243 INFO L125 PetriNetUnfolderBase]: For 124/148 co-relation queries the response was YES. [2023-11-23 22:25:29,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7549 conditions, 4338 events. 2197/4338 cut-off events. For 124/148 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 33055 event pairs, 2197 based on Foata normal form. 325/4344 useless extension candidates. Maximal degree in co-relation 7539. Up to 3129 conditions per place. [2023-11-23 22:25:29,291 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 26 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-23 22:25:29,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 212 flow [2023-11-23 22:25:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:25:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:25:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-23 22:25:29,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-23 22:25:29,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-23 22:25:29,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-23 22:25:29,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:29,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-23 22:25:29,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:29,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:29,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:29,300 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 160 flow. Second operand 3 states and 186 transitions. [2023-11-23 22:25:29,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 212 flow [2023-11-23 22:25:29,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:25:29,304 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 156 flow [2023-11-23 22:25:29,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=79, PETRI_TRANSITIONS=72} [2023-11-23 22:25:29,306 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -12 predicate places. [2023-11-23 22:25:29,306 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 156 flow [2023-11-23 22:25:29,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:29,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:29,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 22:25:29,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:25:29,308 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:29,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:29,309 INFO L85 PathProgramCache]: Analyzing trace with hash 263100769, now seen corresponding path program 1 times [2023-11-23 22:25:29,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:29,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478343239] [2023-11-23 22:25:29,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:29,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:29,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:29,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478343239] [2023-11-23 22:25:29,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478343239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:29,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:29,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:25:29,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313831639] [2023-11-23 22:25:29,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:29,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:25:29,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:29,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:25:29,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:25:29,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2023-11-23 22:25:29,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:29,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:29,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2023-11-23 22:25:29,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:30,322 INFO L124 PetriNetUnfolderBase]: 2451/4772 cut-off events. [2023-11-23 22:25:30,322 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2023-11-23 22:25:30,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8348 conditions, 4772 events. 2451/4772 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 36747 event pairs, 2451 based on Foata normal form. 0/4464 useless extension candidates. Maximal degree in co-relation 8338. Up to 3494 conditions per place. [2023-11-23 22:25:30,375 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 28 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-23 22:25:30,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 70 transitions, 212 flow [2023-11-23 22:25:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:25:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:25:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-11-23 22:25:30,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6973180076628352 [2023-11-23 22:25:30,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-11-23 22:25:30,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-11-23 22:25:30,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:30,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-11-23 22:25:30,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:30,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:30,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:30,385 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 156 flow. Second operand 3 states and 182 transitions. [2023-11-23 22:25:30,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 70 transitions, 212 flow [2023-11-23 22:25:30,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:25:30,389 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 152 flow [2023-11-23 22:25:30,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2023-11-23 22:25:30,391 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -14 predicate places. [2023-11-23 22:25:30,391 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 152 flow [2023-11-23 22:25:30,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:30,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:30,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 22:25:30,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:25:30,393 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:30,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash 263100770, now seen corresponding path program 1 times [2023-11-23 22:25:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:30,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112648199] [2023-11-23 22:25:30,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:30,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:30,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112648199] [2023-11-23 22:25:30,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112648199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:30,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:30,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:25:30,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719671681] [2023-11-23 22:25:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:30,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:25:30,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:30,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:25:30,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:25:30,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-23 22:25:30,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:30,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:30,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-23 22:25:30,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:31,305 INFO L124 PetriNetUnfolderBase]: 2197/4302 cut-off events. [2023-11-23 22:25:31,306 INFO L125 PetriNetUnfolderBase]: For 124/148 co-relation queries the response was YES. [2023-11-23 22:25:31,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7513 conditions, 4302 events. 2197/4302 cut-off events. For 124/148 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 32553 event pairs, 2197 based on Foata normal form. 93/4112 useless extension candidates. Maximal degree in co-relation 7503. Up to 3129 conditions per place. [2023-11-23 22:25:31,352 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 26 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-23 22:25:31,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 204 flow [2023-11-23 22:25:31,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:25:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:25:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-23 22:25:31,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-23 22:25:31,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-23 22:25:31,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-23 22:25:31,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:31,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-23 22:25:31,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:31,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:31,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:31,360 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 152 flow. Second operand 3 states and 186 transitions. [2023-11-23 22:25:31,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 204 flow [2023-11-23 22:25:31,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:25:31,364 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 148 flow [2023-11-23 22:25:31,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2023-11-23 22:25:31,367 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -16 predicate places. [2023-11-23 22:25:31,368 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 148 flow [2023-11-23 22:25:31,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:31,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:31,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:25:31,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:25:31,370 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:31,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash -280017888, now seen corresponding path program 1 times [2023-11-23 22:25:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:31,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583522506] [2023-11-23 22:25:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:31,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:31,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:31,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583522506] [2023-11-23 22:25:31,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583522506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:31,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:31,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:25:31,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339874259] [2023-11-23 22:25:31,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:31,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:25:31,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:31,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:25:31,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:25:31,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2023-11-23 22:25:31,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:31,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:31,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2023-11-23 22:25:31,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:32,217 INFO L124 PetriNetUnfolderBase]: 2251/4344 cut-off events. [2023-11-23 22:25:32,217 INFO L125 PetriNetUnfolderBase]: For 118/142 co-relation queries the response was YES. [2023-11-23 22:25:32,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7645 conditions, 4344 events. 2251/4344 cut-off events. For 118/142 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 33130 event pairs, 2251 based on Foata normal form. 0/4106 useless extension candidates. Maximal degree in co-relation 7635. Up to 3219 conditions per place. [2023-11-23 22:25:32,263 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 28 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-23 22:25:32,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 204 flow [2023-11-23 22:25:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:25:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:25:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-11-23 22:25:32,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6973180076628352 [2023-11-23 22:25:32,272 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-11-23 22:25:32,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-11-23 22:25:32,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:32,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-11-23 22:25:32,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:32,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:32,276 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:32,276 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 148 flow. Second operand 3 states and 182 transitions. [2023-11-23 22:25:32,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 204 flow [2023-11-23 22:25:32,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 66 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:25:32,279 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 144 flow [2023-11-23 22:25:32,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2023-11-23 22:25:32,283 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -18 predicate places. [2023-11-23 22:25:32,283 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 144 flow [2023-11-23 22:25:32,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:32,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:32,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:25:32,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:25:32,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:32,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash -280017887, now seen corresponding path program 1 times [2023-11-23 22:25:32,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:32,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880982878] [2023-11-23 22:25:32,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:32,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:32,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:32,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880982878] [2023-11-23 22:25:32,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880982878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:32,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:32,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:25:32,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294586330] [2023-11-23 22:25:32,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:32,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:25:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:32,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:25:32,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:25:32,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-23 22:25:32,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:32,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:32,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-23 22:25:32,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:33,105 INFO L124 PetriNetUnfolderBase]: 2197/4260 cut-off events. [2023-11-23 22:25:33,105 INFO L125 PetriNetUnfolderBase]: For 124/148 co-relation queries the response was YES. [2023-11-23 22:25:33,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7471 conditions, 4260 events. 2197/4260 cut-off events. For 124/148 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 32189 event pairs, 2197 based on Foata normal form. 36/4055 useless extension candidates. Maximal degree in co-relation 7461. Up to 3129 conditions per place. [2023-11-23 22:25:33,137 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 26 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-23 22:25:33,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 196 flow [2023-11-23 22:25:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:25:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:25:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-23 22:25:33,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-23 22:25:33,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-23 22:25:33,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-23 22:25:33,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:33,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-23 22:25:33,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:33,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:33,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:33,144 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 144 flow. Second operand 3 states and 186 transitions. [2023-11-23 22:25:33,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 196 flow [2023-11-23 22:25:33,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 64 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:25:33,151 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 140 flow [2023-11-23 22:25:33,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2023-11-23 22:25:33,155 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -20 predicate places. [2023-11-23 22:25:33,155 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 140 flow [2023-11-23 22:25:33,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:33,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:33,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:25:33,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:25:33,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:33,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:33,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1186125515, now seen corresponding path program 1 times [2023-11-23 22:25:33,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:33,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107301342] [2023-11-23 22:25:33,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:33,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:33,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:33,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107301342] [2023-11-23 22:25:33,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107301342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:33,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:33,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:25:33,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389536214] [2023-11-23 22:25:33,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:33,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:25:33,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:33,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:25:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:25:33,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2023-11-23 22:25:33,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:33,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:33,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2023-11-23 22:25:33,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:33,822 INFO L124 PetriNetUnfolderBase]: 2319/4340 cut-off events. [2023-11-23 22:25:33,823 INFO L125 PetriNetUnfolderBase]: For 123/147 co-relation queries the response was YES. [2023-11-23 22:25:33,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7733 conditions, 4340 events. 2319/4340 cut-off events. For 123/147 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 32124 event pairs, 2319 based on Foata normal form. 0/4180 useless extension candidates. Maximal degree in co-relation 7723. Up to 3311 conditions per place. [2023-11-23 22:25:33,867 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 28 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-23 22:25:33,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 62 transitions, 196 flow [2023-11-23 22:25:33,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:25:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:25:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-11-23 22:25:33,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6973180076628352 [2023-11-23 22:25:33,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-11-23 22:25:33,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-11-23 22:25:33,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:33,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-11-23 22:25:33,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:33,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:33,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:33,873 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 140 flow. Second operand 3 states and 182 transitions. [2023-11-23 22:25:33,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 62 transitions, 196 flow [2023-11-23 22:25:33,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:25:33,880 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 136 flow [2023-11-23 22:25:33,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2023-11-23 22:25:33,881 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -22 predicate places. [2023-11-23 22:25:33,882 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 136 flow [2023-11-23 22:25:33,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:33,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:33,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:25:33,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 22:25:33,883 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:33,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:33,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1186125514, now seen corresponding path program 1 times [2023-11-23 22:25:33,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:33,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683328136] [2023-11-23 22:25:33,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:33,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:34,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:34,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683328136] [2023-11-23 22:25:34,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683328136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:34,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:34,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:25:34,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965555229] [2023-11-23 22:25:34,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:34,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:25:34,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:34,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:25:34,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:25:34,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-23 22:25:34,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:34,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:34,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-23 22:25:34,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:34,747 INFO L124 PetriNetUnfolderBase]: 2197/4158 cut-off events. [2023-11-23 22:25:34,747 INFO L125 PetriNetUnfolderBase]: For 124/148 co-relation queries the response was YES. [2023-11-23 22:25:34,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7369 conditions, 4158 events. 2197/4158 cut-off events. For 124/148 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 30835 event pairs, 2197 based on Foata normal form. 60/4079 useless extension candidates. Maximal degree in co-relation 7359. Up to 3129 conditions per place. [2023-11-23 22:25:34,784 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 26 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-23 22:25:34,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 60 transitions, 188 flow [2023-11-23 22:25:34,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:25:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:25:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-23 22:25:34,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-23 22:25:34,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-23 22:25:34,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-23 22:25:34,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:34,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-23 22:25:34,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:34,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:34,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:34,795 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 136 flow. Second operand 3 states and 186 transitions. [2023-11-23 22:25:34,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 60 transitions, 188 flow [2023-11-23 22:25:34,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 60 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:25:34,798 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 132 flow [2023-11-23 22:25:34,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2023-11-23 22:25:34,801 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -24 predicate places. [2023-11-23 22:25:34,802 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 132 flow [2023-11-23 22:25:34,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:34,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:34,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:25:34,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 22:25:34,803 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:34,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1887044038, now seen corresponding path program 1 times [2023-11-23 22:25:34,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:34,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646766235] [2023-11-23 22:25:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:34,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:34,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646766235] [2023-11-23 22:25:34,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646766235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:34,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:34,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:25:34,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199403227] [2023-11-23 22:25:34,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:34,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:25:34,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:34,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:25:34,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:25:34,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2023-11-23 22:25:34,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 132 flow. Second operand has 6 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:34,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:34,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2023-11-23 22:25:34,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:38,777 INFO L124 PetriNetUnfolderBase]: 17416/28361 cut-off events. [2023-11-23 22:25:38,778 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2023-11-23 22:25:38,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52907 conditions, 28361 events. 17416/28361 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 230036 event pairs, 1911 based on Foata normal form. 0/27787 useless extension candidates. Maximal degree in co-relation 52885. Up to 7302 conditions per place. [2023-11-23 22:25:39,001 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 177 selfloop transitions, 29 changer transitions 0/230 dead transitions. [2023-11-23 22:25:39,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 230 transitions, 920 flow [2023-11-23 22:25:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 22:25:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-23 22:25:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 715 transitions. [2023-11-23 22:25:39,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2023-11-23 22:25:39,008 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 715 transitions. [2023-11-23 22:25:39,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 715 transitions. [2023-11-23 22:25:39,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:39,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 715 transitions. [2023-11-23 22:25:39,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 65.0) internal successors, (715), 11 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:39,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 87.0) internal successors, (1044), 12 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:39,017 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 87.0) internal successors, (1044), 12 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:39,017 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 132 flow. Second operand 11 states and 715 transitions. [2023-11-23 22:25:39,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 230 transitions, 920 flow [2023-11-23 22:25:39,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 230 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:25:39,026 INFO L231 Difference]: Finished difference. Result has 83 places, 91 transitions, 330 flow [2023-11-23 22:25:39,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=330, PETRI_PLACES=83, PETRI_TRANSITIONS=91} [2023-11-23 22:25:39,028 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -8 predicate places. [2023-11-23 22:25:39,029 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 91 transitions, 330 flow [2023-11-23 22:25:39,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.833333333333336) internal successors, (287), 6 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:39,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:39,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:25:39,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 22:25:39,030 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:39,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:39,031 INFO L85 PathProgramCache]: Analyzing trace with hash -125491707, now seen corresponding path program 1 times [2023-11-23 22:25:39,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:39,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584189921] [2023-11-23 22:25:39,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:39,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:39,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:39,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584189921] [2023-11-23 22:25:39,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584189921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:39,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:39,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:25:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773623174] [2023-11-23 22:25:39,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:39,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:25:39,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:39,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:25:39,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:25:39,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-23 22:25:39,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 91 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:39,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:39,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-23 22:25:39,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:41,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [8#L748-4true, 88#L721true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,425 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-23 22:25:41,425 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-23 22:25:41,426 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-23 22:25:41,563 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-23 22:25:41,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 8#L748-4true, 88#L721true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,680 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,680 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,680 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,680 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [88#L721true, 6#L749true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,716 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,716 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,717 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,717 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [8#L748-4true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,719 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,719 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,720 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,720 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [8#L748-4true, 33#L740true, 88#L721true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,722 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,722 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,722 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,723 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:25:41,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 88#L721true, 6#L749true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,791 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,792 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,792 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,792 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 8#L748-4true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,796 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,796 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,796 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,796 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 8#L748-4true, 33#L740true, 88#L721true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,798 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,798 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,798 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,798 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [6#L749true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,829 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,830 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,830 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,830 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [33#L740true, 88#L721true, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,831 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,832 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,832 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,832 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [8#L748-4true, 33#L740true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,835 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,835 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,835 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,836 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [8#L748-4true, 88#L721true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,838 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,838 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,838 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,838 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:25:41,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 6#L749true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,894 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,894 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,895 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,895 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 33#L740true, 88#L721true, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,897 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,897 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,897 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,897 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 8#L748-4true, 33#L740true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,902 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,902 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,902 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,903 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,904 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 8#L748-4true, 88#L721true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,904 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,905 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,905 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,905 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,934 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [33#L740true, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,935 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,935 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,935 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,935 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [88#L721true, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,937 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,937 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,938 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,938 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [8#L748-4true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,941 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,941 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,941 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,941 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:25:41,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [88#L721true, 79#L749-2true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,980 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,980 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,981 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,981 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 33#L740true, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,983 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,983 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,983 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,984 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 88#L721true, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,985 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,986 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,986 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,986 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 8#L748-4true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:41,990 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,990 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,990 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:41,991 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:42,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 40#L721true, 39#readerEXITtrue, Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, 48#writerEXITtrue, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:42,016 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-23 22:25:42,016 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:42,016 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:42,016 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 22:25:42,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [79#L749-2true, 66#L740true, 43#L16true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:42,136 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-23 22:25:42,137 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-23 22:25:42,137 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-23 22:25:42,137 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-23 22:25:42,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [33#L740true, 88#L721true, 79#L749-2true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:42,138 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-23 22:25:42,138 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-23 22:25:42,138 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-23 22:25:42,139 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-23 22:25:42,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [42#writerEXITtrue, 6#L749true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:42,141 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-23 22:25:42,141 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-23 22:25:42,141 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-23 22:25:42,141 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-23 22:25:42,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [33#L740true, 79#L749-2true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:42,181 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-23 22:25:42,181 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-23 22:25:42,181 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-23 22:25:42,181 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-23 22:25:42,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [88#L721true, 79#L749-2true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:42,184 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-23 22:25:42,184 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-23 22:25:42,184 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-23 22:25:42,184 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-23 22:25:42,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [79#L749-2true, 66#L740true, 158#true, 136#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), Black: 146#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), 39#readerEXITtrue, Black: 140#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 138#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 131#true, Black: 133#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 48#writerEXITtrue, Black: 144#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 142#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|))]) [2023-11-23 22:25:42,200 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-23 22:25:42,200 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-23 22:25:42,200 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-23 22:25:42,200 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-23 22:25:42,250 INFO L124 PetriNetUnfolderBase]: 11112/19773 cut-off events. [2023-11-23 22:25:42,250 INFO L125 PetriNetUnfolderBase]: For 6387/6809 co-relation queries the response was YES. [2023-11-23 22:25:42,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40735 conditions, 19773 events. 11112/19773 cut-off events. For 6387/6809 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 172252 event pairs, 4354 based on Foata normal form. 1098/20140 useless extension candidates. Maximal degree in co-relation 30925. Up to 8378 conditions per place. [2023-11-23 22:25:42,448 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 45 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2023-11-23 22:25:42,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 110 transitions, 477 flow [2023-11-23 22:25:42,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:25:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:25:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2023-11-23 22:25:42,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8007662835249042 [2023-11-23 22:25:42,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 209 transitions. [2023-11-23 22:25:42,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 209 transitions. [2023-11-23 22:25:42,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:42,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 209 transitions. [2023-11-23 22:25:42,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:42,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:42,454 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:42,454 INFO L175 Difference]: Start difference. First operand has 83 places, 91 transitions, 330 flow. Second operand 3 states and 209 transitions. [2023-11-23 22:25:42,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 110 transitions, 477 flow [2023-11-23 22:25:42,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 110 transitions, 477 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 22:25:42,668 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 346 flow [2023-11-23 22:25:42,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2023-11-23 22:25:42,671 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2023-11-23 22:25:42,671 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 346 flow [2023-11-23 22:25:42,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:42,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:42,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:25:42,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 22:25:42,672 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:42,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:42,673 INFO L85 PathProgramCache]: Analyzing trace with hash 499745941, now seen corresponding path program 2 times [2023-11-23 22:25:42,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:42,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674653977] [2023-11-23 22:25:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:42,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:42,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674653977] [2023-11-23 22:25:42,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674653977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:42,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:42,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:25:42,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256220414] [2023-11-23 22:25:42,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:42,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:25:42,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:42,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:25:42,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:25:42,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2023-11-23 22:25:42,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:42,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:42,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2023-11-23 22:25:42,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:44,760 INFO L124 PetriNetUnfolderBase]: 6471/12753 cut-off events. [2023-11-23 22:25:44,760 INFO L125 PetriNetUnfolderBase]: For 6339/6493 co-relation queries the response was YES. [2023-11-23 22:25:44,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27605 conditions, 12753 events. 6471/12753 cut-off events. For 6339/6493 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 113213 event pairs, 1785 based on Foata normal form. 305/12758 useless extension candidates. Maximal degree in co-relation 21660. Up to 4100 conditions per place. [2023-11-23 22:25:44,890 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 63 selfloop transitions, 9 changer transitions 0/135 dead transitions. [2023-11-23 22:25:44,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 135 transitions, 615 flow [2023-11-23 22:25:44,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:25:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 22:25:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2023-11-23 22:25:44,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-23 22:25:44,894 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 290 transitions. [2023-11-23 22:25:44,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 290 transitions. [2023-11-23 22:25:44,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:44,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 290 transitions. [2023-11-23 22:25:44,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:44,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:44,898 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:44,898 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 346 flow. Second operand 4 states and 290 transitions. [2023-11-23 22:25:44,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 135 transitions, 615 flow [2023-11-23 22:25:45,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 135 transitions, 603 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:25:45,035 INFO L231 Difference]: Finished difference. Result has 90 places, 99 transitions, 412 flow [2023-11-23 22:25:45,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=412, PETRI_PLACES=90, PETRI_TRANSITIONS=99} [2023-11-23 22:25:45,037 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -1 predicate places. [2023-11-23 22:25:45,037 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 99 transitions, 412 flow [2023-11-23 22:25:45,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:45,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:45,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:25:45,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 22:25:45,038 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:45,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash 999911387, now seen corresponding path program 1 times [2023-11-23 22:25:45,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:45,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174140205] [2023-11-23 22:25:45,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:45,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:45,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:45,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174140205] [2023-11-23 22:25:45,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174140205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:45,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:45,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:25:45,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764096685] [2023-11-23 22:25:45,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:45,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:25:45,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:45,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:25:45,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:25:45,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2023-11-23 22:25:45,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 99 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:45,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:45,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2023-11-23 22:25:45,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:49,034 INFO L124 PetriNetUnfolderBase]: 14821/24540 cut-off events. [2023-11-23 22:25:49,035 INFO L125 PetriNetUnfolderBase]: For 21781/22226 co-relation queries the response was YES. [2023-11-23 22:25:49,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62250 conditions, 24540 events. 14821/24540 cut-off events. For 21781/22226 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 191928 event pairs, 2414 based on Foata normal form. 384/24628 useless extension candidates. Maximal degree in co-relation 52864. Up to 5433 conditions per place. [2023-11-23 22:25:49,230 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 207 selfloop transitions, 63 changer transitions 0/300 dead transitions. [2023-11-23 22:25:49,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 300 transitions, 1822 flow [2023-11-23 22:25:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 22:25:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-23 22:25:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 700 transitions. [2023-11-23 22:25:49,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7314524555903866 [2023-11-23 22:25:49,235 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 700 transitions. [2023-11-23 22:25:49,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 700 transitions. [2023-11-23 22:25:49,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:49,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 700 transitions. [2023-11-23 22:25:49,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 63.63636363636363) internal successors, (700), 11 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:49,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 87.0) internal successors, (1044), 12 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:49,249 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 87.0) internal successors, (1044), 12 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:49,249 INFO L175 Difference]: Start difference. First operand has 90 places, 99 transitions, 412 flow. Second operand 11 states and 700 transitions. [2023-11-23 22:25:49,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 300 transitions, 1822 flow [2023-11-23 22:25:49,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 300 transitions, 1822 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-23 22:25:49,695 INFO L231 Difference]: Finished difference. Result has 108 places, 152 transitions, 972 flow [2023-11-23 22:25:49,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=972, PETRI_PLACES=108, PETRI_TRANSITIONS=152} [2023-11-23 22:25:49,697 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 17 predicate places. [2023-11-23 22:25:49,697 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 152 transitions, 972 flow [2023-11-23 22:25:49,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:49,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:49,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:25:49,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 22:25:49,698 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:49,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:49,699 INFO L85 PathProgramCache]: Analyzing trace with hash -801973724, now seen corresponding path program 1 times [2023-11-23 22:25:49,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:49,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210684189] [2023-11-23 22:25:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:49,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:49,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210684189] [2023-11-23 22:25:49,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210684189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:49,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:49,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:25:49,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223749365] [2023-11-23 22:25:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:49,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:25:49,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:49,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:25:49,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:25:49,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2023-11-23 22:25:49,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 152 transitions, 972 flow. Second operand has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:49,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:49,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2023-11-23 22:25:49,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:53,977 INFO L124 PetriNetUnfolderBase]: 14830/24411 cut-off events. [2023-11-23 22:25:53,977 INFO L125 PetriNetUnfolderBase]: For 37728/37951 co-relation queries the response was YES. [2023-11-23 22:25:54,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72037 conditions, 24411 events. 14830/24411 cut-off events. For 37728/37951 co-relation queries the response was YES. Maximal size of possible extension queue 1230. Compared 188677 event pairs, 2456 based on Foata normal form. 322/24625 useless extension candidates. Maximal degree in co-relation 63196. Up to 6364 conditions per place. [2023-11-23 22:25:54,242 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 186 selfloop transitions, 76 changer transitions 0/292 dead transitions. [2023-11-23 22:25:54,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 292 transitions, 2165 flow [2023-11-23 22:25:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 22:25:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-23 22:25:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 629 transitions. [2023-11-23 22:25:54,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7229885057471265 [2023-11-23 22:25:54,247 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 629 transitions. [2023-11-23 22:25:54,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 629 transitions. [2023-11-23 22:25:54,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:54,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 629 transitions. [2023-11-23 22:25:54,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 62.9) internal successors, (629), 10 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:54,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:54,256 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:54,257 INFO L175 Difference]: Start difference. First operand has 108 places, 152 transitions, 972 flow. Second operand 10 states and 629 transitions. [2023-11-23 22:25:54,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 292 transitions, 2165 flow [2023-11-23 22:25:55,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 292 transitions, 2163 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-23 22:25:55,415 INFO L231 Difference]: Finished difference. Result has 122 places, 169 transitions, 1369 flow [2023-11-23 22:25:55,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1369, PETRI_PLACES=122, PETRI_TRANSITIONS=169} [2023-11-23 22:25:55,416 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 31 predicate places. [2023-11-23 22:25:55,417 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 169 transitions, 1369 flow [2023-11-23 22:25:55,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:55,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:25:55,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:25:55,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 22:25:55,418 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:25:55,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:25:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash -736272165, now seen corresponding path program 1 times [2023-11-23 22:25:55,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:25:55,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571638880] [2023-11-23 22:25:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:25:55,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:25:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:25:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:25:55,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:25:55,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571638880] [2023-11-23 22:25:55,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571638880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:25:55,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:25:55,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:25:55,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731145550] [2023-11-23 22:25:55,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:25:55,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:25:55,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:25:55,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:25:55,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:25:55,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2023-11-23 22:25:55,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 169 transitions, 1369 flow. Second operand has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:55,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:25:55,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2023-11-23 22:25:55,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:25:59,701 INFO L124 PetriNetUnfolderBase]: 14937/24284 cut-off events. [2023-11-23 22:25:59,702 INFO L125 PetriNetUnfolderBase]: For 57606/58132 co-relation queries the response was YES. [2023-11-23 22:25:59,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75504 conditions, 24284 events. 14937/24284 cut-off events. For 57606/58132 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 183561 event pairs, 2311 based on Foata normal form. 547/24742 useless extension candidates. Maximal degree in co-relation 68103. Up to 6140 conditions per place. [2023-11-23 22:25:59,952 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 199 selfloop transitions, 86 changer transitions 0/321 dead transitions. [2023-11-23 22:25:59,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 321 transitions, 2679 flow [2023-11-23 22:25:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 22:25:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-23 22:25:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 639 transitions. [2023-11-23 22:25:59,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7344827586206897 [2023-11-23 22:25:59,960 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 639 transitions. [2023-11-23 22:25:59,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 639 transitions. [2023-11-23 22:25:59,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:25:59,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 639 transitions. [2023-11-23 22:25:59,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 63.9) internal successors, (639), 10 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:59,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:59,968 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 87.0) internal successors, (957), 11 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:25:59,968 INFO L175 Difference]: Start difference. First operand has 122 places, 169 transitions, 1369 flow. Second operand 10 states and 639 transitions. [2023-11-23 22:25:59,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 321 transitions, 2679 flow [2023-11-23 22:26:01,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 321 transitions, 2670 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-23 22:26:01,618 INFO L231 Difference]: Finished difference. Result has 135 places, 187 transitions, 1838 flow [2023-11-23 22:26:01,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1838, PETRI_PLACES=135, PETRI_TRANSITIONS=187} [2023-11-23 22:26:01,620 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 44 predicate places. [2023-11-23 22:26:01,620 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 187 transitions, 1838 flow [2023-11-23 22:26:01,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.0) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:26:01,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:26:01,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:26:01,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 22:26:01,621 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:26:01,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:26:01,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1982938215, now seen corresponding path program 1 times [2023-11-23 22:26:01,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:26:01,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938194368] [2023-11-23 22:26:01,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:26:01,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:26:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:26:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:26:01,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:26:01,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938194368] [2023-11-23 22:26:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938194368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:26:01,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:26:01,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:26:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752203706] [2023-11-23 22:26:01,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:26:01,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:26:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:26:01,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:26:01,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:26:01,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2023-11-23 22:26:01,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 187 transitions, 1838 flow. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:26:01,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:26:01,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2023-11-23 22:26:01,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:26:04,657 INFO L124 PetriNetUnfolderBase]: 6948/14527 cut-off events. [2023-11-23 22:26:04,657 INFO L125 PetriNetUnfolderBase]: For 39061/39804 co-relation queries the response was YES. [2023-11-23 22:26:04,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44532 conditions, 14527 events. 6948/14527 cut-off events. For 39061/39804 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 136860 event pairs, 2036 based on Foata normal form. 746/15072 useless extension candidates. Maximal degree in co-relation 42775. Up to 3935 conditions per place. [2023-11-23 22:26:04,823 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 61 selfloop transitions, 15 changer transitions 0/197 dead transitions. [2023-11-23 22:26:04,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 197 transitions, 1622 flow [2023-11-23 22:26:04,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:26:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 22:26:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 346 transitions. [2023-11-23 22:26:04,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7954022988505747 [2023-11-23 22:26:04,825 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 346 transitions. [2023-11-23 22:26:04,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 346 transitions. [2023-11-23 22:26:04,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:26:04,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 346 transitions. [2023-11-23 22:26:04,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:26:04,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:26:04,829 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:26:04,829 INFO L175 Difference]: Start difference. First operand has 135 places, 187 transitions, 1838 flow. Second operand 5 states and 346 transitions. [2023-11-23 22:26:04,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 197 transitions, 1622 flow [2023-11-23 22:26:05,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 197 transitions, 1511 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-11-23 22:26:05,372 INFO L231 Difference]: Finished difference. Result has 133 places, 163 transitions, 1327 flow [2023-11-23 22:26:05,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1327, PETRI_PLACES=133, PETRI_TRANSITIONS=163} [2023-11-23 22:26:05,373 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 42 predicate places. [2023-11-23 22:26:05,374 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 163 transitions, 1327 flow [2023-11-23 22:26:05,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:26:05,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:26:05,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:26:05,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 22:26:05,375 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:26:05,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:26:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1844445949, now seen corresponding path program 2 times [2023-11-23 22:26:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:26:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325244586] [2023-11-23 22:26:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:26:05,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:26:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:26:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:26:05,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:26:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325244586] [2023-11-23 22:26:05,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325244586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:26:05,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:26:05,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:26:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926061274] [2023-11-23 22:26:05,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:26:05,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:26:05,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:26:05,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:26:05,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:26:05,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2023-11-23 22:26:05,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 163 transitions, 1327 flow. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:26:05,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:26:05,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2023-11-23 22:26:05,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:26:07,365 INFO L124 PetriNetUnfolderBase]: 4963/10484 cut-off events. [2023-11-23 22:26:07,365 INFO L125 PetriNetUnfolderBase]: For 23929/24612 co-relation queries the response was YES. [2023-11-23 22:26:07,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33221 conditions, 10484 events. 4963/10484 cut-off events. For 23929/24612 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 92075 event pairs, 1191 based on Foata normal form. 527/10922 useless extension candidates. Maximal degree in co-relation 32501. Up to 2755 conditions per place. [2023-11-23 22:26:07,477 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 63 selfloop transitions, 17 changer transitions 0/161 dead transitions. [2023-11-23 22:26:07,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 161 transitions, 1152 flow [2023-11-23 22:26:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:26:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 22:26:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 348 transitions. [2023-11-23 22:26:07,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8 [2023-11-23 22:26:07,479 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 348 transitions. [2023-11-23 22:26:07,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 348 transitions. [2023-11-23 22:26:07,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:26:07,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 348 transitions. [2023-11-23 22:26:07,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:26:07,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:26:07,483 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:26:07,483 INFO L175 Difference]: Start difference. First operand has 133 places, 163 transitions, 1327 flow. Second operand 5 states and 348 transitions. [2023-11-23 22:26:07,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 161 transitions, 1152 flow [2023-11-23 22:26:07,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 161 transitions, 1008 flow, removed 12 selfloop flow, removed 19 redundant places. [2023-11-23 22:26:07,659 INFO L231 Difference]: Finished difference. Result has 112 places, 121 transitions, 787 flow [2023-11-23 22:26:07,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=787, PETRI_PLACES=112, PETRI_TRANSITIONS=121} [2023-11-23 22:26:07,660 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 21 predicate places. [2023-11-23 22:26:07,660 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 121 transitions, 787 flow [2023-11-23 22:26:07,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:26:07,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:26:07,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:26:07,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 22:26:07,661 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-23 22:26:07,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:26:07,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1633202971, now seen corresponding path program 1 times [2023-11-23 22:26:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:26:07,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882529860] [2023-11-23 22:26:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:26:07,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:26:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:26:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:26:08,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:26:08,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882529860] [2023-11-23 22:26:08,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882529860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:26:08,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:26:08,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:26:08,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282313521] [2023-11-23 22:26:08,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:26:08,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:26:08,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:26:08,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:26:08,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:26:08,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 87 [2023-11-23 22:26:08,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 121 transitions, 787 flow. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:26:08,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:26:08,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 87 [2023-11-23 22:26:08,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand