./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 0e0057cc 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_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/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_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI --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.4-dev-0e0057c [2023-11-24 21:48:57,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:48:57,095 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:48:57,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:48:57,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:48:57,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:48:57,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:48:57,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:48:57,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:48:57,164 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:48:57,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:48:57,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:48:57,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:48:57,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:48:57,169 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:48:57,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:48:57,170 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:48:57,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:48:57,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:48:57,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:48:57,172 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:48:57,173 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:48:57,173 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:48:57,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:48:57,174 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:48:57,175 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:48:57,175 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:48:57,176 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:48:57,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:48:57,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:48:57,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:48:57,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:48:57,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:48:57,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:48:57,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:48:57,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:48:57,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:48:57,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:48:57,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:48:57,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:48:57,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:48:57,183 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_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/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_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI 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-24 21:48:57,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:48:57,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:48:57,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:48:57,513 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:48:57,513 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:48:57,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2023-11-24 21:49:00,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:49:01,069 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:49:01,070 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2023-11-24 21:49:01,087 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/data/4a40c9851/819dd01ecdde4a50a0120c91522bb8ef/FLAG5c81cabe1 [2023-11-24 21:49:01,103 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/data/4a40c9851/819dd01ecdde4a50a0120c91522bb8ef [2023-11-24 21:49:01,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:49:01,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:49:01,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:49:01,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:49:01,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:49:01,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211ae382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01, skipping insertion in model container [2023-11-24 21:49:01,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,172 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:49:01,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:49:01,547 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:49:01,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:49:01,629 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:49:01,629 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:49:01,637 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:49:01,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01 WrapperNode [2023-11-24 21:49:01,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:49:01,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:49:01,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:49:01,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:49:01,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,689 INFO L138 Inliner]: procedures = 174, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2023-11-24 21:49:01,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:49:01,690 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:49:01,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:49:01,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:49:01,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,722 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-24 21:49:01,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:49:01,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:49:01,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:49:01,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:49:01,743 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (1/1) ... [2023-11-24 21:49:01,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:49:01,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:49:01,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:49:01,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:49:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 21:49:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 21:49:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-24 21:49:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-24 21:49:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-24 21:49:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:49:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:49:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:49:01,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:49:01,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-24 21:49:01,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:49:01,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:49:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-11-24 21:49:01,819 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-11-24 21:49:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:49:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:49:01,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:49:01,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:49:01,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:49:01,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:49:01,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-24 21:49:01,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:49:01,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:49:01,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:49:01,822 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-11-24 21:49:01,822 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-11-24 21:49:01,824 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:49:01,985 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:49:01,987 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:49:02,306 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:49:02,469 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:49:02,469 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:49:02,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:02 BoogieIcfgContainer [2023-11-24 21:49:02,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:49:02,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:49:02,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:49:02,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:49:02,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:49:01" (1/3) ... [2023-11-24 21:49:02,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297e70b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:49:02, skipping insertion in model container [2023-11-24 21:49:02,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:49:01" (2/3) ... [2023-11-24 21:49:02,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297e70b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:49:02, skipping insertion in model container [2023-11-24 21:49:02,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:02" (3/3) ... [2023-11-24 21:49:02,486 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2023-11-24 21:49:02,504 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:49:02,504 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-24 21:49:02,504 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:49:02,586 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-24 21:49:02,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 87 transitions, 202 flow [2023-11-24 21:49:02,673 INFO L124 PetriNetUnfolderBase]: 4/83 cut-off events. [2023-11-24 21:49:02,673 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-24 21:49:02,678 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-24 21:49:02,678 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 87 transitions, 202 flow [2023-11-24 21:49:02,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 82 transitions, 188 flow [2023-11-24 21:49:02,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:49:02,702 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;@46bf921b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:49:02,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-11-24 21:49:02,706 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:49:02,706 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:49:02,706 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:49:02,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:02,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:49:02,708 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-24 21:49:02,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:02,714 INFO L85 PathProgramCache]: Analyzing trace with hash 8822, now seen corresponding path program 1 times [2023-11-24 21:49:02,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:02,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221862506] [2023-11-24 21:49:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:02,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:03,231 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-24 21:49:03,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:03,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221862506] [2023-11-24 21:49:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221862506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:03,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:03,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:03,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424469469] [2023-11-24 21:49:03,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:03,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:03,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:03,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:03,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2023-11-24 21:49:03,322 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-24 21:49:03,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:03,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2023-11-24 21:49:03,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:04,458 INFO L124 PetriNetUnfolderBase]: 3169/6129 cut-off events. [2023-11-24 21:49:04,459 INFO L125 PetriNetUnfolderBase]: For 414/415 co-relation queries the response was YES. [2023-11-24 21:49:04,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10847 conditions, 6129 events. 3169/6129 cut-off events. For 414/415 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-24 21:49:04,535 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 28 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-24 21:49:04,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 74 transitions, 232 flow [2023-11-24 21:49:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-24 21:49:04,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-24 21:49:04,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-24 21:49:04,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-24 21:49:04,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:04,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-24 21:49:04,561 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-24 21:49:04,564 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-24 21:49:04,565 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-24 21:49:04,567 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 188 flow. Second operand 3 states and 186 transitions. [2023-11-24 21:49:04,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 74 transitions, 232 flow [2023-11-24 21:49:04,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 74 transitions, 216 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-24 21:49:04,592 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 160 flow [2023-11-24 21:49:04,594 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-24 21:49:04,600 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -10 predicate places. [2023-11-24 21:49:04,600 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 160 flow [2023-11-24 21:49:04,601 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-24 21:49:04,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:04,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:49:04,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:49:04,602 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-24 21:49:04,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash 8823, now seen corresponding path program 1 times [2023-11-24 21:49:04,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:04,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809121939] [2023-11-24 21:49:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:04,843 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-24 21:49:04,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:04,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809121939] [2023-11-24 21:49:04,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809121939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:04,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:04,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:04,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40910780] [2023-11-24 21:49:04,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:04,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:04,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:04,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:04,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:04,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-24 21:49:04,893 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-24 21:49:04,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:04,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-24 21:49:04,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:05,450 INFO L124 PetriNetUnfolderBase]: 2197/4338 cut-off events. [2023-11-24 21:49:05,451 INFO L125 PetriNetUnfolderBase]: For 124/148 co-relation queries the response was YES. [2023-11-24 21:49:05,462 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-24 21:49:05,494 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 26 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-24 21:49:05,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 72 transitions, 212 flow [2023-11-24 21:49:05,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-24 21:49:05,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-24 21:49:05,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-24 21:49:05,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-24 21:49:05,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:05,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-24 21:49:05,510 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-24 21:49:05,513 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-24 21:49:05,514 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-24 21:49:05,514 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 160 flow. Second operand 3 states and 186 transitions. [2023-11-24 21:49:05,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 72 transitions, 212 flow [2023-11-24 21:49:05,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:05,520 INFO L231 Difference]: Finished difference. Result has 79 places, 72 transitions, 156 flow [2023-11-24 21:49:05,524 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-24 21:49:05,525 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -12 predicate places. [2023-11-24 21:49:05,526 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 156 flow [2023-11-24 21:49:05,526 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-24 21:49:05,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:05,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:49:05,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:49:05,527 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-24 21:49:05,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:05,527 INFO L85 PathProgramCache]: Analyzing trace with hash 263100769, now seen corresponding path program 1 times [2023-11-24 21:49:05,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:05,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519319106] [2023-11-24 21:49:05,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:05,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:05,676 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-24 21:49:05,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:05,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519319106] [2023-11-24 21:49:05,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519319106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:05,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:05,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:05,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823384434] [2023-11-24 21:49:05,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:05,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:05,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:05,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:05,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:05,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2023-11-24 21:49:05,727 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-24 21:49:05,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:05,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2023-11-24 21:49:05,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:06,416 INFO L124 PetriNetUnfolderBase]: 2451/4772 cut-off events. [2023-11-24 21:49:06,417 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2023-11-24 21:49:06,428 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-24 21:49:06,467 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 28 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-24 21:49:06,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 70 transitions, 212 flow [2023-11-24 21:49:06,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-11-24 21:49:06,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6973180076628352 [2023-11-24 21:49:06,471 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-11-24 21:49:06,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-11-24 21:49:06,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:06,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-11-24 21:49:06,472 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-24 21:49:06,475 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-24 21:49:06,475 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-24 21:49:06,475 INFO L175 Difference]: Start difference. First operand has 79 places, 72 transitions, 156 flow. Second operand 3 states and 182 transitions. [2023-11-24 21:49:06,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 70 transitions, 212 flow [2023-11-24 21:49:06,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:06,479 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 152 flow [2023-11-24 21:49:06,480 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-24 21:49:06,481 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -14 predicate places. [2023-11-24 21:49:06,482 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 152 flow [2023-11-24 21:49:06,482 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-24 21:49:06,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:06,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:49:06,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:49:06,483 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-24 21:49:06,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:06,485 INFO L85 PathProgramCache]: Analyzing trace with hash 263100770, now seen corresponding path program 1 times [2023-11-24 21:49:06,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:06,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144129145] [2023-11-24 21:49:06,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:06,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:06,689 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-24 21:49:06,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:06,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144129145] [2023-11-24 21:49:06,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144129145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:06,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:06,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:06,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746955204] [2023-11-24 21:49:06,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:06,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:06,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:06,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:06,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-24 21:49:06,743 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-24 21:49:06,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:06,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-24 21:49:06,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:07,329 INFO L124 PetriNetUnfolderBase]: 2197/4302 cut-off events. [2023-11-24 21:49:07,330 INFO L125 PetriNetUnfolderBase]: For 124/148 co-relation queries the response was YES. [2023-11-24 21:49:07,338 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-24 21:49:07,367 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 26 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-24 21:49:07,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 204 flow [2023-11-24 21:49:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-24 21:49:07,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-24 21:49:07,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-24 21:49:07,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-24 21:49:07,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:07,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-24 21:49:07,371 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-24 21:49:07,372 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-24 21:49:07,373 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-24 21:49:07,373 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 152 flow. Second operand 3 states and 186 transitions. [2023-11-24 21:49:07,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 204 flow [2023-11-24 21:49:07,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:07,379 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 148 flow [2023-11-24 21:49:07,379 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-24 21:49:07,381 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -16 predicate places. [2023-11-24 21:49:07,381 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 148 flow [2023-11-24 21:49:07,382 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-24 21:49:07,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:07,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:07,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:49:07,384 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-24 21:49:07,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:07,385 INFO L85 PathProgramCache]: Analyzing trace with hash -280017888, now seen corresponding path program 1 times [2023-11-24 21:49:07,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:07,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771221754] [2023-11-24 21:49:07,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:07,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:07,497 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-24 21:49:07,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:07,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771221754] [2023-11-24 21:49:07,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771221754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:07,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:07,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:07,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025733063] [2023-11-24 21:49:07,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:07,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:07,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:07,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:07,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:07,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2023-11-24 21:49:07,546 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-24 21:49:07,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:07,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2023-11-24 21:49:07,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:08,050 INFO L124 PetriNetUnfolderBase]: 2251/4344 cut-off events. [2023-11-24 21:49:08,051 INFO L125 PetriNetUnfolderBase]: For 118/142 co-relation queries the response was YES. [2023-11-24 21:49:08,060 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-24 21:49:08,083 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 28 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-24 21:49:08,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 204 flow [2023-11-24 21:49:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-11-24 21:49:08,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6973180076628352 [2023-11-24 21:49:08,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-11-24 21:49:08,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-11-24 21:49:08,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:08,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-11-24 21:49:08,087 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-24 21:49:08,088 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-24 21:49:08,089 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-24 21:49:08,089 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 148 flow. Second operand 3 states and 182 transitions. [2023-11-24 21:49:08,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 204 flow [2023-11-24 21:49:08,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 66 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:08,092 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 144 flow [2023-11-24 21:49:08,093 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-24 21:49:08,094 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -18 predicate places. [2023-11-24 21:49:08,094 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 144 flow [2023-11-24 21:49:08,094 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-24 21:49:08,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:08,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:08,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:49:08,095 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-24 21:49:08,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash -280017887, now seen corresponding path program 1 times [2023-11-24 21:49:08,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:08,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702556503] [2023-11-24 21:49:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:08,197 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-24 21:49:08,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:08,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702556503] [2023-11-24 21:49:08,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702556503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:08,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:08,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:08,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719296781] [2023-11-24 21:49:08,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:08,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:08,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:08,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:08,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:08,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-24 21:49:08,236 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-24 21:49:08,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:08,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-24 21:49:08,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:08,759 INFO L124 PetriNetUnfolderBase]: 2197/4260 cut-off events. [2023-11-24 21:49:08,759 INFO L125 PetriNetUnfolderBase]: For 124/148 co-relation queries the response was YES. [2023-11-24 21:49:08,769 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-24 21:49:08,796 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 26 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-24 21:49:08,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 196 flow [2023-11-24 21:49:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-24 21:49:08,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-24 21:49:08,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-24 21:49:08,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-24 21:49:08,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:08,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-24 21:49:08,800 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-24 21:49:08,801 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-24 21:49:08,801 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-24 21:49:08,802 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 144 flow. Second operand 3 states and 186 transitions. [2023-11-24 21:49:08,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 196 flow [2023-11-24 21:49:08,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 64 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:08,807 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 140 flow [2023-11-24 21:49:08,807 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-24 21:49:08,810 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -20 predicate places. [2023-11-24 21:49:08,811 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 140 flow [2023-11-24 21:49:08,812 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-24 21:49:08,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:08,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:08,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:49:08,813 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-24 21:49:08,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:08,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1186125515, now seen corresponding path program 1 times [2023-11-24 21:49:08,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:08,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615301241] [2023-11-24 21:49:08,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:08,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:08,889 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-24 21:49:08,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:08,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615301241] [2023-11-24 21:49:08,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615301241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:08,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:08,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:08,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146760853] [2023-11-24 21:49:08,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:08,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:08,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:08,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:08,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:08,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 87 [2023-11-24 21:49:08,936 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-24 21:49:08,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:08,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 87 [2023-11-24 21:49:08,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:09,469 INFO L124 PetriNetUnfolderBase]: 2319/4340 cut-off events. [2023-11-24 21:49:09,469 INFO L125 PetriNetUnfolderBase]: For 123/147 co-relation queries the response was YES. [2023-11-24 21:49:09,480 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-24 21:49:09,510 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 28 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-24 21:49:09,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 62 transitions, 196 flow [2023-11-24 21:49:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-11-24 21:49:09,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6973180076628352 [2023-11-24 21:49:09,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-11-24 21:49:09,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-11-24 21:49:09,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:09,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-11-24 21:49:09,514 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-24 21:49:09,515 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-24 21:49:09,516 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-24 21:49:09,517 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 140 flow. Second operand 3 states and 182 transitions. [2023-11-24 21:49:09,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 62 transitions, 196 flow [2023-11-24 21:49:09,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:09,519 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 136 flow [2023-11-24 21:49:09,520 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-24 21:49:09,521 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -22 predicate places. [2023-11-24 21:49:09,521 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 136 flow [2023-11-24 21:49:09,521 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-24 21:49:09,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:09,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:09,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:49:09,522 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-24 21:49:09,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1186125514, now seen corresponding path program 1 times [2023-11-24 21:49:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:09,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882105276] [2023-11-24 21:49:09,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:09,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:09,649 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-24 21:49:09,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:09,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882105276] [2023-11-24 21:49:09,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882105276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:09,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:09,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:49:09,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602620422] [2023-11-24 21:49:09,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:09,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:09,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:09,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:09,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:09,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-24 21:49:09,688 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-24 21:49:09,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:09,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-24 21:49:09,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:10,093 INFO L124 PetriNetUnfolderBase]: 2197/4158 cut-off events. [2023-11-24 21:49:10,094 INFO L125 PetriNetUnfolderBase]: For 124/148 co-relation queries the response was YES. [2023-11-24 21:49:10,104 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-24 21:49:10,128 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 26 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-24 21:49:10,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 60 transitions, 188 flow [2023-11-24 21:49:10,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2023-11-24 21:49:10,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2023-11-24 21:49:10,131 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 186 transitions. [2023-11-24 21:49:10,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 186 transitions. [2023-11-24 21:49:10,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:10,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 186 transitions. [2023-11-24 21:49:10,132 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-24 21:49:10,133 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-24 21:49:10,133 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-24 21:49:10,133 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 136 flow. Second operand 3 states and 186 transitions. [2023-11-24 21:49:10,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 60 transitions, 188 flow [2023-11-24 21:49:10,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 60 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:10,136 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 132 flow [2023-11-24 21:49:10,136 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-24 21:49:10,137 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -24 predicate places. [2023-11-24 21:49:10,137 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 132 flow [2023-11-24 21:49:10,137 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-24 21:49:10,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:10,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:10,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:49:10,138 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-24 21:49:10,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1887044038, now seen corresponding path program 1 times [2023-11-24 21:49:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985737673] [2023-11-24 21:49:10,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:10,207 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-24 21:49:10,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:10,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985737673] [2023-11-24 21:49:10,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985737673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:10,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:49:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428940366] [2023-11-24 21:49:10,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:10,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:10,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:10,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2023-11-24 21:49:10,247 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-24 21:49:10,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:10,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2023-11-24 21:49:10,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:12,774 INFO L124 PetriNetUnfolderBase]: 17416/28361 cut-off events. [2023-11-24 21:49:12,774 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2023-11-24 21:49:12,825 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-24 21:49:13,018 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 177 selfloop transitions, 29 changer transitions 0/230 dead transitions. [2023-11-24 21:49:13,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 230 transitions, 920 flow [2023-11-24 21:49:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:49:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-24 21:49:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 715 transitions. [2023-11-24 21:49:13,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2023-11-24 21:49:13,022 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 715 transitions. [2023-11-24 21:49:13,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 715 transitions. [2023-11-24 21:49:13,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:13,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 715 transitions. [2023-11-24 21:49:13,026 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-24 21:49:13,028 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-24 21:49:13,029 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-24 21:49:13,029 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 132 flow. Second operand 11 states and 715 transitions. [2023-11-24 21:49:13,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 230 transitions, 920 flow [2023-11-24 21:49:13,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 230 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:13,036 INFO L231 Difference]: Finished difference. Result has 83 places, 91 transitions, 330 flow [2023-11-24 21:49:13,036 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-24 21:49:13,037 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -8 predicate places. [2023-11-24 21:49:13,037 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 91 transitions, 330 flow [2023-11-24 21:49:13,037 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-24 21:49:13,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:13,038 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-24 21:49:13,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:49:13,038 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-24 21:49:13,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:13,039 INFO L85 PathProgramCache]: Analyzing trace with hash -125491707, now seen corresponding path program 1 times [2023-11-24 21:49:13,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:13,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533499752] [2023-11-24 21:49:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:13,089 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-24 21:49:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533499752] [2023-11-24 21:49:13,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533499752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:13,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:13,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:49:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797810609] [2023-11-24 21:49:13,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:13,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:49:13,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:13,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:49:13,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:49:13,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 87 [2023-11-24 21:49:13,095 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-24 21:49:13,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:13,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 87 [2023-11-24 21:49:13,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:14,832 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-24 21:49:14,833 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:49:14,833 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:49:14,833 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:49:14,833 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:49:15,010 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-24 21:49:15,010 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,010 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,010 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,011 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,045 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-24 21:49:15,046 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,046 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,046 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,046 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,048 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-24 21:49:15,048 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,048 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,049 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,049 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,050 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-24 21:49:15,051 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,051 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,051 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,051 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:49:15,114 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-24 21:49:15,114 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,114 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,115 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,115 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,118 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-24 21:49:15,118 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,118 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,119 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,119 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,120 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-24 21:49:15,120 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,120 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,120 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,120 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,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], [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-24 21:49:15,140 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,140 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,141 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,141 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,141 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-24 21:49:15,141 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,142 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,142 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,142 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,144 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-24 21:49:15,144 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,144 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,144 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,144 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,145 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-24 21:49:15,146 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,146 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,146 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,146 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 21:49:15,179 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-24 21:49:15,180 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,181 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-24 21:49:15,181 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,181 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,182 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,182 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,184 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-24 21:49:15,184 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,185 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,185 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,185 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,186 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-24 21:49:15,186 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,186 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,186 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,186 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,203 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-24 21:49:15,203 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,203 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,203 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,204 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,204 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-24 21:49:15,205 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,205 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,205 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,205 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,206 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-24 21:49:15,207 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,207 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,207 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,207 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 21:49:15,229 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-24 21:49:15,229 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,230 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,230 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,230 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,231 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-24 21:49:15,231 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,231 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,231 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,231 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,232 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-24 21:49:15,232 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,232 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,233 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,233 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,236 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-24 21:49:15,236 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,236 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,236 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,236 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,255 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-24 21:49:15,255 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,256 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,256 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,256 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-24 21:49:15,267 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-24 21:49:15,267 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-24 21:49:15,267 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-24 21:49:15,267 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-24 21:49:15,267 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-24 21:49:15,268 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-24 21:49:15,268 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-24 21:49:15,268 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-24 21:49:15,268 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-24 21:49:15,268 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-24 21:49:15,270 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-24 21:49:15,270 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-24 21:49:15,270 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-24 21:49:15,270 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-24 21:49:15,270 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-24 21:49:15,290 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-24 21:49:15,290 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-24 21:49:15,290 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 21:49:15,290 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 21:49:15,290 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 21:49:15,291 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-24 21:49:15,291 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-24 21:49:15,291 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 21:49:15,291 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 21:49:15,292 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 21:49:15,302 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-24 21:49:15,303 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-24 21:49:15,303 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 21:49:15,303 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 21:49:15,303 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 21:49:15,336 INFO L124 PetriNetUnfolderBase]: 11112/19773 cut-off events. [2023-11-24 21:49:15,336 INFO L125 PetriNetUnfolderBase]: For 6387/6809 co-relation queries the response was YES. [2023-11-24 21:49:15,384 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-24 21:49:15,603 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 45 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2023-11-24 21:49:15,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 110 transitions, 477 flow [2023-11-24 21:49:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:49:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:49:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2023-11-24 21:49:15,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8007662835249042 [2023-11-24 21:49:15,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 209 transitions. [2023-11-24 21:49:15,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 209 transitions. [2023-11-24 21:49:15,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:15,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 209 transitions. [2023-11-24 21:49:15,607 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-24 21:49:15,608 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-24 21:49:15,608 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-24 21:49:15,608 INFO L175 Difference]: Start difference. First operand has 83 places, 91 transitions, 330 flow. Second operand 3 states and 209 transitions. [2023-11-24 21:49:15,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 110 transitions, 477 flow [2023-11-24 21:49:15,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 110 transitions, 477 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-24 21:49:15,956 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 346 flow [2023-11-24 21:49:15,957 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-24 21:49:15,957 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2023-11-24 21:49:15,958 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 346 flow [2023-11-24 21:49:15,958 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-24 21:49:15,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:15,958 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-24 21:49:15,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:49:15,959 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-24 21:49:15,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:15,959 INFO L85 PathProgramCache]: Analyzing trace with hash 499745941, now seen corresponding path program 2 times [2023-11-24 21:49:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:15,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116828548] [2023-11-24 21:49:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:15,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:16,022 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-24 21:49:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:16,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116828548] [2023-11-24 21:49:16,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116828548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:16,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:16,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:49:16,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728143377] [2023-11-24 21:49:16,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:16,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:49:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:49:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:49:16,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2023-11-24 21:49:16,025 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-24 21:49:16,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:16,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2023-11-24 21:49:16,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:17,397 INFO L124 PetriNetUnfolderBase]: 6471/12753 cut-off events. [2023-11-24 21:49:17,397 INFO L125 PetriNetUnfolderBase]: For 6339/6493 co-relation queries the response was YES. [2023-11-24 21:49:17,429 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-24 21:49:17,482 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 63 selfloop transitions, 9 changer transitions 0/135 dead transitions. [2023-11-24 21:49:17,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 135 transitions, 615 flow [2023-11-24 21:49:17,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:49:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:49:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2023-11-24 21:49:17,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-24 21:49:17,485 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 290 transitions. [2023-11-24 21:49:17,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 290 transitions. [2023-11-24 21:49:17,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:17,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 290 transitions. [2023-11-24 21:49:17,486 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-24 21:49:17,487 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-24 21:49:17,488 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-24 21:49:17,488 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 346 flow. Second operand 4 states and 290 transitions. [2023-11-24 21:49:17,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 135 transitions, 615 flow [2023-11-24 21:49:17,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 135 transitions, 603 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:17,654 INFO L231 Difference]: Finished difference. Result has 90 places, 99 transitions, 412 flow [2023-11-24 21:49:17,654 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-24 21:49:17,655 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -1 predicate places. [2023-11-24 21:49:17,655 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 99 transitions, 412 flow [2023-11-24 21:49:17,655 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-24 21:49:17,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:17,656 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-24 21:49:17,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:49:17,656 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-24 21:49:17,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash 999911387, now seen corresponding path program 1 times [2023-11-24 21:49:17,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:17,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740228159] [2023-11-24 21:49:17,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:17,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:17,735 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-24 21:49:17,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:17,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740228159] [2023-11-24 21:49:17,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740228159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:17,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:17,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:49:17,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55796345] [2023-11-24 21:49:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:17,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:17,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:17,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:17,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:17,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2023-11-24 21:49:17,787 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-24 21:49:17,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:17,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2023-11-24 21:49:17,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:20,483 INFO L124 PetriNetUnfolderBase]: 14821/24540 cut-off events. [2023-11-24 21:49:20,483 INFO L125 PetriNetUnfolderBase]: For 21781/22226 co-relation queries the response was YES. [2023-11-24 21:49:20,542 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-24 21:49:20,637 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 207 selfloop transitions, 63 changer transitions 0/300 dead transitions. [2023-11-24 21:49:20,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 300 transitions, 1822 flow [2023-11-24 21:49:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:49:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-24 21:49:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 700 transitions. [2023-11-24 21:49:20,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7314524555903866 [2023-11-24 21:49:20,641 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 700 transitions. [2023-11-24 21:49:20,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 700 transitions. [2023-11-24 21:49:20,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:20,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 700 transitions. [2023-11-24 21:49:20,644 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-24 21:49:20,646 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-24 21:49:20,647 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-24 21:49:20,647 INFO L175 Difference]: Start difference. First operand has 90 places, 99 transitions, 412 flow. Second operand 11 states and 700 transitions. [2023-11-24 21:49:20,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 300 transitions, 1822 flow [2023-11-24 21:49:21,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 300 transitions, 1822 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-24 21:49:21,022 INFO L231 Difference]: Finished difference. Result has 108 places, 152 transitions, 972 flow [2023-11-24 21:49:21,022 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-24 21:49:21,023 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 17 predicate places. [2023-11-24 21:49:21,023 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 152 transitions, 972 flow [2023-11-24 21:49:21,023 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-24 21:49:21,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:21,023 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-24 21:49:21,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:49:21,024 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-24 21:49:21,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash -801973724, now seen corresponding path program 1 times [2023-11-24 21:49:21,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:21,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522802530] [2023-11-24 21:49:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:21,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:21,111 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-24 21:49:21,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:21,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522802530] [2023-11-24 21:49:21,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522802530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:21,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:21,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:49:21,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675068418] [2023-11-24 21:49:21,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:21,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:21,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:21,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:21,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:21,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2023-11-24 21:49:21,141 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-24 21:49:21,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:21,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2023-11-24 21:49:21,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:24,208 INFO L124 PetriNetUnfolderBase]: 14830/24411 cut-off events. [2023-11-24 21:49:24,208 INFO L125 PetriNetUnfolderBase]: For 37728/37951 co-relation queries the response was YES. [2023-11-24 21:49:24,589 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-24 21:49:24,678 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 186 selfloop transitions, 76 changer transitions 0/292 dead transitions. [2023-11-24 21:49:24,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 292 transitions, 2165 flow [2023-11-24 21:49:24,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:49:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:49:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 629 transitions. [2023-11-24 21:49:24,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7229885057471265 [2023-11-24 21:49:24,682 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 629 transitions. [2023-11-24 21:49:24,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 629 transitions. [2023-11-24 21:49:24,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:24,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 629 transitions. [2023-11-24 21:49:24,685 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-24 21:49:24,687 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-24 21:49:24,688 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-24 21:49:24,688 INFO L175 Difference]: Start difference. First operand has 108 places, 152 transitions, 972 flow. Second operand 10 states and 629 transitions. [2023-11-24 21:49:24,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 292 transitions, 2165 flow [2023-11-24 21:49:25,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 292 transitions, 2163 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-24 21:49:25,535 INFO L231 Difference]: Finished difference. Result has 122 places, 169 transitions, 1369 flow [2023-11-24 21:49:25,535 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-24 21:49:25,536 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 31 predicate places. [2023-11-24 21:49:25,536 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 169 transitions, 1369 flow [2023-11-24 21:49:25,537 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-24 21:49:25,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:25,537 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-24 21:49:25,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:49:25,537 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-24 21:49:25,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash -736272165, now seen corresponding path program 1 times [2023-11-24 21:49:25,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:25,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542117415] [2023-11-24 21:49:25,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:25,616 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-24 21:49:25,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:25,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542117415] [2023-11-24 21:49:25,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542117415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:25,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:25,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:49:25,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235547191] [2023-11-24 21:49:25,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:25,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:49:25,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:25,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:49:25,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:49:25,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 87 [2023-11-24 21:49:25,649 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-24 21:49:25,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:25,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 87 [2023-11-24 21:49:25,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:29,257 INFO L124 PetriNetUnfolderBase]: 14937/24284 cut-off events. [2023-11-24 21:49:29,257 INFO L125 PetriNetUnfolderBase]: For 57606/58132 co-relation queries the response was YES. [2023-11-24 21:49:29,359 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-24 21:49:29,474 INFO L140 encePairwiseOnDemand]: 77/87 looper letters, 199 selfloop transitions, 86 changer transitions 0/321 dead transitions. [2023-11-24 21:49:29,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 321 transitions, 2679 flow [2023-11-24 21:49:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:49:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:49:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 639 transitions. [2023-11-24 21:49:29,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7344827586206897 [2023-11-24 21:49:29,478 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 639 transitions. [2023-11-24 21:49:29,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 639 transitions. [2023-11-24 21:49:29,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:29,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 639 transitions. [2023-11-24 21:49:29,482 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-24 21:49:29,485 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-24 21:49:29,485 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-24 21:49:29,486 INFO L175 Difference]: Start difference. First operand has 122 places, 169 transitions, 1369 flow. Second operand 10 states and 639 transitions. [2023-11-24 21:49:29,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 321 transitions, 2679 flow [2023-11-24 21:49:30,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 321 transitions, 2670 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-24 21:49:30,683 INFO L231 Difference]: Finished difference. Result has 135 places, 187 transitions, 1838 flow [2023-11-24 21:49:30,683 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-24 21:49:30,684 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 44 predicate places. [2023-11-24 21:49:30,684 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 187 transitions, 1838 flow [2023-11-24 21:49:30,684 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-24 21:49:30,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:30,685 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-24 21:49:30,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:49:30,685 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-24 21:49:30,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:30,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1982938215, now seen corresponding path program 1 times [2023-11-24 21:49:30,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:30,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897980075] [2023-11-24 21:49:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:30,786 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-24 21:49:30,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:30,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897980075] [2023-11-24 21:49:30,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897980075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:30,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:30,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:49:30,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661554222] [2023-11-24 21:49:30,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:30,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:49:30,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:30,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:49:30,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:49:30,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2023-11-24 21:49:30,789 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-24 21:49:30,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:30,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2023-11-24 21:49:30,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:33,128 INFO L124 PetriNetUnfolderBase]: 6948/14527 cut-off events. [2023-11-24 21:49:33,128 INFO L125 PetriNetUnfolderBase]: For 39061/39804 co-relation queries the response was YES. [2023-11-24 21:49:33,211 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-24 21:49:33,256 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 61 selfloop transitions, 15 changer transitions 0/197 dead transitions. [2023-11-24 21:49:33,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 197 transitions, 1622 flow [2023-11-24 21:49:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:49:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:49:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 346 transitions. [2023-11-24 21:49:33,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7954022988505747 [2023-11-24 21:49:33,259 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 346 transitions. [2023-11-24 21:49:33,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 346 transitions. [2023-11-24 21:49:33,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:33,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 346 transitions. [2023-11-24 21:49:33,260 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-24 21:49:33,261 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-24 21:49:33,262 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-24 21:49:33,262 INFO L175 Difference]: Start difference. First operand has 135 places, 187 transitions, 1838 flow. Second operand 5 states and 346 transitions. [2023-11-24 21:49:33,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 197 transitions, 1622 flow [2023-11-24 21:49:33,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 197 transitions, 1511 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-11-24 21:49:33,994 INFO L231 Difference]: Finished difference. Result has 133 places, 163 transitions, 1327 flow [2023-11-24 21:49:33,995 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-24 21:49:33,995 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 42 predicate places. [2023-11-24 21:49:33,995 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 163 transitions, 1327 flow [2023-11-24 21:49:33,996 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-24 21:49:33,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:33,996 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-24 21:49:33,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:49:33,996 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-24 21:49:33,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:33,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1844445949, now seen corresponding path program 2 times [2023-11-24 21:49:33,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:33,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018980354] [2023-11-24 21:49:33,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:33,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:34,147 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-24 21:49:34,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:34,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018980354] [2023-11-24 21:49:34,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018980354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:34,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:34,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:49:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27128053] [2023-11-24 21:49:34,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:34,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:49:34,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:34,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:49:34,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:49:34,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2023-11-24 21:49:34,157 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-24 21:49:34,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:34,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2023-11-24 21:49:34,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:35,810 INFO L124 PetriNetUnfolderBase]: 4963/10484 cut-off events. [2023-11-24 21:49:35,811 INFO L125 PetriNetUnfolderBase]: For 23929/24612 co-relation queries the response was YES. [2023-11-24 21:49:35,872 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-24 21:49:35,907 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 63 selfloop transitions, 17 changer transitions 0/161 dead transitions. [2023-11-24 21:49:35,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 161 transitions, 1152 flow [2023-11-24 21:49:35,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:49:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:49:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 348 transitions. [2023-11-24 21:49:35,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8 [2023-11-24 21:49:35,909 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 348 transitions. [2023-11-24 21:49:35,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 348 transitions. [2023-11-24 21:49:35,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:35,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 348 transitions. [2023-11-24 21:49:35,911 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-24 21:49:35,913 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-24 21:49:35,913 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-24 21:49:35,914 INFO L175 Difference]: Start difference. First operand has 133 places, 163 transitions, 1327 flow. Second operand 5 states and 348 transitions. [2023-11-24 21:49:35,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 161 transitions, 1152 flow [2023-11-24 21:49:36,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 161 transitions, 1008 flow, removed 12 selfloop flow, removed 19 redundant places. [2023-11-24 21:49:36,371 INFO L231 Difference]: Finished difference. Result has 112 places, 121 transitions, 787 flow [2023-11-24 21:49:36,372 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-24 21:49:36,372 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 21 predicate places. [2023-11-24 21:49:36,373 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 121 transitions, 787 flow [2023-11-24 21:49:36,373 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-24 21:49:36,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:49:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:36,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:49:36,374 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-24 21:49:36,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:49:36,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1633202971, now seen corresponding path program 1 times [2023-11-24 21:49:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:49:36,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137485340] [2023-11-24 21:49:36,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:49:36,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:49:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:49:37,463 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-24 21:49:37,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:49:37,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137485340] [2023-11-24 21:49:37,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137485340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:49:37,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:49:37,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:49:37,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495259817] [2023-11-24 21:49:37,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:49:37,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:49:37,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:49:37,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:49:37,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:49:37,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 87 [2023-11-24 21:49:37,543 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-24 21:49:37,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:49:37,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 87 [2023-11-24 21:49:37,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:49:38,614 INFO L124 PetriNetUnfolderBase]: 4975/10169 cut-off events. [2023-11-24 21:49:38,614 INFO L125 PetriNetUnfolderBase]: For 22856/23464 co-relation queries the response was YES. [2023-11-24 21:49:38,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30487 conditions, 10169 events. 4975/10169 cut-off events. For 22856/23464 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 86794 event pairs, 4259 based on Foata normal form. 93/9998 useless extension candidates. Maximal degree in co-relation 7545. Up to 7272 conditions per place. [2023-11-24 21:49:38,650 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 0 selfloop transitions, 0 changer transitions 120/120 dead transitions. [2023-11-24 21:49:38,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 120 transitions, 865 flow [2023-11-24 21:49:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:49:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:49:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2023-11-24 21:49:38,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6867816091954023 [2023-11-24 21:49:38,652 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 239 transitions. [2023-11-24 21:49:38,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 239 transitions. [2023-11-24 21:49:38,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:49:38,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 239 transitions. [2023-11-24 21:49:38,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-24 21:49:38,654 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-24 21:49:38,655 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-24 21:49:38,655 INFO L175 Difference]: Start difference. First operand has 112 places, 121 transitions, 787 flow. Second operand 4 states and 239 transitions. [2023-11-24 21:49:38,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 120 transitions, 865 flow [2023-11-24 21:49:38,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 120 transitions, 843 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-24 21:49:38,700 INFO L231 Difference]: Finished difference. Result has 112 places, 0 transitions, 0 flow [2023-11-24 21:49:38,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=112, PETRI_TRANSITIONS=0} [2023-11-24 21:49:38,700 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, 21 predicate places. [2023-11-24 21:49:38,701 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 0 transitions, 0 flow [2023-11-24 21:49:38,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-24 21:49:38,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2023-11-24 21:49:38,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2023-11-24 21:49:38,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-11-24 21:49:38,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-11-24 21:49:38,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-11-24 21:49:38,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-11-24 21:49:38,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-11-24 21:49:38,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-11-24 21:49:38,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-11-24 21:49:38,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-11-24 21:49:38,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2023-11-24 21:49:38,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2023-11-24 21:49:38,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2023-11-24 21:49:38,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2023-11-24 21:49:38,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-11-24 21:49:38,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2023-11-24 21:49:38,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2023-11-24 21:49:38,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (6 of 24 remaining) [2023-11-24 21:49:38,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 24 remaining) [2023-11-24 21:49:38,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2023-11-24 21:49:38,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2023-11-24 21:49:38,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2023-11-24 21:49:38,710 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 24 remaining) [2023-11-24 21:49:38,711 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2023-11-24 21:49:38,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 21:49:38,711 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:49:38,717 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:49:38,718 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:49:38,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:49:38 BasicIcfg [2023-11-24 21:49:38,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:49:38,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:49:38,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:49:38,725 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:49:38,725 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:49:02" (3/4) ... [2023-11-24 21:49:38,727 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-24 21:49:38,731 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reader [2023-11-24 21:49:38,731 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure writer [2023-11-24 21:49:38,737 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2023-11-24 21:49:38,737 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-24 21:49:38,737 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-24 21:49:38,738 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-24 21:49:38,822 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/witness.graphml [2023-11-24 21:49:38,823 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/witness.yml [2023-11-24 21:49:38,823 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:49:38,824 INFO L158 Benchmark]: Toolchain (without parser) took 37716.97ms. Allocated memory was 144.7MB in the beginning and 10.8GB in the end (delta: 10.6GB). Free memory was 98.1MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-24 21:49:38,824 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 144.7MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:49:38,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.57ms. Allocated memory is still 144.7MB. Free memory was 98.1MB in the beginning and 77.5MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-24 21:49:38,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.53ms. Allocated memory is still 144.7MB. Free memory was 77.5MB in the beginning and 75.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:49:38,826 INFO L158 Benchmark]: Boogie Preprocessor took 50.53ms. Allocated memory is still 144.7MB. Free memory was 75.4MB in the beginning and 72.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:49:38,826 INFO L158 Benchmark]: RCFGBuilder took 728.73ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 72.9MB in the beginning and 135.8MB in the end (delta: -62.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2023-11-24 21:49:38,827 INFO L158 Benchmark]: TraceAbstraction took 36244.59ms. Allocated memory was 180.4MB in the beginning and 10.8GB in the end (delta: 10.6GB). Free memory was 134.9MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-11-24 21:49:38,827 INFO L158 Benchmark]: Witness Printer took 98.86ms. Allocated memory is still 10.8GB. Free memory was 9.4GB in the beginning and 9.4GB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:49:38,829 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 144.7MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.57ms. Allocated memory is still 144.7MB. Free memory was 98.1MB in the beginning and 77.5MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.53ms. Allocated memory is still 144.7MB. Free memory was 77.5MB in the beginning and 75.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.53ms. Allocated memory is still 144.7MB. Free memory was 75.4MB in the beginning and 72.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 728.73ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 72.9MB in the beginning and 135.8MB in the end (delta: -62.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 36244.59ms. Allocated memory was 180.4MB in the beginning and 10.8GB in the end (delta: 10.6GB). Free memory was 134.9MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 98.86ms. Allocated memory is still 10.8GB. Free memory was 9.4GB in the beginning and 9.4GB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 743]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 108 locations, 24 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1484 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1116 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2787 IncrementalHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 134 mSDtfsCounter, 2787 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=14, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 2731 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-24 21:49:38,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8b9bb68-fee2-4ffe-94bd-7876913affae/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE