./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:45:44,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:45:44,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:45:44,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:45:44,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:45:44,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:45:44,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:45:44,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:45:44,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:45:44,708 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:45:44,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:45:44,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:45:44,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:45:44,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:45:44,708 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:45:44,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:45:44,709 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:45:44,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:45:44,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:45:44,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:45:44,710 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:45:44,710 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:45:44,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:45:44,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:45:44,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:45:44,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:45:44,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:45:44,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:45:44,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:45:44,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:45:44,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe [2025-02-08 08:45:44,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:45:44,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:45:44,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:45:44,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:45:44,894 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:45:44,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-02-08 08:45:46,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a57bec76/268516e6a5294a1ebffa17063be5cb20/FLAG7f499c85a [2025-02-08 08:45:46,516 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:45:46,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-02-08 08:45:46,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a57bec76/268516e6a5294a1ebffa17063be5cb20/FLAG7f499c85a [2025-02-08 08:45:46,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a57bec76/268516e6a5294a1ebffa17063be5cb20 [2025-02-08 08:45:46,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:45:46,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:45:46,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:45:46,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:45:46,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:45:46,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:45:46" (1/1) ... [2025-02-08 08:45:46,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55efa566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:46, skipping insertion in model container [2025-02-08 08:45:46,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:45:46" (1/1) ... [2025-02-08 08:45:46,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:45:49,121 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:45:49,125 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:45:49,125 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:45:49,129 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:45:49,129 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:45:49,269 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:45:49,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:45:49,283 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:45:49,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-02-08 08:45:49,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-02-08 08:45:49,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-02-08 08:45:49,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-02-08 08:45:49,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-02-08 08:45:49,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-02-08 08:45:49,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-02-08 08:45:49,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-02-08 08:45:49,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-02-08 08:45:49,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-02-08 08:45:49,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-02-08 08:45:49,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-02-08 08:45:49,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-02-08 08:45:49,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-02-08 08:45:49,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-02-08 08:45:49,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-02-08 08:45:49,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-02-08 08:45:49,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-02-08 08:45:49,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-02-08 08:45:49,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-02-08 08:45:49,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-02-08 08:45:49,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-02-08 08:45:49,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-02-08 08:45:49,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-02-08 08:45:49,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-02-08 08:45:49,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-02-08 08:45:49,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-02-08 08:45:49,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-02-08 08:45:49,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-02-08 08:45:49,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-02-08 08:45:49,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-02-08 08:45:49,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-02-08 08:45:49,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-02-08 08:45:49,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-02-08 08:45:49,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-02-08 08:45:49,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-02-08 08:45:49,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-02-08 08:45:49,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-02-08 08:45:49,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-02-08 08:45:49,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-02-08 08:45:49,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-02-08 08:45:49,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-02-08 08:45:49,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-02-08 08:45:49,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-02-08 08:45:49,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-02-08 08:45:49,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-02-08 08:45:49,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-02-08 08:45:49,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-02-08 08:45:49,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-02-08 08:45:49,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-02-08 08:45:49,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-02-08 08:45:49,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-02-08 08:45:49,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-02-08 08:45:49,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-02-08 08:45:49,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-02-08 08:45:49,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-02-08 08:45:49,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-02-08 08:45:49,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-02-08 08:45:49,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-02-08 08:45:49,402 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-02-08 08:45:49,402 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-02-08 08:45:49,403 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-02-08 08:45:49,403 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-02-08 08:45:49,403 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-02-08 08:45:49,407 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-02-08 08:45:49,408 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-02-08 08:45:49,408 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-02-08 08:45:49,408 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-02-08 08:45:49,408 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-02-08 08:45:49,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-02-08 08:45:49,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-02-08 08:45:49,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-02-08 08:45:49,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-02-08 08:45:49,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-02-08 08:45:49,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-02-08 08:45:49,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-02-08 08:45:49,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-02-08 08:45:49,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-02-08 08:45:49,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-02-08 08:45:49,413 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-02-08 08:45:49,413 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-02-08 08:45:49,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-02-08 08:45:49,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-02-08 08:45:49,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-02-08 08:45:49,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-02-08 08:45:49,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-02-08 08:45:49,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-02-08 08:45:49,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-02-08 08:45:49,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-02-08 08:45:49,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-02-08 08:45:49,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-02-08 08:45:49,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-02-08 08:45:49,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-02-08 08:45:49,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-02-08 08:45:49,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-02-08 08:45:49,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-02-08 08:45:49,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-02-08 08:45:49,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-02-08 08:45:49,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-02-08 08:45:49,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-02-08 08:45:49,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:45:49,628 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:45:49,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49 WrapperNode [2025-02-08 08:45:49,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:45:49,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:45:49,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:45:49,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:45:49,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (1/1) ... [2025-02-08 08:45:49,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (1/1) ... [2025-02-08 08:45:49,757 INFO L138 Inliner]: procedures = 914, calls = 957, calls flagged for inlining = 822, calls inlined = 64, statements flattened = 649 [2025-02-08 08:45:49,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:45:49,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:45:49,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:45:49,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:45:49,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (1/1) ... [2025-02-08 08:45:49,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (1/1) ... [2025-02-08 08:45:49,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (1/1) ... [2025-02-08 08:45:49,805 INFO L175 MemorySlicer]: Split 65 memory accesses to 5 slices as follows [2, 8, 44, 2, 9]. 68 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 4, 6, 0, 5]. The 20 writes are split as follows [0, 3, 14, 1, 2]. [2025-02-08 08:45:49,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (1/1) ... [2025-02-08 08:45:49,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (1/1) ... [2025-02-08 08:45:49,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (1/1) ... [2025-02-08 08:45:49,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (1/1) ... [2025-02-08 08:45:49,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (1/1) ... [2025-02-08 08:45:49,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (1/1) ... [2025-02-08 08:45:49,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:45:49,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:45:49,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:45:49,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:45:49,846 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (1/1) ... [2025-02-08 08:45:49,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:45:49,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:49,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:45:49,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:45:49,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-02-08 08:45:49,898 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 08:45:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 08:45:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:45:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:45:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:45:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 08:45:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 08:45:49,901 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:45:50,076 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:45:50,078 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:45:50,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:50,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-10: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:50,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-20: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:50,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-2: havoc verification_spin_end_~v#1; [2025-02-08 08:45:50,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-3: havoc verification_spin_end_~v#1; [2025-02-08 08:45:50,784 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-6: havoc vatomic32_await_eq_#t~ite641#1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-7: assume 0 != vatomic32_await_eq_#t~ite641#1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-7: assume !(0 != vatomic32_await_eq_#t~ite641#1); [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-5: havoc vatomic32_await_eq_#t~ite641#1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-10: assume { :end_inline_verification_spin_end } true;vatomic32_await_eq_#t~ite641#1 := 0; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-11: havoc verification_spin_end_#in~v#1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-8: havoc vatomic32_await_eq_#t~ret640#1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-9: havoc vatomic32_await_eq_#t~ret640#1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-14: assume vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-14: assume !(vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296); [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-15: vatomic32_await_eq_#t~ite641#1 := 1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-12: havoc verification_spin_end_~v#1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-13: havoc verification_spin_end_~v#1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-18: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-19: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-17: assume { :end_inline_vatomic32_read } true;vatomic32_await_eq_~o~5#1 := vatomic32_await_eq_#t~ret640#1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393-20: vatomic32_await_eq_#t~ret640#1 := vatomic32_read_#res#1; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394: assume true; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394: assume !true; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394-1: assume false; [2025-02-08 08:45:50,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394-1: assume !false; [2025-02-08 08:45:50,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5395: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~o~5#1; [2025-02-08 08:45:50,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 08:45:50,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-10: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 08:45:50,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1118: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 08:45:50,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1118-1: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 08:45:50,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121: assume true; [2025-02-08 08:45:50,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121: assume !true; [2025-02-08 08:45:50,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-1: assume false; [2025-02-08 08:45:50,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-1: assume !false; [2025-02-08 08:45:50,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-2: assume true; [2025-02-08 08:45:50,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-2: assume !true; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-3: assume false; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-3: assume !false; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-4: assume true; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-4: assume !true; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-5: assume false; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-5: assume !false; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-6: assume true; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-6: assume !true; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-7: assume false; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-7: assume !false; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-8: assume true; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-8: assume !true; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-9: assume false; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-9: assume !false; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-10: assume true; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-10: assume !true; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-11: assume false; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121-11: assume !false; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-10: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-20: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:50,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-30: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:50,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-08 08:45:50,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-08 08:45:50,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043: havoc main_~#r~0#1.base, main_~#r~0#1.offset; [2025-02-08 08:45:50,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-1: SUMMARY for call ULTIMATE.dealloc(main_~#r~0#1.base, main_~#r~0#1.offset); srcloc: null [2025-02-08 08:45:50,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808: havoc vatomic32_await_eq_rlx_#t~ret172#1; [2025-02-08 08:45:50,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480: vatomic32_cmpxchg_rel_~v#1 := vatomic32_cmpxchg_rel_#in~v#1; [2025-02-08 08:45:50,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480-2: vatomic32_cmpxchg_rel_~a#1.base, vatomic32_cmpxchg_rel_~a#1.offset := vatomic32_cmpxchg_rel_#in~a#1.base, vatomic32_cmpxchg_rel_#in~a#1.offset; [2025-02-08 08:45:50,946 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480-1: vatomic32_cmpxchg_rel_~e#1 := vatomic32_cmpxchg_rel_#in~e#1; [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4479: vatomic32_cmpxchg_~exp~2#1 := vatomic32_cmpxchg_~e#1; [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-1: vatomic32_read_~tmp~2#1 := vatomic32_read_#t~mem436#1; [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-2: [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332: havoc vatomic32_read_#t~mem436#1; [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-3: SUMMARY for call vatomic32_read_#t~mem436#1 := read~int#2(vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-3: assume !(1 == #valid[vatomic32_read_~a#1.base]); [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-3: assume !(4 + vatomic32_read_~a#1.offset <= #length[vatomic32_read_~a#1.base] && 0 <= vatomic32_read_~a#1.offset); [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4332-4: [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-2: havoc vatomic32_cmpxchg_#t~ret452#1; [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-3: havoc vatomic32_cmpxchg_#t~ret454#1; [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc vatomic32_cmpxchg_#t~ret454#1; [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-1: havoc vatomic32_cmpxchg_#t~mem453#1; [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-6: [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-7: SUMMARY for call write~int#2(vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:50,947 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-7: assume !(1 == #valid[vatomic32_cmpxchg_~a#1.base]); [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-7: assume !(4 + vatomic32_cmpxchg_~a#1.offset <= #length[vatomic32_cmpxchg_~a#1.base] && 0 <= vatomic32_cmpxchg_~a#1.offset); [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-4: havoc vatomic32_cmpxchg_#t~mem453#1; [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-5: havoc vatomic32_cmpxchg_#t~ret452#1; [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-10: vatomic32_cmpxchg_#t~ret452#1 := (if vatomic32_cmpxchg_#t~mem453#1 == vatomic32_cmpxchg_#t~ret454#1 then 1 else 0); [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-11: vatomic32_cmpxchg_#t~ret454#1 := vatomic32_cmpxchg_~exp~2#1; [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-8: assume 0 != vatomic32_cmpxchg_#t~ret452#1 % 256; [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-8: assume !(0 != vatomic32_cmpxchg_#t~ret452#1 % 256); [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-9: vatomic32_cmpxchg_~exp~2#1 := vatomic32_cmpxchg_#t~mem453#1; [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2450: vatomic32_write_rel_~v#1 := vatomic32_write_rel_#in~v#1; [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-12: SUMMARY for call vatomic32_cmpxchg_#t~mem453#1 := read~int#2(vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-12: assume !(1 == #valid[vatomic32_cmpxchg_~a#1.base]); [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-12: assume !(4 + vatomic32_cmpxchg_~a#1.offset <= #length[vatomic32_cmpxchg_~a#1.base] && 0 <= vatomic32_cmpxchg_~a#1.offset); [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:50,948 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481-13: [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-3: assume { :end_inline_vatomic32_cmpxchg } true;vatomic32_cmpxchg_rel_#res#1 := vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2450-1: vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset := vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-2: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-5: havoc vatomic32_cmpxchg_#t~ret452#1, vatomic32_cmpxchg_#t~mem453#1, vatomic32_cmpxchg_#t~ret454#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-4: havoc vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-7: havoc vatomic32_cmpxchg_#t~ret452#1, vatomic32_cmpxchg_#t~mem453#1, vatomic32_cmpxchg_#t~ret454#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-6: vatomic32_cmpxchg_rel_#t~ret123#1 := vatomic32_cmpxchg_#res#1; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-9: assume { :begin_inline_vatomic32_cmpxchg } true;vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1 := vatomic32_cmpxchg_rel_~a#1.base, vatomic32_cmpxchg_rel_~a#1.offset, vatomic32_cmpxchg_rel_~e#1, vatomic32_cmpxchg_rel_~v#1; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-8: havoc vatomic32_cmpxchg_#res#1; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4334-1: vatomic32_read_#res#1 := vatomic32_read_~tmp~2#1; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6019: havoc ~#xbo~0#1.base, ~#xbo~0#1.offset; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6019-1: SUMMARY for call ULTIMATE.dealloc(~#xbo~0#1.base, ~#xbo~0#1.offset); srcloc: null [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2435: vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset := vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4484-1: vatomic32_cmpxchg_#res#1 := vatomic32_cmpxchg_~exp~2#1; [2025-02-08 08:45:50,949 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5954: havoc bounded_mpmc_enq_#t~ret762#1; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5954-3: havoc vatomic32_read_acq_#t~ret117#1, vatomic32_read_acq_~a#1.base, vatomic32_read_acq_~a#1.offset; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5954-4: bounded_mpmc_enq_#t~ret762#1 := vatomic32_read_acq_#res#1; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5954-1: assume { :end_inline_vatomic32_read_acq } true;bounded_mpmc_enq_~curr~0#1 := bounded_mpmc_enq_#t~ret762#1; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5954-2: havoc vatomic32_read_acq_#in~a#1.base, vatomic32_read_acq_#in~a#1.offset; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-1: havoc vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset, vatomic32_write_#in~v#1; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453: assume { :end_inline_vatomic32_write } true;havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-3: havoc vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, vatomic32_write_~v#1; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-2: havoc vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, vatomic32_write_~v#1; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-4: assume { :begin_inline_vatomic32_write } true;vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset, vatomic32_write_#in~v#1 := vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955: havoc bounded_mpmc_enq_#t~mem764#1; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-1: havoc bounded_mpmc_enq_#t~mem764#1; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-4: havoc bounded_mpmc_enq_#t~ret763#1; [2025-02-08 08:45:50,950 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-5: SUMMARY for call bounded_mpmc_enq_#t~mem764#1 := read~int#2(bounded_mpmc_enq_~q#1.base, 20 + bounded_mpmc_enq_~q#1.offset, 4); srcloc: null [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-5: assume !(1 == #valid[bounded_mpmc_enq_~q#1.base]); [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-5: assume !(4 + (20 + bounded_mpmc_enq_~q#1.offset) <= #length[bounded_mpmc_enq_~q#1.base] && 0 <= 20 + bounded_mpmc_enq_~q#1.offset); [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-2: assume (bounded_mpmc_enq_~curr~0#1 - bounded_mpmc_enq_#t~ret763#1) % 4294967296 == bounded_mpmc_enq_#t~mem764#1 % 4294967296; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-2: assume !((bounded_mpmc_enq_~curr~0#1 - bounded_mpmc_enq_#t~ret763#1) % 4294967296 == bounded_mpmc_enq_#t~mem764#1 % 4294967296); [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-3: havoc bounded_mpmc_enq_#t~ret763#1; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-8: bounded_mpmc_enq_#t~ret763#1 := vatomic32_read_rlx_#res#1; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-9: havoc vatomic32_read_rlx_#t~ret116#1, vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-6: havoc vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset;assume { :end_inline_vatomic32_read_rlx } true; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-7: havoc vatomic32_read_rlx_#t~ret116#1, vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-10: havoc vatomic32_read_rlx_#res#1; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5955-11: assume { :begin_inline_vatomic32_read_rlx } true;vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset := bounded_mpmc_enq_~q#1.base, 12 + bounded_mpmc_enq_~q#1.offset; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5956-1: bounded_mpmc_enq_#res#1 := 1; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-2: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-4: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-3: assume { :end_inline_vatomic32_read } true;vatomic32_read_rlx_#res#1 := vatomic32_read_rlx_#t~ret116#1; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-6: vatomic32_read_rlx_#t~ret116#1 := vatomic32_read_#res#1; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-5: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-8: havoc vatomic32_read_#res#1; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-7: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:50,951 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-9: assume { :begin_inline_vatomic32_read } true;vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset := vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6024-1: assume 0 != #t~ret775#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6024-1: assume !(0 != #t~ret775#1); [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6024-2: havoc #t~ret775#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5958: bounded_mpmc_enq_~next~0#1 := 1 + bounded_mpmc_enq_~curr~0#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6024-5: havoc bounded_mpmc_enq_#in~q#1.base, bounded_mpmc_enq_#in~q#1.offset, bounded_mpmc_enq_#in~v#1.base, bounded_mpmc_enq_#in~v#1.offset; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6024-6: havoc bounded_mpmc_enq_#t~ret762#1, bounded_mpmc_enq_#t~ret763#1, bounded_mpmc_enq_#t~mem764#1, bounded_mpmc_enq_#t~ret765#1, bounded_mpmc_enq_#t~mem767#1.base, bounded_mpmc_enq_#t~mem767#1.offset, bounded_mpmc_enq_#t~mem766#1, bounded_mpmc_enq_~q#1.base, bounded_mpmc_enq_~q#1.offset, bounded_mpmc_enq_~v#1.base, bounded_mpmc_enq_~v#1.offset, bounded_mpmc_enq_~curr~0#1, bounded_mpmc_enq_~next~0#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6024-3: havoc #t~ret775#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6024-4: assume { :end_inline_bounded_mpmc_enq } true;assume -2147483648 <= #t~ret775#1 && #t~ret775#1 <= 2147483647; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6024-7: #t~ret775#1 := bounded_mpmc_enq_#res#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6025-2: havoc xbo_backoff_~xbo#1.base, xbo_backoff_~xbo#1.offset, xbo_backoff_~nop#1.base, xbo_backoff_~nop#1.offset, xbo_backoff_~cb#1.base, xbo_backoff_~cb#1.offset; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959: assume bounded_mpmc_enq_#t~ret765#1 != bounded_mpmc_enq_~curr~0#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959: assume !(bounded_mpmc_enq_#t~ret765#1 != bounded_mpmc_enq_~curr~0#1); [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6025-3: assume { :begin_inline_xbo_backoff } true;xbo_backoff_#in~xbo#1.base, xbo_backoff_#in~xbo#1.offset, xbo_backoff_#in~nop#1.base, xbo_backoff_#in~nop#1.offset, xbo_backoff_#in~cb#1.base, xbo_backoff_#in~cb#1.offset := ~#xbo~0#1.base, ~#xbo~0#1.offset, #funAddr~xbo_nop.base, #funAddr~xbo_nop.offset, #funAddr~sched_yield.base, #funAddr~sched_yield.offset; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-1: havoc bounded_mpmc_enq_#t~ret765#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6025: havoc xbo_backoff_#in~xbo#1.base, xbo_backoff_#in~xbo#1.offset, xbo_backoff_#in~nop#1.base, xbo_backoff_#in~nop#1.offset, xbo_backoff_#in~cb#1.base, xbo_backoff_#in~cb#1.offset;assume { :end_inline_xbo_backoff } true; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6025-1: havoc xbo_backoff_~xbo#1.base, xbo_backoff_~xbo#1.offset, xbo_backoff_~nop#1.base, xbo_backoff_~nop#1.offset, xbo_backoff_~cb#1.base, xbo_backoff_~cb#1.offset; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-4: havoc vatomic32_cmpxchg_rel_#t~ret123#1, vatomic32_cmpxchg_rel_~a#1.base, vatomic32_cmpxchg_rel_~a#1.offset, vatomic32_cmpxchg_rel_~e#1, vatomic32_cmpxchg_rel_~v#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-5: bounded_mpmc_enq_#t~ret765#1 := vatomic32_cmpxchg_rel_#res#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-2: havoc bounded_mpmc_enq_#t~ret765#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-3: havoc vatomic32_cmpxchg_rel_#in~a#1.base, vatomic32_cmpxchg_rel_#in~a#1.offset, vatomic32_cmpxchg_rel_#in~e#1, vatomic32_cmpxchg_rel_#in~v#1;assume { :end_inline_vatomic32_cmpxchg_rel } true; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-8: assume { :begin_inline_vatomic32_cmpxchg_rel } true;vatomic32_cmpxchg_rel_#in~a#1.base, vatomic32_cmpxchg_rel_#in~a#1.offset, vatomic32_cmpxchg_rel_#in~e#1, vatomic32_cmpxchg_rel_#in~v#1 := bounded_mpmc_enq_~q#1.base, bounded_mpmc_enq_~q#1.offset, bounded_mpmc_enq_~curr~0#1, bounded_mpmc_enq_~next~0#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-6: havoc vatomic32_cmpxchg_rel_#t~ret123#1, vatomic32_cmpxchg_rel_~a#1.base, vatomic32_cmpxchg_rel_~a#1.offset, vatomic32_cmpxchg_rel_~e#1, vatomic32_cmpxchg_rel_~v#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5959-7: havoc vatomic32_cmpxchg_rel_#res#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4374: vatomic32_write_~v#1 := vatomic32_write_#in~v#1; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4374-1: vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset := vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5993-2: xbo_backoff_~xbo#1.base, xbo_backoff_~xbo#1.offset := xbo_backoff_#in~xbo#1.base, xbo_backoff_#in~xbo#1.offset; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5960-1: bounded_mpmc_enq_#res#1 := 3; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5993: xbo_backoff_~cb#1.base, xbo_backoff_~cb#1.offset := xbo_backoff_#in~cb#1.base, xbo_backoff_#in~cb#1.offset; [2025-02-08 08:45:50,952 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5993-1: xbo_backoff_~nop#1.base, xbo_backoff_~nop#1.offset := xbo_backoff_#in~nop#1.base, xbo_backoff_#in~nop#1.offset; [2025-02-08 08:45:50,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:50,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-3: assume { :end_inline_vatomic32_read } true;vatomic32_read_acq_#res#1 := vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:50,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-2: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 08:45:50,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-5: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:50,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-4: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:50,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-6: vatomic32_read_acq_#t~ret117#1 := vatomic32_read_#res#1; [2025-02-08 08:45:50,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962: havoc bounded_mpmc_enq_#t~mem766#1; [2025-02-08 08:45:50,953 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-3: SUMMARY for call bounded_mpmc_enq_#t~mem766#1 := read~int#2(bounded_mpmc_enq_~q#1.base, 20 + bounded_mpmc_enq_~q#1.offset, 4); srcloc: null [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-3: assume !(1 == #valid[bounded_mpmc_enq_~q#1.base]); [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-3: assume !(4 + (20 + bounded_mpmc_enq_~q#1.offset) <= #length[bounded_mpmc_enq_~q#1.base] && 0 <= 20 + bounded_mpmc_enq_~q#1.offset); [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-4: SUMMARY for call bounded_mpmc_enq_#t~mem767#1.base, bounded_mpmc_enq_#t~mem767#1.offset := read~$Pointer$#2(bounded_mpmc_enq_~q#1.base, 16 + bounded_mpmc_enq_~q#1.offset, 4); srcloc: null [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-4: assume !(1 == #valid[bounded_mpmc_enq_~q#1.base]); [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-4: assume !(4 + (16 + bounded_mpmc_enq_~q#1.offset) <= #length[bounded_mpmc_enq_~q#1.base] && 0 <= 16 + bounded_mpmc_enq_~q#1.offset); [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-1: havoc bounded_mpmc_enq_#t~mem767#1.base, bounded_mpmc_enq_#t~mem767#1.offset; [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-2: SUMMARY for call write~$Pointer$#1(bounded_mpmc_enq_~v#1.base, bounded_mpmc_enq_~v#1.offset, bounded_mpmc_enq_#t~mem767#1.base, bounded_mpmc_enq_#t~mem767#1.offset + 4 * (if bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 else bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296), 4); srcloc: null [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-2: assume !(1 == #valid[bounded_mpmc_enq_#t~mem767#1.base]); [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5962-2: assume !(4 + (bounded_mpmc_enq_#t~mem767#1.offset + 4 * (if bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 else bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)) <= #length[bounded_mpmc_enq_#t~mem767#1.base] && 0 <= bounded_mpmc_enq_#t~mem767#1.offset + 4 * (if bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 else bounded_mpmc_enq_~curr~0#1 % 4294967296 % (bounded_mpmc_enq_#t~mem766#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)); [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476-1: vatomic32_cmpxchg_~e#1 := vatomic32_cmpxchg_#in~e#1; [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476-2: vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset; [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476: vatomic32_cmpxchg_~v#1 := vatomic32_cmpxchg_#in~v#1; [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5963: assume { :end_inline_vatomic32_write_rel } true;bounded_mpmc_enq_#res#1 := 0; [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5963-1: havoc vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset, vatomic32_write_rel_#in~v#1; [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5963-2: havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5963-3: assume { :begin_inline_vatomic32_write_rel } true;vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset, vatomic32_write_rel_#in~v#1 := bounded_mpmc_enq_~q#1.base, 4 + bounded_mpmc_enq_~q#1.offset, bounded_mpmc_enq_~next~0#1; [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4328: vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset := vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378: [2025-02-08 08:45:50,954 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378-1: SUMMARY for call write~int#2(vatomic32_write_~v#1, vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:50,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378-1: assume !(1 == #valid[vatomic32_write_~a#1.base]); [2025-02-08 08:45:50,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378-1: assume !(4 + vatomic32_write_~a#1.offset <= #length[vatomic32_write_~a#1.base] && 0 <= vatomic32_write_~a#1.offset); [2025-02-08 08:45:50,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378-2: [2025-02-08 08:45:50,955 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:45:50,956 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:45:51,225 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:45:51,226 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:45:51,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:51 BoogieIcfgContainer [2025-02-08 08:45:51,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:45:51,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:45:51,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:45:51,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:45:51,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:45:46" (1/3) ... [2025-02-08 08:45:51,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2850049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:45:51, skipping insertion in model container [2025-02-08 08:45:51,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:49" (2/3) ... [2025-02-08 08:45:51,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2850049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:45:51, skipping insertion in model container [2025-02-08 08:45:51,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:51" (3/3) ... [2025-02-08 08:45:51,233 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-02-08 08:45:51,244 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:45:51,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_mpmc_check_full.i that has 2 procedures, 221 locations, 1 initial locations, 23 loop locations, and 104 error locations. [2025-02-08 08:45:51,245 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:45:51,321 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 08:45:51,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 262 transitions, 531 flow [2025-02-08 08:45:51,441 INFO L124 PetriNetUnfolderBase]: 72/462 cut-off events. [2025-02-08 08:45:51,442 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:45:51,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 462 events. 72/462 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1585 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 245. Up to 6 conditions per place. [2025-02-08 08:45:51,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 224 places, 262 transitions, 531 flow [2025-02-08 08:45:51,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 224 places, 262 transitions, 531 flow [2025-02-08 08:45:51,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:45:51,465 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@442a67f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:45:51,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 93 error locations. [2025-02-08 08:45:51,470 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:45:51,470 INFO L124 PetriNetUnfolderBase]: 6/18 cut-off events. [2025-02-08 08:45:51,470 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:45:51,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:51,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:45:51,471 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:51,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash 58054136, now seen corresponding path program 1 times [2025-02-08 08:45:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:51,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021314174] [2025-02-08 08:45:51,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:51,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:45:51,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:45:51,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:51,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:51,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:51,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021314174] [2025-02-08 08:45:51,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021314174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:51,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:51,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926656772] [2025-02-08 08:45:51,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:51,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:45:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:51,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:45:51,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:45:51,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 262 [2025-02-08 08:45:51,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 262 transitions, 531 flow. Second operand has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 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) [2025-02-08 08:45:51,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:51,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 262 [2025-02-08 08:45:51,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:51,759 INFO L124 PetriNetUnfolderBase]: 211/665 cut-off events. [2025-02-08 08:45:51,760 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 08:45:51,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 665 events. 211/665 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3461 event pairs, 200 based on Foata normal form. 8/371 useless extension candidates. Maximal degree in co-relation 1024. Up to 491 conditions per place. [2025-02-08 08:45:51,764 INFO L140 encePairwiseOnDemand]: 250/262 looper letters, 57 selfloop transitions, 0 changer transitions 0/94 dead transitions. [2025-02-08 08:45:51,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 94 transitions, 309 flow [2025-02-08 08:45:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:45:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:45:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 265 transitions. [2025-02-08 08:45:51,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5057251908396947 [2025-02-08 08:45:51,775 INFO L175 Difference]: Start difference. First operand has 224 places, 262 transitions, 531 flow. Second operand 2 states and 265 transitions. [2025-02-08 08:45:51,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 94 transitions, 309 flow [2025-02-08 08:45:51,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 309 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:45:51,781 INFO L231 Difference]: Finished difference. Result has 96 places, 94 transitions, 195 flow [2025-02-08 08:45:51,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=195, PETRI_PLACES=96, PETRI_TRANSITIONS=94} [2025-02-08 08:45:51,785 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -128 predicate places. [2025-02-08 08:45:51,786 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 195 flow [2025-02-08 08:45:51,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 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) [2025-02-08 08:45:51,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:51,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:45:51,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:45:51,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:51,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:51,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1799646902, now seen corresponding path program 1 times [2025-02-08 08:45:51,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:51,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426679876] [2025-02-08 08:45:51,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:51,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:51,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:45:51,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:45:51,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:51,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:51,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:51,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426679876] [2025-02-08 08:45:51,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426679876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:51,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:51,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488785563] [2025-02-08 08:45:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:51,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:51,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:51,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:51,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:51,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 262 [2025-02-08 08:45:51,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2025-02-08 08:45:51,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:51,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 262 [2025-02-08 08:45:51,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:52,074 INFO L124 PetriNetUnfolderBase]: 211/662 cut-off events. [2025-02-08 08:45:52,075 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 08:45:52,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 662 events. 211/662 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3493 event pairs, 200 based on Foata normal form. 1/361 useless extension candidates. Maximal degree in co-relation 1154. Up to 472 conditions per place. [2025-02-08 08:45:52,078 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 54 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-02-08 08:45:52,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 301 flow [2025-02-08 08:45:52,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2025-02-08 08:45:52,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44656488549618323 [2025-02-08 08:45:52,081 INFO L175 Difference]: Start difference. First operand has 96 places, 94 transitions, 195 flow. Second operand 3 states and 351 transitions. [2025-02-08 08:45:52,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 301 flow [2025-02-08 08:45:52,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 301 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:45:52,083 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 193 flow [2025-02-08 08:45:52,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2025-02-08 08:45:52,084 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -129 predicate places. [2025-02-08 08:45:52,084 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 193 flow [2025-02-08 08:45:52,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2025-02-08 08:45:52,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:52,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:52,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:45:52,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:52,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:52,085 INFO L85 PathProgramCache]: Analyzing trace with hash -871423536, now seen corresponding path program 1 times [2025-02-08 08:45:52,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:52,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964125774] [2025-02-08 08:45:52,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:52,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:52,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:45:52,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:45:52,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:52,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:52,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:52,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964125774] [2025-02-08 08:45:52,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964125774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:52,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:52,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:52,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074254708] [2025-02-08 08:45:52,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:52,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:52,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:52,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:52,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:52,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 262 [2025-02-08 08:45:52,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 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) [2025-02-08 08:45:52,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:52,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 262 [2025-02-08 08:45:52,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:52,433 INFO L124 PetriNetUnfolderBase]: 211/660 cut-off events. [2025-02-08 08:45:52,433 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 08:45:52,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 660 events. 211/660 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3482 event pairs, 200 based on Foata normal form. 1/361 useless extension candidates. Maximal degree in co-relation 1154. Up to 472 conditions per place. [2025-02-08 08:45:52,436 INFO L140 encePairwiseOnDemand]: 258/262 looper letters, 54 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-02-08 08:45:52,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 89 transitions, 301 flow [2025-02-08 08:45:52,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2025-02-08 08:45:52,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4402035623409669 [2025-02-08 08:45:52,438 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 193 flow. Second operand 3 states and 346 transitions. [2025-02-08 08:45:52,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 89 transitions, 301 flow [2025-02-08 08:45:52,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 89 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:52,440 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 189 flow [2025-02-08 08:45:52,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2025-02-08 08:45:52,441 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -131 predicate places. [2025-02-08 08:45:52,441 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 189 flow [2025-02-08 08:45:52,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 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) [2025-02-08 08:45:52,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:52,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:52,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:45:52,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:52,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:52,444 INFO L85 PathProgramCache]: Analyzing trace with hash -871423535, now seen corresponding path program 1 times [2025-02-08 08:45:52,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:52,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44931520] [2025-02-08 08:45:52,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:52,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:52,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:45:52,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:45:52,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:52,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:52,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:52,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44931520] [2025-02-08 08:45:52,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44931520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:52,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:52,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:52,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809832763] [2025-02-08 08:45:52,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:52,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:52,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:52,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:52,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:52,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 262 [2025-02-08 08:45:52,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 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) [2025-02-08 08:45:52,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:52,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 262 [2025-02-08 08:45:52,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:52,785 INFO L124 PetriNetUnfolderBase]: 211/658 cut-off events. [2025-02-08 08:45:52,785 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 08:45:52,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 658 events. 211/658 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3492 event pairs, 200 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 1152. Up to 472 conditions per place. [2025-02-08 08:45:52,788 INFO L140 encePairwiseOnDemand]: 258/262 looper letters, 54 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2025-02-08 08:45:52,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 87 transitions, 297 flow [2025-02-08 08:45:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2025-02-08 08:45:52,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4402035623409669 [2025-02-08 08:45:52,790 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 189 flow. Second operand 3 states and 346 transitions. [2025-02-08 08:45:52,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 87 transitions, 297 flow [2025-02-08 08:45:52,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 87 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:52,791 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 185 flow [2025-02-08 08:45:52,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2025-02-08 08:45:52,792 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -133 predicate places. [2025-02-08 08:45:52,792 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 185 flow [2025-02-08 08:45:52,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 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) [2025-02-08 08:45:52,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:52,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:52,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:45:52,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:52,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:52,793 INFO L85 PathProgramCache]: Analyzing trace with hash -871421299, now seen corresponding path program 1 times [2025-02-08 08:45:52,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:52,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162371306] [2025-02-08 08:45:52,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:52,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:52,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:45:52,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:45:52,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:52,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:52,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:52,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:52,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162371306] [2025-02-08 08:45:52,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162371306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:52,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:52,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392613392] [2025-02-08 08:45:52,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:52,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:52,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:52,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:52,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:52,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 262 [2025-02-08 08:45:52,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2025-02-08 08:45:52,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:52,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 262 [2025-02-08 08:45:52,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:52,958 INFO L124 PetriNetUnfolderBase]: 211/655 cut-off events. [2025-02-08 08:45:52,959 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 08:45:52,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 655 events. 211/655 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3485 event pairs, 200 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 1148. Up to 472 conditions per place. [2025-02-08 08:45:52,961 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 53 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-02-08 08:45:52,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 289 flow [2025-02-08 08:45:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2025-02-08 08:45:52,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44529262086513993 [2025-02-08 08:45:52,963 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 185 flow. Second operand 3 states and 350 transitions. [2025-02-08 08:45:52,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 84 transitions, 289 flow [2025-02-08 08:45:52,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 84 transitions, 285 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:52,964 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 179 flow [2025-02-08 08:45:52,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2025-02-08 08:45:52,965 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -136 predicate places. [2025-02-08 08:45:52,965 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 179 flow [2025-02-08 08:45:52,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2025-02-08 08:45:52,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:52,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:52,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:45:52,966 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:52,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash 80664290, now seen corresponding path program 1 times [2025-02-08 08:45:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:52,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870144160] [2025-02-08 08:45:52,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:52,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:52,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:45:52,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:45:52,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:52,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:53,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:53,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870144160] [2025-02-08 08:45:53,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870144160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:53,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:53,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41198955] [2025-02-08 08:45:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:53,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:53,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:53,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:53,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:53,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 262 [2025-02-08 08:45:53,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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) [2025-02-08 08:45:53,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:53,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 262 [2025-02-08 08:45:53,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:53,252 INFO L124 PetriNetUnfolderBase]: 211/651 cut-off events. [2025-02-08 08:45:53,252 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 08:45:53,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 651 events. 211/651 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3460 event pairs, 200 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1141. Up to 472 conditions per place. [2025-02-08 08:45:53,255 INFO L140 encePairwiseOnDemand]: 255/262 looper letters, 49 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2025-02-08 08:45:53,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 80 transitions, 275 flow [2025-02-08 08:45:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2025-02-08 08:45:53,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41603053435114506 [2025-02-08 08:45:53,259 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 179 flow. Second operand 4 states and 436 transitions. [2025-02-08 08:45:53,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 80 transitions, 275 flow [2025-02-08 08:45:53,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 80 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:53,261 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 173 flow [2025-02-08 08:45:53,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2025-02-08 08:45:53,264 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -139 predicate places. [2025-02-08 08:45:53,264 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 173 flow [2025-02-08 08:45:53,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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) [2025-02-08 08:45:53,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:53,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:53,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:45:53,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:53,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash 80664291, now seen corresponding path program 1 times [2025-02-08 08:45:53,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:53,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559921388] [2025-02-08 08:45:53,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:53,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:45:53,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:45:53,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:53,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:53,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:53,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:53,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559921388] [2025-02-08 08:45:53,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559921388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:53,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:53,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670693227] [2025-02-08 08:45:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:53,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:53,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:53,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:53,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 262 [2025-02-08 08:45:53,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 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) [2025-02-08 08:45:53,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:53,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 262 [2025-02-08 08:45:53,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:53,761 INFO L124 PetriNetUnfolderBase]: 211/650 cut-off events. [2025-02-08 08:45:53,761 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-02-08 08:45:53,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 650 events. 211/650 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3444 event pairs, 200 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1139. Up to 472 conditions per place. [2025-02-08 08:45:53,764 INFO L140 encePairwiseOnDemand]: 257/262 looper letters, 46 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2025-02-08 08:45:53,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 79 transitions, 271 flow [2025-02-08 08:45:53,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2025-02-08 08:45:53,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4150763358778626 [2025-02-08 08:45:53,766 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 173 flow. Second operand 4 states and 435 transitions. [2025-02-08 08:45:53,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 79 transitions, 271 flow [2025-02-08 08:45:53,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 79 transitions, 265 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:45:53,768 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 173 flow [2025-02-08 08:45:53,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2025-02-08 08:45:53,770 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -140 predicate places. [2025-02-08 08:45:53,770 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 173 flow [2025-02-08 08:45:53,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 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) [2025-02-08 08:45:53,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:53,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:53,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:45:53,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:53,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:53,771 INFO L85 PathProgramCache]: Analyzing trace with hash 209032665, now seen corresponding path program 1 times [2025-02-08 08:45:53,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:53,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664252566] [2025-02-08 08:45:53,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:53,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:53,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:45:53,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:45:53,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:53,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664252566] [2025-02-08 08:45:53,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664252566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:53,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:53,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:53,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289728882] [2025-02-08 08:45:53,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:53,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:53,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:53,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:53,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:54,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 262 [2025-02-08 08:45:54,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 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) [2025-02-08 08:45:54,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:54,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 262 [2025-02-08 08:45:54,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:54,160 INFO L124 PetriNetUnfolderBase]: 211/649 cut-off events. [2025-02-08 08:45:54,161 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-02-08 08:45:54,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 649 events. 211/649 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3451 event pairs, 200 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1138. Up to 472 conditions per place. [2025-02-08 08:45:54,163 INFO L140 encePairwiseOnDemand]: 257/262 looper letters, 45 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2025-02-08 08:45:54,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 78 transitions, 269 flow [2025-02-08 08:45:54,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2025-02-08 08:45:54,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41412213740458015 [2025-02-08 08:45:54,165 INFO L175 Difference]: Start difference. First operand has 84 places, 79 transitions, 173 flow. Second operand 4 states and 434 transitions. [2025-02-08 08:45:54,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 78 transitions, 269 flow [2025-02-08 08:45:54,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 78 transitions, 261 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:45:54,166 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 171 flow [2025-02-08 08:45:54,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2025-02-08 08:45:54,167 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -141 predicate places. [2025-02-08 08:45:54,167 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 171 flow [2025-02-08 08:45:54,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 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) [2025-02-08 08:45:54,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:54,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:54,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:45:54,167 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:54,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash -983013463, now seen corresponding path program 1 times [2025-02-08 08:45:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:54,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889006823] [2025-02-08 08:45:54,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:54,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:54,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:45:54,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:45:54,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:54,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:54,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:54,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889006823] [2025-02-08 08:45:54,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889006823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:54,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:54,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:54,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938534031] [2025-02-08 08:45:54,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:54,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:54,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:54,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:54,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:54,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 262 [2025-02-08 08:45:54,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 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) [2025-02-08 08:45:54,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:54,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 262 [2025-02-08 08:45:54,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:54,584 INFO L124 PetriNetUnfolderBase]: 211/648 cut-off events. [2025-02-08 08:45:54,584 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 08:45:54,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 648 events. 211/648 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3447 event pairs, 200 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1136. Up to 472 conditions per place. [2025-02-08 08:45:54,586 INFO L140 encePairwiseOnDemand]: 257/262 looper letters, 44 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-02-08 08:45:54,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 77 transitions, 265 flow [2025-02-08 08:45:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2025-02-08 08:45:54,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4131679389312977 [2025-02-08 08:45:54,588 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 171 flow. Second operand 4 states and 433 transitions. [2025-02-08 08:45:54,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 77 transitions, 265 flow [2025-02-08 08:45:54,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 257 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:45:54,589 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 169 flow [2025-02-08 08:45:54,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2025-02-08 08:45:54,590 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -142 predicate places. [2025-02-08 08:45:54,590 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 169 flow [2025-02-08 08:45:54,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 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) [2025-02-08 08:45:54,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:54,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:54,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:45:54,590 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:54,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash 216921707, now seen corresponding path program 1 times [2025-02-08 08:45:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:54,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123146609] [2025-02-08 08:45:54,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:54,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:45:54,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:45:54,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:54,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:54,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:54,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123146609] [2025-02-08 08:45:54,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123146609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:54,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:54,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:54,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585159379] [2025-02-08 08:45:54,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:54,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:54,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:54,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:54,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:54,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 262 [2025-02-08 08:45:54,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 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) [2025-02-08 08:45:54,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:54,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 262 [2025-02-08 08:45:54,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:54,946 INFO L124 PetriNetUnfolderBase]: 211/647 cut-off events. [2025-02-08 08:45:54,946 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 08:45:54,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 647 events. 211/647 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3445 event pairs, 200 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1134. Up to 472 conditions per place. [2025-02-08 08:45:54,948 INFO L140 encePairwiseOnDemand]: 258/262 looper letters, 44 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2025-02-08 08:45:54,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 261 flow [2025-02-08 08:45:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2025-02-08 08:45:54,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4122137404580153 [2025-02-08 08:45:54,949 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 169 flow. Second operand 4 states and 432 transitions. [2025-02-08 08:45:54,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 261 flow [2025-02-08 08:45:54,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 76 transitions, 253 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:45:54,950 INFO L231 Difference]: Finished difference. Result has 81 places, 76 transitions, 165 flow [2025-02-08 08:45:54,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=81, PETRI_TRANSITIONS=76} [2025-02-08 08:45:54,951 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -143 predicate places. [2025-02-08 08:45:54,951 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 76 transitions, 165 flow [2025-02-08 08:45:54,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 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) [2025-02-08 08:45:54,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:54,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:54,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:45:54,951 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:54,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:54,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1609523148, now seen corresponding path program 1 times [2025-02-08 08:45:54,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:54,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090669031] [2025-02-08 08:45:54,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:54,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:54,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:45:54,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:45:54,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:54,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:55,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:55,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090669031] [2025-02-08 08:45:55,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090669031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:55,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:55,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:55,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301229850] [2025-02-08 08:45:55,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:55,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:55,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:55,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:55,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:55,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 262 [2025-02-08 08:45:55,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 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) [2025-02-08 08:45:55,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:55,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 262 [2025-02-08 08:45:55,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:55,431 INFO L124 PetriNetUnfolderBase]: 210/650 cut-off events. [2025-02-08 08:45:55,431 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:45:55,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 650 events. 210/650 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3595 event pairs, 8 based on Foata normal form. 10/376 useless extension candidates. Maximal degree in co-relation 1135. Up to 416 conditions per place. [2025-02-08 08:45:55,434 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 60 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2025-02-08 08:45:55,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 92 transitions, 325 flow [2025-02-08 08:45:55,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2025-02-08 08:45:55,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43320610687022904 [2025-02-08 08:45:55,435 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 165 flow. Second operand 4 states and 454 transitions. [2025-02-08 08:45:55,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 92 transitions, 325 flow [2025-02-08 08:45:55,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 92 transitions, 319 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:45:55,439 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 177 flow [2025-02-08 08:45:55,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2025-02-08 08:45:55,440 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -142 predicate places. [2025-02-08 08:45:55,440 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 177 flow [2025-02-08 08:45:55,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 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) [2025-02-08 08:45:55,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:55,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:55,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:45:55,440 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:55,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1609523149, now seen corresponding path program 1 times [2025-02-08 08:45:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:55,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122149952] [2025-02-08 08:45:55,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:55,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:55,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:45:55,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:45:55,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:55,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:55,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:55,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122149952] [2025-02-08 08:45:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122149952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:55,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:55,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:55,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873587918] [2025-02-08 08:45:55,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:55,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:55,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:55,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:55,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:55,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 262 [2025-02-08 08:45:55,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 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) [2025-02-08 08:45:55,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:55,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 262 [2025-02-08 08:45:55,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:55,775 INFO L124 PetriNetUnfolderBase]: 226/690 cut-off events. [2025-02-08 08:45:55,775 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 08:45:55,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 690 events. 226/690 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3948 event pairs, 189 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 1307. Up to 453 conditions per place. [2025-02-08 08:45:55,778 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 74 selfloop transitions, 4 changer transitions 4/106 dead transitions. [2025-02-08 08:45:55,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 106 transitions, 417 flow [2025-02-08 08:45:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2025-02-08 08:45:55,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4643765903307888 [2025-02-08 08:45:55,780 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 177 flow. Second operand 3 states and 365 transitions. [2025-02-08 08:45:55,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 106 transitions, 417 flow [2025-02-08 08:45:55,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 106 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:55,782 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 200 flow [2025-02-08 08:45:55,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2025-02-08 08:45:55,782 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -140 predicate places. [2025-02-08 08:45:55,782 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 200 flow [2025-02-08 08:45:55,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 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) [2025-02-08 08:45:55,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:55,782 INFO L206 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] [2025-02-08 08:45:55,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:45:55,783 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:55,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash -318653912, now seen corresponding path program 1 times [2025-02-08 08:45:55,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:55,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6097841] [2025-02-08 08:45:55,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:55,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:45:55,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:45:55,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:55,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:55,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:55,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6097841] [2025-02-08 08:45:55,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6097841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:55,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:55,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:55,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114409000] [2025-02-08 08:45:55,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:55,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:45:55,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:55,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:45:55,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:45:56,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 262 [2025-02-08 08:45:56,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 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) [2025-02-08 08:45:56,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:56,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 262 [2025-02-08 08:45:56,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:56,239 INFO L124 PetriNetUnfolderBase]: 238/716 cut-off events. [2025-02-08 08:45:56,239 INFO L125 PetriNetUnfolderBase]: For 142/143 co-relation queries the response was YES. [2025-02-08 08:45:56,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 716 events. 238/716 cut-off events. For 142/143 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3931 event pairs, 201 based on Foata normal form. 1/468 useless extension candidates. Maximal degree in co-relation 1409. Up to 445 conditions per place. [2025-02-08 08:45:56,242 INFO L140 encePairwiseOnDemand]: 258/262 looper letters, 70 selfloop transitions, 3 changer transitions 4/103 dead transitions. [2025-02-08 08:45:56,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 103 transitions, 414 flow [2025-02-08 08:45:56,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2025-02-08 08:45:56,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43225190839694655 [2025-02-08 08:45:56,243 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 200 flow. Second operand 4 states and 453 transitions. [2025-02-08 08:45:56,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 103 transitions, 414 flow [2025-02-08 08:45:56,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 103 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:56,245 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 196 flow [2025-02-08 08:45:56,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2025-02-08 08:45:56,245 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -140 predicate places. [2025-02-08 08:45:56,246 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 196 flow [2025-02-08 08:45:56,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 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) [2025-02-08 08:45:56,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:56,246 INFO L206 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] [2025-02-08 08:45:56,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:45:56,246 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:56,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:56,246 INFO L85 PathProgramCache]: Analyzing trace with hash -318653911, now seen corresponding path program 1 times [2025-02-08 08:45:56,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:56,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449957727] [2025-02-08 08:45:56,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:56,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:56,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:45:56,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:45:56,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:56,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:56,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:56,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449957727] [2025-02-08 08:45:56,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449957727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:56,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:56,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:45:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404608515] [2025-02-08 08:45:56,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:56,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:45:56,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:56,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:45:56,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:45:57,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 262 [2025-02-08 08:45:57,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 196 flow. Second operand has 9 states, 9 states have (on average 94.77777777777777) internal successors, (853), 9 states have internal predecessors, (853), 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) [2025-02-08 08:45:57,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:57,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 262 [2025-02-08 08:45:57,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:58,028 INFO L124 PetriNetUnfolderBase]: 209/590 cut-off events. [2025-02-08 08:45:58,028 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-02-08 08:45:58,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 590 events. 209/590 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2869 event pairs, 0 based on Foata normal form. 27/412 useless extension candidates. Maximal degree in co-relation 1106. Up to 343 conditions per place. [2025-02-08 08:45:58,030 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 93 selfloop transitions, 13 changer transitions 0/129 dead transitions. [2025-02-08 08:45:58,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 129 transitions, 517 flow [2025-02-08 08:45:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:45:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:45:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1040 transitions. [2025-02-08 08:45:58,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3969465648854962 [2025-02-08 08:45:58,033 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 196 flow. Second operand 10 states and 1040 transitions. [2025-02-08 08:45:58,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 129 transitions, 517 flow [2025-02-08 08:45:58,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 129 transitions, 508 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 08:45:58,034 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 206 flow [2025-02-08 08:45:58,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=206, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2025-02-08 08:45:58,035 INFO L279 CegarLoopForPetriNet]: 224 programPoint places, -140 predicate places. [2025-02-08 08:45:58,035 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 206 flow [2025-02-08 08:45:58,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.77777777777777) internal successors, (853), 9 states have internal predecessors, (853), 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) [2025-02-08 08:45:58,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:58,035 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:58,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:45:58,036 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 90 more)] === [2025-02-08 08:45:58,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1290978204, now seen corresponding path program 1 times [2025-02-08 08:45:58,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:58,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002661190] [2025-02-08 08:45:58,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:58,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:45:58,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:45:58,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:58,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:45:58,081 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:45:58,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:45:58,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:45:58,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:58,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:45:58,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:45:58,143 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:45:58,144 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (89 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK (86 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 93 remaining) [2025-02-08 08:45:58,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 93 remaining) [2025-02-08 08:45:58,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (49 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (48 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK (45 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 93 remaining) [2025-02-08 08:45:58,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (26 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (9 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (8 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 93 remaining) [2025-02-08 08:45:58,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 93 remaining) [2025-02-08 08:45:58,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 93 remaining) [2025-02-08 08:45:58,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 93 remaining) [2025-02-08 08:45:58,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 93 remaining) [2025-02-08 08:45:58,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 93 remaining) [2025-02-08 08:45:58,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 93 remaining) [2025-02-08 08:45:58,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:45:58,152 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:58,154 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:45:58,154 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:45:58,231 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:45:58,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 276 transitions, 568 flow [2025-02-08 08:45:58,271 INFO L124 PetriNetUnfolderBase]: 137/876 cut-off events. [2025-02-08 08:45:58,271 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 08:45:58,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 876 events. 137/876 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4296 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 464. Up to 12 conditions per place. [2025-02-08 08:45:58,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 238 places, 276 transitions, 568 flow [2025-02-08 08:45:58,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 276 transitions, 568 flow [2025-02-08 08:45:58,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:45:58,278 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@442a67f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:45:58,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 97 error locations. [2025-02-08 08:45:58,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:45:58,279 INFO L124 PetriNetUnfolderBase]: 6/18 cut-off events. [2025-02-08 08:45:58,279 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:45:58,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:58,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:45:58,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:45:58,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:58,280 INFO L85 PathProgramCache]: Analyzing trace with hash 66550520, now seen corresponding path program 1 times [2025-02-08 08:45:58,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:58,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492379526] [2025-02-08 08:45:58,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:58,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:58,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:45:58,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:45:58,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:58,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:58,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:58,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492379526] [2025-02-08 08:45:58,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492379526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:58,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:58,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382244060] [2025-02-08 08:45:58,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:58,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:45:58,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:58,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:45:58,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:45:58,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 276 [2025-02-08 08:45:58,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 276 transitions, 568 flow. Second operand has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 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) [2025-02-08 08:45:58,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:58,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 276 [2025-02-08 08:45:58,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:58,904 INFO L124 PetriNetUnfolderBase]: 4183/8056 cut-off events. [2025-02-08 08:45:58,904 INFO L125 PetriNetUnfolderBase]: For 79/84 co-relation queries the response was YES. [2025-02-08 08:45:58,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14902 conditions, 8056 events. 4183/8056 cut-off events. For 79/84 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 58318 event pairs, 4072 based on Foata normal form. 8/4532 useless extension candidates. Maximal degree in co-relation 12151. Up to 6794 conditions per place. [2025-02-08 08:45:58,933 INFO L140 encePairwiseOnDemand]: 263/276 looper letters, 67 selfloop transitions, 0 changer transitions 0/107 dead transitions. [2025-02-08 08:45:58,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 107 transitions, 364 flow [2025-02-08 08:45:58,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:45:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 08:45:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 282 transitions. [2025-02-08 08:45:58,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2025-02-08 08:45:58,935 INFO L175 Difference]: Start difference. First operand has 238 places, 276 transitions, 568 flow. Second operand 2 states and 282 transitions. [2025-02-08 08:45:58,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 107 transitions, 364 flow [2025-02-08 08:45:58,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 107 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:45:58,936 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 230 flow [2025-02-08 08:45:58,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=230, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2025-02-08 08:45:58,937 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -128 predicate places. [2025-02-08 08:45:58,937 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 230 flow [2025-02-08 08:45:58,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 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) [2025-02-08 08:45:58,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:58,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:45:58,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:45:58,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:45:58,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2063035082, now seen corresponding path program 1 times [2025-02-08 08:45:58,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:58,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371577940] [2025-02-08 08:45:58,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:58,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:58,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:45:58,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:45:58,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:58,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:58,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371577940] [2025-02-08 08:45:58,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371577940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:58,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:58,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:58,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983717641] [2025-02-08 08:45:58,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:58,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:58,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:58,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:58,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:58,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 276 [2025-02-08 08:45:58,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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) [2025-02-08 08:45:58,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:58,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 276 [2025-02-08 08:45:58,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:59,603 INFO L124 PetriNetUnfolderBase]: 4183/8053 cut-off events. [2025-02-08 08:45:59,603 INFO L125 PetriNetUnfolderBase]: For 79/84 co-relation queries the response was YES. [2025-02-08 08:45:59,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14899 conditions, 8053 events. 4183/8053 cut-off events. For 79/84 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 58242 event pairs, 4072 based on Foata normal form. 1/4522 useless extension candidates. Maximal degree in co-relation 14894. Up to 6775 conditions per place. [2025-02-08 08:45:59,641 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 64 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2025-02-08 08:45:59,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 104 transitions, 356 flow [2025-02-08 08:45:59,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2025-02-08 08:45:59,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4468599033816425 [2025-02-08 08:45:59,643 INFO L175 Difference]: Start difference. First operand has 110 places, 107 transitions, 230 flow. Second operand 3 states and 370 transitions. [2025-02-08 08:45:59,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 104 transitions, 356 flow [2025-02-08 08:45:59,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 104 transitions, 356 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:45:59,644 INFO L231 Difference]: Finished difference. Result has 109 places, 104 transitions, 228 flow [2025-02-08 08:45:59,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=109, PETRI_TRANSITIONS=104} [2025-02-08 08:45:59,646 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -129 predicate places. [2025-02-08 08:45:59,646 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 104 transitions, 228 flow [2025-02-08 08:45:59,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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) [2025-02-08 08:45:59,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:59,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:59,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:45:59,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:45:59,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1179128880, now seen corresponding path program 1 times [2025-02-08 08:45:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:59,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153871822] [2025-02-08 08:45:59,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:59,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:59,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:45:59,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:45:59,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:59,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:59,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:59,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153871822] [2025-02-08 08:45:59,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153871822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:59,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:59,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:59,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312571252] [2025-02-08 08:45:59,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:59,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:59,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:59,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:59,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:59,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2025-02-08 08:45:59,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 104 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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) [2025-02-08 08:45:59,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:59,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2025-02-08 08:45:59,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:00,440 INFO L124 PetriNetUnfolderBase]: 4183/8036 cut-off events. [2025-02-08 08:46:00,441 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-08 08:46:00,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14885 conditions, 8036 events. 4183/8036 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 58084 event pairs, 4072 based on Foata normal form. 1/4515 useless extension candidates. Maximal degree in co-relation 14879. Up to 6775 conditions per place. [2025-02-08 08:46:00,466 INFO L140 encePairwiseOnDemand]: 272/276 looper letters, 64 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2025-02-08 08:46:00,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 102 transitions, 356 flow [2025-02-08 08:46:00,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:46:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:46:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2025-02-08 08:46:00,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44082125603864736 [2025-02-08 08:46:00,468 INFO L175 Difference]: Start difference. First operand has 109 places, 104 transitions, 228 flow. Second operand 3 states and 365 transitions. [2025-02-08 08:46:00,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 102 transitions, 356 flow [2025-02-08 08:46:00,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:00,469 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 224 flow [2025-02-08 08:46:00,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2025-02-08 08:46:00,470 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -131 predicate places. [2025-02-08 08:46:00,470 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 224 flow [2025-02-08 08:46:00,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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) [2025-02-08 08:46:00,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:00,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:00,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 08:46:00,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:00,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:00,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1179128879, now seen corresponding path program 1 times [2025-02-08 08:46:00,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:00,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770744348] [2025-02-08 08:46:00,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:00,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:00,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:46:00,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:46:00,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:00,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:00,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:00,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770744348] [2025-02-08 08:46:00,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770744348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:00,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:00,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:46:00,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831940943] [2025-02-08 08:46:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:00,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:46:00,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:00,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:46:00,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:46:00,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2025-02-08 08:46:00,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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) [2025-02-08 08:46:00,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:00,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2025-02-08 08:46:00,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:00,998 INFO L124 PetriNetUnfolderBase]: 4183/8034 cut-off events. [2025-02-08 08:46:00,998 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-08 08:46:01,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14883 conditions, 8034 events. 4183/8034 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 58175 event pairs, 4072 based on Foata normal form. 1/4514 useless extension candidates. Maximal degree in co-relation 14877. Up to 6775 conditions per place. [2025-02-08 08:46:01,035 INFO L140 encePairwiseOnDemand]: 272/276 looper letters, 64 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-02-08 08:46:01,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 100 transitions, 352 flow [2025-02-08 08:46:01,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:46:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:46:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2025-02-08 08:46:01,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44082125603864736 [2025-02-08 08:46:01,037 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 224 flow. Second operand 3 states and 365 transitions. [2025-02-08 08:46:01,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 100 transitions, 352 flow [2025-02-08 08:46:01,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 100 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:01,039 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 220 flow [2025-02-08 08:46:01,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2025-02-08 08:46:01,040 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -133 predicate places. [2025-02-08 08:46:01,040 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 220 flow [2025-02-08 08:46:01,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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) [2025-02-08 08:46:01,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:01,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:01,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:46:01,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:01,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1179126643, now seen corresponding path program 1 times [2025-02-08 08:46:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:01,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15295525] [2025-02-08 08:46:01,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:01,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:46:01,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:46:01,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:01,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:01,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:01,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15295525] [2025-02-08 08:46:01,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15295525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:01,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:01,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:01,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864203322] [2025-02-08 08:46:01,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:01,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:46:01,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:01,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:46:01,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:46:01,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 276 [2025-02-08 08:46:01,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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) [2025-02-08 08:46:01,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:01,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 276 [2025-02-08 08:46:01,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:01,510 INFO L124 PetriNetUnfolderBase]: 4183/8031 cut-off events. [2025-02-08 08:46:01,510 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-08 08:46:01,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14879 conditions, 8031 events. 4183/8031 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 58145 event pairs, 4072 based on Foata normal form. 1/4511 useless extension candidates. Maximal degree in co-relation 14873. Up to 6775 conditions per place. [2025-02-08 08:46:01,543 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 63 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2025-02-08 08:46:01,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 97 transitions, 344 flow [2025-02-08 08:46:01,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:46:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:46:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2025-02-08 08:46:01,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44565217391304346 [2025-02-08 08:46:01,544 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 220 flow. Second operand 3 states and 369 transitions. [2025-02-08 08:46:01,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 97 transitions, 344 flow [2025-02-08 08:46:01,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 97 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:01,546 INFO L231 Difference]: Finished difference. Result has 102 places, 97 transitions, 214 flow [2025-02-08 08:46:01,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=102, PETRI_TRANSITIONS=97} [2025-02-08 08:46:01,547 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -136 predicate places. [2025-02-08 08:46:01,547 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 97 transitions, 214 flow [2025-02-08 08:46:01,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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) [2025-02-08 08:46:01,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:01,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:01,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 08:46:01,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:01,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:01,547 INFO L85 PathProgramCache]: Analyzing trace with hash 728580962, now seen corresponding path program 1 times [2025-02-08 08:46:01,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:01,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730545204] [2025-02-08 08:46:01,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:01,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:01,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:46:01,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:46:01,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:01,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:01,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:01,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730545204] [2025-02-08 08:46:01,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730545204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:01,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:01,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:46:01,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202614423] [2025-02-08 08:46:01,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:01,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:01,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:01,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:01,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:46:01,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 276 [2025-02-08 08:46:01,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 97 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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) [2025-02-08 08:46:01,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:01,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 276 [2025-02-08 08:46:01,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:02,128 INFO L124 PetriNetUnfolderBase]: 4183/8027 cut-off events. [2025-02-08 08:46:02,129 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-08 08:46:02,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14872 conditions, 8027 events. 4183/8027 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 58112 event pairs, 4072 based on Foata normal form. 0/4510 useless extension candidates. Maximal degree in co-relation 14866. Up to 6775 conditions per place. [2025-02-08 08:46:02,150 INFO L140 encePairwiseOnDemand]: 269/276 looper letters, 59 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2025-02-08 08:46:02,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 93 transitions, 330 flow [2025-02-08 08:46:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2025-02-08 08:46:02,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4148550724637681 [2025-02-08 08:46:02,152 INFO L175 Difference]: Start difference. First operand has 102 places, 97 transitions, 214 flow. Second operand 4 states and 458 transitions. [2025-02-08 08:46:02,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 93 transitions, 330 flow [2025-02-08 08:46:02,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 93 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:02,154 INFO L231 Difference]: Finished difference. Result has 99 places, 93 transitions, 208 flow [2025-02-08 08:46:02,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2025-02-08 08:46:02,154 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -139 predicate places. [2025-02-08 08:46:02,154 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 208 flow [2025-02-08 08:46:02,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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) [2025-02-08 08:46:02,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:02,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:02,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 08:46:02,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:02,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash 728580963, now seen corresponding path program 1 times [2025-02-08 08:46:02,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:02,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124152530] [2025-02-08 08:46:02,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:02,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:02,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:46:02,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:46:02,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:02,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:02,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:02,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124152530] [2025-02-08 08:46:02,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124152530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:02,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:02,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:02,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494890515] [2025-02-08 08:46:02,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:02,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:02,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:02,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:02,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:46:02,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2025-02-08 08:46:02,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 93 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 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) [2025-02-08 08:46:02,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:02,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2025-02-08 08:46:02,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:02,737 INFO L124 PetriNetUnfolderBase]: 4183/8026 cut-off events. [2025-02-08 08:46:02,737 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-02-08 08:46:02,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14870 conditions, 8026 events. 4183/8026 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 58254 event pairs, 4072 based on Foata normal form. 0/4510 useless extension candidates. Maximal degree in co-relation 14864. Up to 6775 conditions per place. [2025-02-08 08:46:02,836 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 56 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2025-02-08 08:46:02,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 92 transitions, 326 flow [2025-02-08 08:46:02,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2025-02-08 08:46:02,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41394927536231885 [2025-02-08 08:46:02,838 INFO L175 Difference]: Start difference. First operand has 99 places, 93 transitions, 208 flow. Second operand 4 states and 457 transitions. [2025-02-08 08:46:02,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 92 transitions, 326 flow [2025-02-08 08:46:02,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 320 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:46:02,842 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 208 flow [2025-02-08 08:46:02,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2025-02-08 08:46:02,843 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -140 predicate places. [2025-02-08 08:46:02,846 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 208 flow [2025-02-08 08:46:02,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 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) [2025-02-08 08:46:02,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:02,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:02,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 08:46:02,847 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:02,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash 86705369, now seen corresponding path program 1 times [2025-02-08 08:46:02,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:02,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174575456] [2025-02-08 08:46:02,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:02,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:02,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:46:02,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:46:02,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:02,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:02,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:02,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174575456] [2025-02-08 08:46:02,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174575456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:02,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:02,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:02,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993556288] [2025-02-08 08:46:02,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:02,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:02,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:02,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:02,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:46:03,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2025-02-08 08:46:03,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 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) [2025-02-08 08:46:03,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:03,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2025-02-08 08:46:03,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:03,695 INFO L124 PetriNetUnfolderBase]: 4183/8025 cut-off events. [2025-02-08 08:46:03,695 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-02-08 08:46:03,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14869 conditions, 8025 events. 4183/8025 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 58174 event pairs, 4072 based on Foata normal form. 0/4510 useless extension candidates. Maximal degree in co-relation 14863. Up to 6775 conditions per place. [2025-02-08 08:46:03,724 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 55 selfloop transitions, 4 changer transitions 0/91 dead transitions. [2025-02-08 08:46:03,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 91 transitions, 324 flow [2025-02-08 08:46:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2025-02-08 08:46:03,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2025-02-08 08:46:03,726 INFO L175 Difference]: Start difference. First operand has 98 places, 92 transitions, 208 flow. Second operand 4 states and 456 transitions. [2025-02-08 08:46:03,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 91 transitions, 324 flow [2025-02-08 08:46:03,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 91 transitions, 316 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:46:03,728 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 206 flow [2025-02-08 08:46:03,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=94, 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=4, PETRI_FLOW=206, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2025-02-08 08:46:03,728 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -141 predicate places. [2025-02-08 08:46:03,728 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 206 flow [2025-02-08 08:46:03,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 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) [2025-02-08 08:46:03,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:03,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:03,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 08:46:03,728 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:03,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:03,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1719548201, now seen corresponding path program 1 times [2025-02-08 08:46:03,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:03,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072765721] [2025-02-08 08:46:03,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:03,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:03,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:46:03,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:46:03,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:03,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:03,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:03,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072765721] [2025-02-08 08:46:03,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072765721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:03,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:03,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:03,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427678039] [2025-02-08 08:46:03,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:03,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:03,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:03,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:03,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:46:03,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2025-02-08 08:46:03,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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) [2025-02-08 08:46:03,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:03,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2025-02-08 08:46:03,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:04,479 INFO L124 PetriNetUnfolderBase]: 4183/8024 cut-off events. [2025-02-08 08:46:04,480 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-08 08:46:04,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14867 conditions, 8024 events. 4183/8024 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 58167 event pairs, 4072 based on Foata normal form. 0/4510 useless extension candidates. Maximal degree in co-relation 14861. Up to 6775 conditions per place. [2025-02-08 08:46:04,502 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 54 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2025-02-08 08:46:04,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 90 transitions, 320 flow [2025-02-08 08:46:04,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2025-02-08 08:46:04,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4121376811594203 [2025-02-08 08:46:04,504 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 206 flow. Second operand 4 states and 455 transitions. [2025-02-08 08:46:04,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 90 transitions, 320 flow [2025-02-08 08:46:04,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 90 transitions, 312 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:46:04,505 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 204 flow [2025-02-08 08:46:04,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2025-02-08 08:46:04,506 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -142 predicate places. [2025-02-08 08:46:04,506 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 204 flow [2025-02-08 08:46:04,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 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) [2025-02-08 08:46:04,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:04,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:04,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 08:46:04,506 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:04,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1076524437, now seen corresponding path program 1 times [2025-02-08 08:46:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033567733] [2025-02-08 08:46:04,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:04,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:46:04,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:46:04,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:04,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:04,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:04,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033567733] [2025-02-08 08:46:04,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033567733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:04,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:04,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:04,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809653931] [2025-02-08 08:46:04,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:04,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:04,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:04,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:04,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:46:04,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2025-02-08 08:46:04,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 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) [2025-02-08 08:46:04,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:04,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2025-02-08 08:46:04,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:05,063 INFO L124 PetriNetUnfolderBase]: 4183/8023 cut-off events. [2025-02-08 08:46:05,063 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-08 08:46:05,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14865 conditions, 8023 events. 4183/8023 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 58124 event pairs, 4072 based on Foata normal form. 0/4510 useless extension candidates. Maximal degree in co-relation 14859. Up to 6775 conditions per place. [2025-02-08 08:46:05,089 INFO L140 encePairwiseOnDemand]: 272/276 looper letters, 54 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2025-02-08 08:46:05,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 89 transitions, 316 flow [2025-02-08 08:46:05,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2025-02-08 08:46:05,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.411231884057971 [2025-02-08 08:46:05,091 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 204 flow. Second operand 4 states and 454 transitions. [2025-02-08 08:46:05,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 89 transitions, 316 flow [2025-02-08 08:46:05,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 89 transitions, 308 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:46:05,092 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 200 flow [2025-02-08 08:46:05,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2025-02-08 08:46:05,093 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -143 predicate places. [2025-02-08 08:46:05,093 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 200 flow [2025-02-08 08:46:05,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 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) [2025-02-08 08:46:05,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:05,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:05,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 08:46:05,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:05,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:05,094 INFO L85 PathProgramCache]: Analyzing trace with hash -216745273, now seen corresponding path program 1 times [2025-02-08 08:46:05,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:05,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568833504] [2025-02-08 08:46:05,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:05,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:05,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:46:05,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:46:05,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:05,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:05,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:05,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568833504] [2025-02-08 08:46:05,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568833504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:05,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:05,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:05,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538659626] [2025-02-08 08:46:05,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:05,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:46:05,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:05,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:46:05,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:46:05,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 276 [2025-02-08 08:46:05,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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) [2025-02-08 08:46:05,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:05,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 276 [2025-02-08 08:46:05,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:05,682 INFO L124 PetriNetUnfolderBase]: 5186/10116 cut-off events. [2025-02-08 08:46:05,683 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-02-08 08:46:05,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18929 conditions, 10116 events. 5186/10116 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 79150 event pairs, 3667 based on Foata normal form. 0/5848 useless extension candidates. Maximal degree in co-relation 18923. Up to 6335 conditions per place. [2025-02-08 08:46:05,718 INFO L140 encePairwiseOnDemand]: 269/276 looper letters, 104 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-02-08 08:46:05,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 137 transitions, 525 flow [2025-02-08 08:46:05,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:46:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:46:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2025-02-08 08:46:05,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4855072463768116 [2025-02-08 08:46:05,720 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 200 flow. Second operand 3 states and 402 transitions. [2025-02-08 08:46:05,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 137 transitions, 525 flow [2025-02-08 08:46:05,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 137 transitions, 519 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:46:05,722 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 234 flow [2025-02-08 08:46:05,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2025-02-08 08:46:05,723 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -142 predicate places. [2025-02-08 08:46:05,723 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 234 flow [2025-02-08 08:46:05,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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) [2025-02-08 08:46:05,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:05,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:05,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 08:46:05,723 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:05,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:05,724 INFO L85 PathProgramCache]: Analyzing trace with hash -216745272, now seen corresponding path program 1 times [2025-02-08 08:46:05,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:05,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711451093] [2025-02-08 08:46:05,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:05,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:05,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:46:05,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:46:05,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:05,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:05,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:05,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711451093] [2025-02-08 08:46:05,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711451093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:05,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:05,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:46:05,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334591591] [2025-02-08 08:46:05,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:05,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:05,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:05,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:05,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:46:05,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 276 [2025-02-08 08:46:05,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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) [2025-02-08 08:46:05,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:05,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 276 [2025-02-08 08:46:05,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:06,460 INFO L124 PetriNetUnfolderBase]: 4850/9864 cut-off events. [2025-02-08 08:46:06,461 INFO L125 PetriNetUnfolderBase]: For 1804/1806 co-relation queries the response was YES. [2025-02-08 08:46:06,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19411 conditions, 9864 events. 4850/9864 cut-off events. For 1804/1806 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 81319 event pairs, 275 based on Foata normal form. 99/6442 useless extension candidates. Maximal degree in co-relation 19404. Up to 6979 conditions per place. [2025-02-08 08:46:06,491 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 92 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2025-02-08 08:46:06,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 129 transitions, 522 flow [2025-02-08 08:46:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2025-02-08 08:46:06,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44565217391304346 [2025-02-08 08:46:06,493 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 234 flow. Second operand 4 states and 492 transitions. [2025-02-08 08:46:06,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 129 transitions, 522 flow [2025-02-08 08:46:06,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 129 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:06,498 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 242 flow [2025-02-08 08:46:06,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2025-02-08 08:46:06,499 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -140 predicate places. [2025-02-08 08:46:06,499 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 242 flow [2025-02-08 08:46:06,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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) [2025-02-08 08:46:06,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:06,499 INFO L206 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] [2025-02-08 08:46:06,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 08:46:06,499 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:06,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:06,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1793740099, now seen corresponding path program 1 times [2025-02-08 08:46:06,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:06,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453190588] [2025-02-08 08:46:06,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:06,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:06,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:46:06,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:46:06,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:06,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:06,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:06,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453190588] [2025-02-08 08:46:06,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453190588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:06,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:06,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:46:06,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530213438] [2025-02-08 08:46:06,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:06,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:46:06,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:06,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:46:06,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:46:07,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 276 [2025-02-08 08:46:07,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 242 flow. Second operand has 9 states, 9 states have (on average 95.77777777777777) internal successors, (862), 9 states have internal predecessors, (862), 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) [2025-02-08 08:46:07,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:07,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 276 [2025-02-08 08:46:07,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:08,877 INFO L124 PetriNetUnfolderBase]: 5545/10033 cut-off events. [2025-02-08 08:46:08,877 INFO L125 PetriNetUnfolderBase]: For 1341/1361 co-relation queries the response was YES. [2025-02-08 08:46:08,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20659 conditions, 10033 events. 5545/10033 cut-off events. For 1341/1361 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 73474 event pairs, 240 based on Foata normal form. 328/7039 useless extension candidates. Maximal degree in co-relation 20650. Up to 5389 conditions per place. [2025-02-08 08:46:08,898 INFO L140 encePairwiseOnDemand]: 262/276 looper letters, 275 selfloop transitions, 34 changer transitions 0/335 dead transitions. [2025-02-08 08:46:08,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 335 transitions, 1445 flow [2025-02-08 08:46:08,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 08:46:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-08 08:46:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1828 transitions. [2025-02-08 08:46:08,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41394927536231885 [2025-02-08 08:46:08,901 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 242 flow. Second operand 16 states and 1828 transitions. [2025-02-08 08:46:08,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 335 transitions, 1445 flow [2025-02-08 08:46:08,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 335 transitions, 1425 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:08,905 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 481 flow [2025-02-08 08:46:08,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=481, PETRI_PLACES=119, PETRI_TRANSITIONS=118} [2025-02-08 08:46:08,906 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -119 predicate places. [2025-02-08 08:46:08,906 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 481 flow [2025-02-08 08:46:08,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.77777777777777) internal successors, (862), 9 states have internal predecessors, (862), 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) [2025-02-08 08:46:08,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:08,906 INFO L206 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] [2025-02-08 08:46:08,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 08:46:08,906 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:08,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:08,906 INFO L85 PathProgramCache]: Analyzing trace with hash 225618615, now seen corresponding path program 1 times [2025-02-08 08:46:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:08,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055599850] [2025-02-08 08:46:08,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:08,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:08,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:46:08,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:46:08,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:08,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:08,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:08,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055599850] [2025-02-08 08:46:08,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055599850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:08,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:08,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:46:08,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891538608] [2025-02-08 08:46:08,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:08,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:08,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:08,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:08,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:46:08,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 276 [2025-02-08 08:46:08,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 481 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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) [2025-02-08 08:46:08,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:08,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 276 [2025-02-08 08:46:08,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:09,670 INFO L124 PetriNetUnfolderBase]: 4350/9190 cut-off events. [2025-02-08 08:46:09,670 INFO L125 PetriNetUnfolderBase]: For 4756/4765 co-relation queries the response was YES. [2025-02-08 08:46:09,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19891 conditions, 9190 events. 4350/9190 cut-off events. For 4756/4765 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 76191 event pairs, 430 based on Foata normal form. 8/5937 useless extension candidates. Maximal degree in co-relation 19873. Up to 7159 conditions per place. [2025-02-08 08:46:09,710 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 108 selfloop transitions, 10 changer transitions 0/152 dead transitions. [2025-02-08 08:46:09,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 152 transitions, 867 flow [2025-02-08 08:46:09,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2025-02-08 08:46:09,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44021739130434784 [2025-02-08 08:46:09,712 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 481 flow. Second operand 4 states and 486 transitions. [2025-02-08 08:46:09,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 152 transitions, 867 flow [2025-02-08 08:46:09,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 152 transitions, 864 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:09,728 INFO L231 Difference]: Finished difference. Result has 121 places, 121 transitions, 534 flow [2025-02-08 08:46:09,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=534, PETRI_PLACES=121, PETRI_TRANSITIONS=121} [2025-02-08 08:46:09,728 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -117 predicate places. [2025-02-08 08:46:09,728 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 121 transitions, 534 flow [2025-02-08 08:46:09,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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) [2025-02-08 08:46:09,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:09,728 INFO L206 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] [2025-02-08 08:46:09,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 08:46:09,728 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:09,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1502281282, now seen corresponding path program 1 times [2025-02-08 08:46:09,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:09,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187764303] [2025-02-08 08:46:09,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:09,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:09,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:46:09,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:46:09,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:09,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:10,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:10,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187764303] [2025-02-08 08:46:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187764303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:10,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:10,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:46:10,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611975736] [2025-02-08 08:46:10,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:10,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:46:10,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:10,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:46:10,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:46:10,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 276 [2025-02-08 08:46:10,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 121 transitions, 534 flow. Second operand has 10 states, 10 states have (on average 95.8) internal successors, (958), 10 states have internal predecessors, (958), 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) [2025-02-08 08:46:10,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:10,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 276 [2025-02-08 08:46:10,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:11,732 INFO L124 PetriNetUnfolderBase]: 5956/11612 cut-off events. [2025-02-08 08:46:11,732 INFO L125 PetriNetUnfolderBase]: For 6699/6719 co-relation queries the response was YES. [2025-02-08 08:46:11,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25715 conditions, 11612 events. 5956/11612 cut-off events. For 6699/6719 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 94668 event pairs, 1772 based on Foata normal form. 7/7528 useless extension candidates. Maximal degree in co-relation 25696. Up to 4108 conditions per place. [2025-02-08 08:46:11,799 INFO L140 encePairwiseOnDemand]: 267/276 looper letters, 268 selfloop transitions, 28 changer transitions 0/327 dead transitions. [2025-02-08 08:46:11,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 327 transitions, 1805 flow [2025-02-08 08:46:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:46:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:46:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1200 transitions. [2025-02-08 08:46:11,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2025-02-08 08:46:11,802 INFO L175 Difference]: Start difference. First operand has 121 places, 121 transitions, 534 flow. Second operand 10 states and 1200 transitions. [2025-02-08 08:46:11,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 327 transitions, 1805 flow [2025-02-08 08:46:11,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 327 transitions, 1790 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:46:11,817 INFO L231 Difference]: Finished difference. Result has 132 places, 134 transitions, 697 flow [2025-02-08 08:46:11,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=697, PETRI_PLACES=132, PETRI_TRANSITIONS=134} [2025-02-08 08:46:11,818 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -106 predicate places. [2025-02-08 08:46:11,818 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 134 transitions, 697 flow [2025-02-08 08:46:11,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.8) internal successors, (958), 10 states have internal predecessors, (958), 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) [2025-02-08 08:46:11,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:11,819 INFO L206 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] [2025-02-08 08:46:11,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 08:46:11,819 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:11,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1502281283, now seen corresponding path program 1 times [2025-02-08 08:46:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:11,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116249719] [2025-02-08 08:46:11,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:11,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:46:11,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:46:11,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:11,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:11,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:11,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116249719] [2025-02-08 08:46:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116249719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:11,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:11,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:46:11,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041502984] [2025-02-08 08:46:11,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:11,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:46:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:11,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:46:11,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:46:12,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 276 [2025-02-08 08:46:12,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 134 transitions, 697 flow. Second operand has 7 states, 7 states have (on average 99.42857142857143) internal successors, (696), 7 states have internal predecessors, (696), 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) [2025-02-08 08:46:12,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:12,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 276 [2025-02-08 08:46:12,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:13,201 INFO L124 PetriNetUnfolderBase]: 5312/10743 cut-off events. [2025-02-08 08:46:13,202 INFO L125 PetriNetUnfolderBase]: For 11080/11100 co-relation queries the response was YES. [2025-02-08 08:46:13,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25863 conditions, 10743 events. 5312/10743 cut-off events. For 11080/11100 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 89684 event pairs, 1562 based on Foata normal form. 5/7592 useless extension candidates. Maximal degree in co-relation 25841. Up to 3748 conditions per place. [2025-02-08 08:46:13,234 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 183 selfloop transitions, 13 changer transitions 4/232 dead transitions. [2025-02-08 08:46:13,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 232 transitions, 1435 flow [2025-02-08 08:46:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:46:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:46:13,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 739 transitions. [2025-02-08 08:46:13,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.446256038647343 [2025-02-08 08:46:13,235 INFO L175 Difference]: Start difference. First operand has 132 places, 134 transitions, 697 flow. Second operand 6 states and 739 transitions. [2025-02-08 08:46:13,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 232 transitions, 1435 flow [2025-02-08 08:46:13,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 232 transitions, 1397 flow, removed 16 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:13,269 INFO L231 Difference]: Finished difference. Result has 137 places, 136 transitions, 726 flow [2025-02-08 08:46:13,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=726, PETRI_PLACES=137, PETRI_TRANSITIONS=136} [2025-02-08 08:46:13,270 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -101 predicate places. [2025-02-08 08:46:13,270 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 136 transitions, 726 flow [2025-02-08 08:46:13,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.42857142857143) internal successors, (696), 7 states have internal predecessors, (696), 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) [2025-02-08 08:46:13,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:13,270 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:13,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 08:46:13,270 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:13,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash -142935070, now seen corresponding path program 1 times [2025-02-08 08:46:13,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:13,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67568846] [2025-02-08 08:46:13,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:13,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:13,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:46:13,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:46:13,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:13,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:13,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:13,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67568846] [2025-02-08 08:46:13,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67568846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:13,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:13,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:46:13,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789099122] [2025-02-08 08:46:13,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:13,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:46:13,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:13,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:46:13,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:46:14,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 276 [2025-02-08 08:46:14,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 136 transitions, 726 flow. Second operand has 9 states, 9 states have (on average 98.11111111111111) internal successors, (883), 9 states have internal predecessors, (883), 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) [2025-02-08 08:46:14,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:14,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 276 [2025-02-08 08:46:14,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:15,973 INFO L124 PetriNetUnfolderBase]: 4177/7927 cut-off events. [2025-02-08 08:46:15,974 INFO L125 PetriNetUnfolderBase]: For 13101/13103 co-relation queries the response was YES. [2025-02-08 08:46:15,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18280 conditions, 7927 events. 4177/7927 cut-off events. For 13101/13103 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 55787 event pairs, 760 based on Foata normal form. 285/6044 useless extension candidates. Maximal degree in co-relation 18256. Up to 5243 conditions per place. [2025-02-08 08:46:16,049 INFO L140 encePairwiseOnDemand]: 268/276 looper letters, 168 selfloop transitions, 19 changer transitions 0/210 dead transitions. [2025-02-08 08:46:16,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 210 transitions, 1246 flow [2025-02-08 08:46:16,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:46:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:46:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1220 transitions. [2025-02-08 08:46:16,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4018445322793149 [2025-02-08 08:46:16,052 INFO L175 Difference]: Start difference. First operand has 137 places, 136 transitions, 726 flow. Second operand 11 states and 1220 transitions. [2025-02-08 08:46:16,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 210 transitions, 1246 flow [2025-02-08 08:46:16,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 210 transitions, 1068 flow, removed 24 selfloop flow, removed 18 redundant places. [2025-02-08 08:46:16,062 INFO L231 Difference]: Finished difference. Result has 109 places, 95 transitions, 371 flow [2025-02-08 08:46:16,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=371, PETRI_PLACES=109, PETRI_TRANSITIONS=95} [2025-02-08 08:46:16,063 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -129 predicate places. [2025-02-08 08:46:16,063 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 95 transitions, 371 flow [2025-02-08 08:46:16,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.11111111111111) internal successors, (883), 9 states have internal predecessors, (883), 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) [2025-02-08 08:46:16,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:16,064 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:16,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 08:46:16,064 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:16,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash -138661141, now seen corresponding path program 1 times [2025-02-08 08:46:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:16,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48574683] [2025-02-08 08:46:16,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:16,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:46:16,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:46:16,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:16,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:16,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:16,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48574683] [2025-02-08 08:46:16,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48574683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:16,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:16,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:46:16,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819573592] [2025-02-08 08:46:16,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:16,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:46:16,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:16,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:46:16,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:46:16,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 276 [2025-02-08 08:46:16,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 95 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 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) [2025-02-08 08:46:16,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:16,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 276 [2025-02-08 08:46:16,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:16,798 INFO L124 PetriNetUnfolderBase]: 3218/6205 cut-off events. [2025-02-08 08:46:16,798 INFO L125 PetriNetUnfolderBase]: For 1894/1894 co-relation queries the response was YES. [2025-02-08 08:46:16,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13217 conditions, 6205 events. 3218/6205 cut-off events. For 1894/1894 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 44263 event pairs, 680 based on Foata normal form. 48/4361 useless extension candidates. Maximal degree in co-relation 13204. Up to 4904 conditions per place. [2025-02-08 08:46:16,827 INFO L140 encePairwiseOnDemand]: 272/276 looper letters, 83 selfloop transitions, 14 changer transitions 0/121 dead transitions. [2025-02-08 08:46:16,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 121 transitions, 634 flow [2025-02-08 08:46:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:46:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:46:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2025-02-08 08:46:16,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4260869565217391 [2025-02-08 08:46:16,828 INFO L175 Difference]: Start difference. First operand has 109 places, 95 transitions, 371 flow. Second operand 5 states and 588 transitions. [2025-02-08 08:46:16,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 121 transitions, 634 flow [2025-02-08 08:46:16,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 121 transitions, 601 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-02-08 08:46:16,831 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 381 flow [2025-02-08 08:46:16,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=105, PETRI_TRANSITIONS=94} [2025-02-08 08:46:16,832 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -133 predicate places. [2025-02-08 08:46:16,832 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 94 transitions, 381 flow [2025-02-08 08:46:16,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 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) [2025-02-08 08:46:16,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:16,832 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:16,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 08:46:16,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:16,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:16,832 INFO L85 PathProgramCache]: Analyzing trace with hash -138663642, now seen corresponding path program 1 times [2025-02-08 08:46:16,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:16,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344840432] [2025-02-08 08:46:16,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:16,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:46:16,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:46:16,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:16,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:16,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:16,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344840432] [2025-02-08 08:46:16,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344840432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:16,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:16,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:46:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351404284] [2025-02-08 08:46:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:16,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:46:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:16,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:46:16,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:46:16,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 276 [2025-02-08 08:46:16,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2025-02-08 08:46:16,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:16,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 276 [2025-02-08 08:46:16,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:17,053 INFO L124 PetriNetUnfolderBase]: 214/549 cut-off events. [2025-02-08 08:46:17,053 INFO L125 PetriNetUnfolderBase]: For 1110/1110 co-relation queries the response was YES. [2025-02-08 08:46:17,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 549 events. 214/549 cut-off events. For 1110/1110 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2951 event pairs, 92 based on Foata normal form. 48/512 useless extension candidates. Maximal degree in co-relation 1584. Up to 258 conditions per place. [2025-02-08 08:46:17,055 INFO L140 encePairwiseOnDemand]: 274/276 looper letters, 56 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2025-02-08 08:46:17,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 440 flow [2025-02-08 08:46:17,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:46:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:46:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2025-02-08 08:46:17,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4142512077294686 [2025-02-08 08:46:17,060 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 381 flow. Second operand 3 states and 343 transitions. [2025-02-08 08:46:17,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 440 flow [2025-02-08 08:46:17,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 70 transitions, 384 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-02-08 08:46:17,066 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 244 flow [2025-02-08 08:46:17,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2025-02-08 08:46:17,066 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -173 predicate places. [2025-02-08 08:46:17,066 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 244 flow [2025-02-08 08:46:17,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2025-02-08 08:46:17,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:17,067 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:17,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 08:46:17,067 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:17,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:17,067 INFO L85 PathProgramCache]: Analyzing trace with hash -138663718, now seen corresponding path program 1 times [2025-02-08 08:46:17,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:17,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657290576] [2025-02-08 08:46:17,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:17,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:17,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:46:17,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:46:17,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:17,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:46:17,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:17,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657290576] [2025-02-08 08:46:17,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657290576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:17,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:17,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:46:17,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383187280] [2025-02-08 08:46:17,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:17,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:17,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:17,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:17,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:46:17,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2025-02-08 08:46:17,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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) [2025-02-08 08:46:17,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:17,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2025-02-08 08:46:17,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:17,376 INFO L124 PetriNetUnfolderBase]: 296/583 cut-off events. [2025-02-08 08:46:17,376 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-02-08 08:46:17,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 583 events. 296/583 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2651 event pairs, 92 based on Foata normal form. 48/581 useless extension candidates. Maximal degree in co-relation 1569. Up to 260 conditions per place. [2025-02-08 08:46:17,378 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 52 selfloop transitions, 2 changer transitions 4/69 dead transitions. [2025-02-08 08:46:17,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 69 transitions, 386 flow [2025-02-08 08:46:17,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2025-02-08 08:46:17,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2025-02-08 08:46:17,378 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 244 flow. Second operand 4 states and 437 transitions. [2025-02-08 08:46:17,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 69 transitions, 386 flow [2025-02-08 08:46:17,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:17,380 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 225 flow [2025-02-08 08:46:17,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2025-02-08 08:46:17,380 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -173 predicate places. [2025-02-08 08:46:17,380 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 225 flow [2025-02-08 08:46:17,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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) [2025-02-08 08:46:17,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:17,381 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2025-02-08 08:46:17,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 08:46:17,381 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:17,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:17,381 INFO L85 PathProgramCache]: Analyzing trace with hash 78418978, now seen corresponding path program 1 times [2025-02-08 08:46:17,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:17,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345512480] [2025-02-08 08:46:17,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:17,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:17,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:46:17,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:46:17,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:17,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:46:17,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:17,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345512480] [2025-02-08 08:46:17,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345512480] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:46:17,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830652850] [2025-02-08 08:46:17,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:17,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:17,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:46:17,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:46:17,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:46:17,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:46:17,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:46:17,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:17,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:17,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 08:46:17,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:46:17,831 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 08:46:17,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 08:46:17,863 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 08:46:17,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 08:46:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:46:17,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:46:17,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830652850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:17,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:46:17,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-08 08:46:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370846333] [2025-02-08 08:46:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:17,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:17,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:17,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:46:18,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 276 [2025-02-08 08:46:18,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 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) [2025-02-08 08:46:18,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:18,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 276 [2025-02-08 08:46:18,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:18,087 INFO L124 PetriNetUnfolderBase]: 133/305 cut-off events. [2025-02-08 08:46:18,087 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2025-02-08 08:46:18,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 305 events. 133/305 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1210 event pairs, 38 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 856. Up to 162 conditions per place. [2025-02-08 08:46:18,088 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 51 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-02-08 08:46:18,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 381 flow [2025-02-08 08:46:18,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2025-02-08 08:46:18,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39492753623188404 [2025-02-08 08:46:18,089 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 225 flow. Second operand 4 states and 436 transitions. [2025-02-08 08:46:18,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 381 flow [2025-02-08 08:46:18,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:18,090 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 224 flow [2025-02-08 08:46:18,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-02-08 08:46:18,091 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -175 predicate places. [2025-02-08 08:46:18,091 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 224 flow [2025-02-08 08:46:18,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 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) [2025-02-08 08:46:18,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:18,091 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2025-02-08 08:46:18,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:46:18,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-02-08 08:46:18,292 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 94 more)] === [2025-02-08 08:46:18,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:18,292 INFO L85 PathProgramCache]: Analyzing trace with hash 78418979, now seen corresponding path program 1 times [2025-02-08 08:46:18,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:18,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117109609] [2025-02-08 08:46:18,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:18,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:18,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:46:18,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:46:18,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:18,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:18,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:46:18,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:18,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117109609] [2025-02-08 08:46:18,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117109609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:46:18,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490623365] [2025-02-08 08:46:18,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:18,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:18,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:46:18,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:46:18,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:46:18,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:46:18,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:46:18,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:18,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:18,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 08:46:18,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:46:18,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:46:18,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 08:46:19,016 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:46:19,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 08:46:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:46:19,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:46:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:46:19,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490623365] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:46:19,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:46:19,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 17 [2025-02-08 08:46:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580227659] [2025-02-08 08:46:19,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:46:19,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 08:46:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:19,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 08:46:19,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-02-08 08:46:21,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 276 [2025-02-08 08:46:21,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 224 flow. Second operand has 19 states, 19 states have (on average 97.05263157894737) internal successors, (1844), 19 states have internal predecessors, (1844), 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) [2025-02-08 08:46:21,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:21,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 276 [2025-02-08 08:46:21,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:21,554 INFO L124 PetriNetUnfolderBase]: 106/260 cut-off events. [2025-02-08 08:46:21,554 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2025-02-08 08:46:21,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 260 events. 106/260 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1012 event pairs, 38 based on Foata normal form. 18/276 useless extension candidates. Maximal degree in co-relation 740. Up to 153 conditions per place. [2025-02-08 08:46:21,555 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 0 selfloop transitions, 0 changer transitions 64/64 dead transitions. [2025-02-08 08:46:21,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 379 flow [2025-02-08 08:46:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:46:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:46:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 596 transitions. [2025-02-08 08:46:21,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35990338164251207 [2025-02-08 08:46:21,556 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 224 flow. Second operand 6 states and 596 transitions. [2025-02-08 08:46:21,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 379 flow [2025-02-08 08:46:21,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:21,557 INFO L231 Difference]: Finished difference. Result has 65 places, 0 transitions, 0 flow [2025-02-08 08:46:21,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=65, PETRI_TRANSITIONS=0} [2025-02-08 08:46:21,557 INFO L279 CegarLoopForPetriNet]: 238 programPoint places, -173 predicate places. [2025-02-08 08:46:21,557 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 0 transitions, 0 flow [2025-02-08 08:46:21,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 97.05263157894737) internal successors, (1844), 19 states have internal predecessors, (1844), 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) [2025-02-08 08:46:21,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 97 remaining) [2025-02-08 08:46:21,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 97 remaining) [2025-02-08 08:46:21,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (94 of 97 remaining) [2025-02-08 08:46:21,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 97 remaining) [2025-02-08 08:46:21,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 97 remaining) [2025-02-08 08:46:21,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK (91 of 97 remaining) [2025-02-08 08:46:21,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 97 remaining) [2025-02-08 08:46:21,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 97 remaining) [2025-02-08 08:46:21,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (54 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (53 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK (50 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 97 remaining) [2025-02-08 08:46:21,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (31 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (14 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 97 remaining) [2025-02-08 08:46:21,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 97 remaining) [2025-02-08 08:46:21,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 97 remaining) [2025-02-08 08:46:21,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 97 remaining) [2025-02-08 08:46:21,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 97 remaining) [2025-02-08 08:46:21,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 97 remaining) [2025-02-08 08:46:21,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 97 remaining) [2025-02-08 08:46:21,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:46:21,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-02-08 08:46:21,761 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:21,764 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-02-08 08:46:21,764 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:46:21,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:46:21 BasicIcfg [2025-02-08 08:46:21,768 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:46:21,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:46:21,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:46:21,768 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:46:21,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:51" (3/4) ... [2025-02-08 08:46:21,770 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:46:21,772 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure writer [2025-02-08 08:46:21,776 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2025-02-08 08:46:21,776 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-02-08 08:46:21,776 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-08 08:46:21,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 08:46:21,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:46:21,832 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:46:21,832 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:46:21,832 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:46:21,833 INFO L158 Benchmark]: Toolchain (without parser) took 35228.26ms. Allocated memory was 167.8MB in the beginning and 729.8MB in the end (delta: 562.0MB). Free memory was 115.6MB in the beginning and 357.0MB in the end (delta: -241.4MB). Peak memory consumption was 320.0MB. Max. memory is 16.1GB. [2025-02-08 08:46:21,833 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:46:21,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3023.95ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 66.1MB in the end (delta: 49.5MB). Peak memory consumption was 101.1MB. Max. memory is 16.1GB. [2025-02-08 08:46:21,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.66ms. Allocated memory is still 167.8MB. Free memory was 66.1MB in the beginning and 56.9MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:46:21,834 INFO L158 Benchmark]: Boogie Preprocessor took 82.30ms. Allocated memory is still 167.8MB. Free memory was 56.9MB in the beginning and 105.3MB in the end (delta: -48.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2025-02-08 08:46:21,834 INFO L158 Benchmark]: IcfgBuilder took 1381.09ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 105.3MB in the beginning and 309.2MB in the end (delta: -204.0MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2025-02-08 08:46:21,835 INFO L158 Benchmark]: TraceAbstraction took 30540.00ms. Allocated memory was 411.0MB in the beginning and 729.8MB in the end (delta: 318.8MB). Free memory was 309.2MB in the beginning and 363.2MB in the end (delta: -54.0MB). Peak memory consumption was 265.8MB. Max. memory is 16.1GB. [2025-02-08 08:46:21,835 INFO L158 Benchmark]: Witness Printer took 64.17ms. Allocated memory is still 729.8MB. Free memory was 363.2MB in the beginning and 357.0MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:46:21,836 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.15ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3023.95ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 66.1MB in the end (delta: 49.5MB). Peak memory consumption was 101.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 131.66ms. Allocated memory is still 167.8MB. Free memory was 66.1MB in the beginning and 56.9MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.30ms. Allocated memory is still 167.8MB. Free memory was 56.9MB in the beginning and 105.3MB in the end (delta: -48.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * IcfgBuilder took 1381.09ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 105.3MB in the beginning and 309.2MB in the end (delta: -204.0MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. * TraceAbstraction took 30540.00ms. Allocated memory was 411.0MB in the beginning and 729.8MB in the end (delta: 318.8MB). Free memory was 309.2MB in the beginning and 363.2MB in the end (delta: -54.0MB). Peak memory consumption was 265.8MB. Max. memory is 16.1GB. * Witness Printer took 64.17ms. Allocated memory is still 729.8MB. Free memory was 363.2MB in the beginning and 357.0MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 4308]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] - GenericResultAtLocation [Line: 4310]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] - GenericResultAtLocation [Line: 4315]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] - GenericResultAtLocation [Line: 4317]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] - GenericResultAtLocation [Line: 4323]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] - GenericResultAtLocation [Line: 4325]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] - GenericResultAtLocation [Line: 4331]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] - GenericResultAtLocation [Line: 4333]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] - GenericResultAtLocation [Line: 4339]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] - GenericResultAtLocation [Line: 4341]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] - GenericResultAtLocation [Line: 4347]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] - GenericResultAtLocation [Line: 4349]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] - GenericResultAtLocation [Line: 4355]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] - GenericResultAtLocation [Line: 4357]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] - GenericResultAtLocation [Line: 4363]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] - GenericResultAtLocation [Line: 4365]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] - GenericResultAtLocation [Line: 4370]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] - GenericResultAtLocation [Line: 4372]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] - GenericResultAtLocation [Line: 4377]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] - GenericResultAtLocation [Line: 4379]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] - GenericResultAtLocation [Line: 4384]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] - GenericResultAtLocation [Line: 4386]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] - GenericResultAtLocation [Line: 4391]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] - GenericResultAtLocation [Line: 4393]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] - GenericResultAtLocation [Line: 4398]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] - GenericResultAtLocation [Line: 4400]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] - GenericResultAtLocation [Line: 4405]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] - GenericResultAtLocation [Line: 4408]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] - GenericResultAtLocation [Line: 4414]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] - GenericResultAtLocation [Line: 4417]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] - GenericResultAtLocation [Line: 4423]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] - GenericResultAtLocation [Line: 4426]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] - GenericResultAtLocation [Line: 4432]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] - GenericResultAtLocation [Line: 4435]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] - GenericResultAtLocation [Line: 4441]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] - GenericResultAtLocation [Line: 4444]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] - GenericResultAtLocation [Line: 4450]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] - GenericResultAtLocation [Line: 4453]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] - GenericResultAtLocation [Line: 4460]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] - GenericResultAtLocation [Line: 4463]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] - GenericResultAtLocation [Line: 4470]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] - GenericResultAtLocation [Line: 4473]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] - GenericResultAtLocation [Line: 4480]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] - GenericResultAtLocation [Line: 4483]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] - GenericResultAtLocation [Line: 4490]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] - GenericResultAtLocation [Line: 4493]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] - GenericResultAtLocation [Line: 4500]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] - GenericResultAtLocation [Line: 4503]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] - GenericResultAtLocation [Line: 4510]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] - GenericResultAtLocation [Line: 4513]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] - GenericResultAtLocation [Line: 4519]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] - GenericResultAtLocation [Line: 4522]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] - GenericResultAtLocation [Line: 4528]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] - GenericResultAtLocation [Line: 4531]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] - GenericResultAtLocation [Line: 4537]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] - GenericResultAtLocation [Line: 4540]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] - GenericResultAtLocation [Line: 4546]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] - GenericResultAtLocation [Line: 4549]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] - GenericResultAtLocation [Line: 4555]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] - GenericResultAtLocation [Line: 4558]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] - GenericResultAtLocation [Line: 4564]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] - GenericResultAtLocation [Line: 4567]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] - GenericResultAtLocation [Line: 4573]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] - GenericResultAtLocation [Line: 4576]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] - GenericResultAtLocation [Line: 4582]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] - GenericResultAtLocation [Line: 4585]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] - GenericResultAtLocation [Line: 4591]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] - GenericResultAtLocation [Line: 4594]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] - GenericResultAtLocation [Line: 4600]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] - GenericResultAtLocation [Line: 4603]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] - GenericResultAtLocation [Line: 4609]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] - GenericResultAtLocation [Line: 4612]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] - GenericResultAtLocation [Line: 4618]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] - GenericResultAtLocation [Line: 4621]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] - GenericResultAtLocation [Line: 4627]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] - GenericResultAtLocation [Line: 4630]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] - GenericResultAtLocation [Line: 4636]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] - GenericResultAtLocation [Line: 4639]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] - GenericResultAtLocation [Line: 4645]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] - GenericResultAtLocation [Line: 4648]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] - GenericResultAtLocation [Line: 4654]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] - GenericResultAtLocation [Line: 4656]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] - GenericResultAtLocation [Line: 4662]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] - GenericResultAtLocation [Line: 4664]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] - GenericResultAtLocation [Line: 4670]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] - GenericResultAtLocation [Line: 4672]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] - GenericResultAtLocation [Line: 4678]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] - GenericResultAtLocation [Line: 4680]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] - GenericResultAtLocation [Line: 4686]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] - GenericResultAtLocation [Line: 4688]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] - GenericResultAtLocation [Line: 4694]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] - GenericResultAtLocation [Line: 4696]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] - GenericResultAtLocation [Line: 4702]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] - GenericResultAtLocation [Line: 4704]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] - GenericResultAtLocation [Line: 4710]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] - GenericResultAtLocation [Line: 4712]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] - GenericResultAtLocation [Line: 4718]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] - GenericResultAtLocation [Line: 4720]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] - GenericResultAtLocation [Line: 4726]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] - GenericResultAtLocation [Line: 4728]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 708]: 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: 708]: 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: -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: -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: 708]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 708]: 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: 708]: 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: -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: 708]: 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: 708]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6031]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 234 locations, 93 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: 6.8s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2233 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1440 mSDsluCounter, 584 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 504 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4554 IncrementalHoareTripleChecker+Invalid, 4614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 80 mSDtfsCounter, 4554 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=531occurred in iteration=0, InterpolantAutomatonStates: 55, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 1422 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 246 locations, 97 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: 23.5s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5648 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4336 mSDsluCounter, 1769 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1529 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13669 IncrementalHoareTripleChecker+Invalid, 13828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 240 mSDtfsCounter, 13669 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=726occurred in iteration=16, InterpolantAutomatonStates: 110, 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.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 457 NumberOfCodeBlocks, 457 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 461 ConstructedInterpolants, 24 QuantifiedInterpolants, 4984 SizeOfPredicates, 22 NumberOfNonLiveVariables, 900 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 17/23 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 104 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:46:21,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE