./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/clhlock.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/clhlock.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 bed480fb9329cf4d2bde4e192428cf2ff72174b29c5e6148c18915395bc76ca3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:45:45,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:45:45,059 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:45,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:45:45,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:45:45,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:45:45,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:45:45,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:45:45,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:45:45,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:45:45,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:45:45,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:45:45,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:45:45,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:45:45,079 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:45:45,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:45:45,080 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:45:45,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:45:45,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:45:45,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:45:45,080 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:45:45,080 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:45:45,080 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:45:45,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:45:45,080 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:45:45,081 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:45:45,081 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:45:45,081 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:45:45,081 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:45:45,081 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:45:45,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:45:45,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:45:45,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:45:45,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:45:45,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:45:45,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:45:45,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:45:45,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:45:45,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:45:45,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:45:45,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:45:45,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:45:45,082 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 -> bed480fb9329cf4d2bde4e192428cf2ff72174b29c5e6148c18915395bc76ca3 [2025-02-08 08:45:45,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:45:45,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:45:45,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:45:45,313 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:45:45,314 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:45:45,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/clhlock.i [2025-02-08 08:45:46,427 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a1ed8f2d/92ebad0ff9d9449593fe48cb2adf46ef/FLAG0d46753ca [2025-02-08 08:45:47,025 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:45:47,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/clhlock.i [2025-02-08 08:45:47,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a1ed8f2d/92ebad0ff9d9449593fe48cb2adf46ef/FLAG0d46753ca [2025-02-08 08:45:47,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a1ed8f2d/92ebad0ff9d9449593fe48cb2adf46ef [2025-02-08 08:45:47,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:45:47,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:45:47,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:45:47,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:45:47,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:45:47,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:45:47" (1/1) ... [2025-02-08 08:45:47,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d5d535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:47, skipping insertion in model container [2025-02-08 08:45:47,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:45:47" (1/1) ... [2025-02-08 08:45:47,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:45:49,003 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,011 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,011 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,017 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,017 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,130 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,138 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,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:45:49,389 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:45:49,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-08 08:45:49,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-08 08:45:49,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-08 08:45:49,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-08 08:45:49,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-08 08:45:49,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-08 08:45:49,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-08 08:45:49,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-08 08:45:49,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-08 08:45:49,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-08 08:45:49,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-08 08:45:49,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-08 08:45:49,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-08 08:45:49,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-08 08:45:49,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-08 08:45:49,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-08 08:45:49,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-08 08:45:49,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-08 08:45:49,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-08 08:45:49,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-08 08:45:49,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-08 08:45:49,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-08 08:45:49,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-08 08:45:49,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-08 08:45:49,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-08 08:45:49,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-08 08:45:49,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-08 08:45:49,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-08 08:45:49,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-08 08:45:49,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-08 08:45:49,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-08 08:45:49,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-08 08:45:49,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-08 08:45:49,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-08 08:45:49,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-08 08:45:49,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-08 08:45:49,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-08 08:45:49,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-08 08:45:49,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-08 08:45:49,456 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-08 08:45:49,456 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-08 08:45:49,456 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-08 08:45:49,456 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-08 08:45:49,457 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-08 08:45:49,457 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-08 08:45:49,457 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-08 08:45:49,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-08 08:45:49,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-08 08:45:49,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-08 08:45:49,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-08 08:45:49,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-08 08:45:49,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-08 08:45:49,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-08 08:45:49,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-08 08:45:49,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-08 08:45:49,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-08 08:45:49,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-08 08:45:49,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-08 08:45:49,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-08 08:45:49,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-08 08:45:49,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-08 08:45:49,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-08 08:45:49,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-08 08:45:49,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-08 08:45:49,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-08 08:45:49,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-08 08:45:49,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-08 08:45:49,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-08 08:45:49,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-08 08:45:49,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-08 08:45:49,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-08 08:45:49,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-08 08:45:49,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-08 08:45:49,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-08 08:45:49,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-08 08:45:49,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-08 08:45:49,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-08 08:45:49,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-08 08:45:49,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-08 08:45:49,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-08 08:45:49,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-08 08:45:49,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-08 08:45:49,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-08 08:45:49,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-08 08:45:49,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-08 08:45:49,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-08 08:45:49,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-08 08:45:49,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-08 08:45:49,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-08 08:45:49,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-08 08:45:49,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-08 08:45:49,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-08 08:45:49,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-08 08:45:49,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-08 08:45:49,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-08 08:45:49,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-08 08:45:49,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-08 08:45:49,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-08 08:45:49,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-08 08:45:49,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-08 08:45:49,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:45:49,737 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:45:49,738 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,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:45:49,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:45:49,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:45:49,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:45:49,743 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,809 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,850 INFO L138 Inliner]: procedures = 919, calls = 937, calls flagged for inlining = 820, calls inlined = 37, statements flattened = 315 [2025-02-08 08:45:49,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:45:49,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:45:49,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:45:49,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:45:49,859 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,859 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,864 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,892 INFO L175 MemorySlicer]: Split 29 memory accesses to 4 slices as follows [2, 2, 9, 16]. 55 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 0, 2, 9]. The 8 writes are split as follows [0, 1, 5, 2]. [2025-02-08 08:45:49,893 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,896 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,908 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,912 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,913 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,914 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,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:45:49,921 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:45:49,921 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:45:49,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:45:49,921 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,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:45:49,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:49,956 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,963 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,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:45:49,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-08 08:45:49,977 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:45:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 08:45:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 08:45:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:45:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:45:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:45:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 08:45:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:45:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 08:45:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 08:45:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 08:45:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 08:45:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:45:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:45:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:45:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 08:45:49,981 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,113 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:45:50,114 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:45:50,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4842: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~o~5#1; [2025-02-08 08:45:50,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5998-1: havoc #t~post773#1; [2025-02-08 08:45:50,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2282: vatomic32_await_eq_acq_~v#1 := vatomic32_await_eq_acq_#in~v#1; [2025-02-08 08:45:50,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5998-2: ~j~0#1 := 1 + #t~post773#1; [2025-02-08 08:45:50,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2282-1: vatomic32_await_eq_acq_~a#1.base, vatomic32_await_eq_acq_~a#1.offset := vatomic32_await_eq_acq_#in~a#1.base, vatomic32_await_eq_acq_#in~a#1.offset; [2025-02-08 08:45:50,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5982: havoc cs_#t~post771#1; [2025-02-08 08:45:50,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5982-1: ~g_cs_x~0 := 1 + cs_#t~post771#1; [2025-02-08 08:45:50,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5982-2: cs_#t~post771#1 := ~g_cs_x~0; [2025-02-08 08:45:50,361 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-1: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5999: assume { :end_inline_acquire } true;assume { :begin_inline_cs } true;havoc cs_#t~post771#1, cs_#t~post772#1; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5999-1: havoc acquire_#in~tid#1; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5983: havoc cs_#t~post772#1; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5983-1: ~g_cs_y~0 := 1 + cs_#t~post772#1; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5983-2: cs_#t~post772#1 := ~g_cs_y~0; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6000-1: havoc cs_#t~post771#1, cs_#t~post772#1; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6000: assume { :end_inline_cs } true;#t~post773#1 := ~j~0#1; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4844-1: vatomic32_await_eq_#res#1 := vatomic32_await_eq_~ret~0#1; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-3: assume { :end_inline_vatomic32_await_eq } true;vatomic32_await_eq_acq_#res#1 := vatomic32_await_eq_acq_#t~ret174#1; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-2: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-02-08 08:45:50,362 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-5: havoc vatomic32_await_eq_#t~ret636#1, vatomic32_await_eq_#t~ite637#1, vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset, vatomic32_await_eq_~c#1, vatomic32_await_eq_~ret~0#1, vatomic32_await_eq_~o~5#1; [2025-02-08 08:45:50,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-4: havoc vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset, vatomic32_await_eq_#in~c#1; [2025-02-08 08:45:50,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-7: havoc vatomic32_await_eq_#t~ret636#1, vatomic32_await_eq_#t~ite637#1, vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset, vatomic32_await_eq_~c#1, vatomic32_await_eq_~ret~0#1, vatomic32_await_eq_~o~5#1; [2025-02-08 08:45:50,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-6: vatomic32_await_eq_acq_#t~ret174#1 := vatomic32_await_eq_#res#1; [2025-02-08 08:45:50,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-9: assume { :begin_inline_vatomic32_await_eq } true;vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset, vatomic32_await_eq_#in~c#1 := vatomic32_await_eq_acq_~a#1.base, vatomic32_await_eq_acq_~a#1.offset, vatomic32_await_eq_acq_~v#1; [2025-02-08 08:45:50,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285-8: havoc vatomic32_await_eq_#res#1; [2025-02-08 08:45:50,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume true; [2025-02-08 08:45:50,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume !true; [2025-02-08 08:45:50,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume false; [2025-02-08 08:45:50,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume !false; [2025-02-08 08:45:50,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume true; [2025-02-08 08:45:50,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume !true; [2025-02-08 08:45:50,363 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume false; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume !false; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume true; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume !true; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume false; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume !false; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume true; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume !true; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume false; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume !false; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume true; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume !true; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume false; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume !false; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume true; [2025-02-08 08:45:50,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume !true; [2025-02-08 08:45:50,365 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume false; [2025-02-08 08:45:50,365 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume !false; [2025-02-08 08:45:50,365 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3775: 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,365 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4835: vatomic32_await_eq_~c#1 := vatomic32_await_eq_#in~c#1; [2025-02-08 08:45:50,365 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4835-1: vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset := vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset; [2025-02-08 08:45:50,365 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397-2: SUMMARY for call write~$Pointer$#3(clhlock_acquire_#t~ret760#1.base, clhlock_acquire_#t~ret760#1.offset, clhlock_acquire_~node#1.base, clhlock_acquire_~node#1.offset, 4); srcloc: null [2025-02-08 08:45:50,365 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397-2: assume !(1 == #valid[clhlock_acquire_~node#1.base]); [2025-02-08 08:45:50,365 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397-2: assume !(4 + clhlock_acquire_~node#1.offset <= #length[clhlock_acquire_~node#1.base] && 0 <= clhlock_acquire_~node#1.offset); [2025-02-08 08:45:50,365 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397-3: havoc vatomicptr_xchg_#in~a#1.base, vatomicptr_xchg_#in~a#1.offset, vatomicptr_xchg_#in~v#1.base, vatomicptr_xchg_#in~v#1.offset;assume { :end_inline_vatomicptr_xchg } true; [2025-02-08 08:45:50,365 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397: havoc clhlock_acquire_#t~ret760#1.base, clhlock_acquire_#t~ret760#1.offset; [2025-02-08 08:45:50,365 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397-1: havoc clhlock_acquire_#t~mem759#1.base, clhlock_acquire_#t~mem759#1.offset; [2025-02-08 08:45:50,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397-4: havoc vatomicptr_xchg_#t~mem441#1.base, vatomicptr_xchg_#t~mem441#1.offset, vatomicptr_xchg_~a#1.base, vatomicptr_xchg_~a#1.offset, vatomicptr_xchg_~v#1.base, vatomicptr_xchg_~v#1.offset, vatomicptr_xchg_~tmp~11#1.base, vatomicptr_xchg_~tmp~11#1.offset; [2025-02-08 08:45:50,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5397-5: clhlock_acquire_#t~ret760#1.base, clhlock_acquire_#t~ret760#1.offset := vatomicptr_xchg_#res#1.base, vatomicptr_xchg_#res#1.offset; [2025-02-08 08:45:50,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-1: vatomic32_read_~tmp~2#1 := vatomic32_read_#t~mem432#1; [2025-02-08 08:45:50,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779: havoc vatomic32_read_#t~mem432#1; [2025-02-08 08:45:50,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-3: SUMMARY for call vatomic32_read_#t~mem432#1 := read~int#2(vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, 4); srcloc: null [2025-02-08 08:45:50,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-3: assume !(1 == #valid[vatomic32_read_~a#1.base]); [2025-02-08 08:45:50,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-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,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-2: [2025-02-08 08:45:50,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779-4: [2025-02-08 08:45:50,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042: assume { :end_inline_clhlock_acquire } true;havoc acquire_~tid#1; [2025-02-08 08:45:50,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398: havoc clhlock_acquire_#t~ret762#1; [2025-02-08 08:45:50,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-1: havoc clhlock_acquire_#in~lock#1.base, clhlock_acquire_#in~lock#1.offset, clhlock_acquire_#in~node#1.base, clhlock_acquire_#in~node#1.offset; [2025-02-08 08:45:50,366 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-2: havoc clhlock_acquire_#t~mem758#1.base, clhlock_acquire_#t~mem758#1.offset, clhlock_acquire_#t~mem759#1.base, clhlock_acquire_#t~mem759#1.offset, clhlock_acquire_#t~ret760#1.base, clhlock_acquire_#t~ret760#1.offset, clhlock_acquire_#t~mem761#1.base, clhlock_acquire_#t~mem761#1.offset, clhlock_acquire_#t~ret762#1, clhlock_acquire_~lock#1.base, clhlock_acquire_~lock#1.offset, clhlock_acquire_~node#1.base, clhlock_acquire_~node#1.offset; [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-3: havoc vatomic32_await_eq_acq_#t~ret174#1, vatomic32_await_eq_acq_~a#1.base, vatomic32_await_eq_acq_~a#1.offset, vatomic32_await_eq_acq_~v#1; [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-4: clhlock_acquire_#t~ret762#1 := vatomic32_await_eq_acq_#res#1; [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-1: assume { :end_inline_vatomic32_await_eq_acq } true;havoc clhlock_acquire_#t~mem761#1.base, clhlock_acquire_#t~mem761#1.offset; [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-2: havoc vatomic32_await_eq_acq_#in~a#1.base, vatomic32_await_eq_acq_#in~a#1.offset, vatomic32_await_eq_acq_#in~v#1; [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-7: assume { :begin_inline_vatomic32_await_eq_acq } true;vatomic32_await_eq_acq_#in~a#1.base, vatomic32_await_eq_acq_#in~a#1.offset, vatomic32_await_eq_acq_#in~v#1 := clhlock_acquire_#t~mem761#1.base, clhlock_acquire_#t~mem761#1.offset, 0; [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-8: SUMMARY for call clhlock_acquire_#t~mem761#1.base, clhlock_acquire_#t~mem761#1.offset := read~$Pointer$#3(clhlock_acquire_~node#1.base, clhlock_acquire_~node#1.offset, 4); srcloc: null [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-8: assume !(1 == #valid[clhlock_acquire_~node#1.base]); [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-8: assume !(4 + clhlock_acquire_~node#1.offset <= #length[clhlock_acquire_~node#1.base] && 0 <= clhlock_acquire_~node#1.offset); [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-5: havoc vatomic32_await_eq_acq_#t~ret174#1, vatomic32_await_eq_acq_~a#1.base, vatomic32_await_eq_acq_~a#1.offset, vatomic32_await_eq_acq_~v#1; [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5398-6: havoc vatomic32_await_eq_acq_#res#1; [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4838: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~c#1; [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3781-1: vatomic32_read_#res#1 := vatomic32_read_~tmp~2#1; [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4839: vatomic32_await_eq_~o~5#1 := 0;assume { :begin_inline_verification_loop_begin } true;assume { :end_inline_verification_loop_begin } true; [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 08:45:50,367 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-2: havoc verification_spin_end_~v#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840: assume true;assume { :begin_inline_verification_spin_start } true;assume { :end_inline_verification_spin_start } true;assume { :begin_inline_vatomic32_read } true;vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset := vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840: assume !true; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-5: havoc vatomic32_await_eq_#t~ite637#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-6: havoc vatomic32_await_eq_#t~ite637#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-3: havoc verification_spin_end_~v#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-9: havoc vatomic32_await_eq_#t~ret636#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-10: assume { :end_inline_verification_spin_end } true;vatomic32_await_eq_#t~ite637#1 := 0; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume 0 != vatomic32_await_eq_#t~ite637#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume !(0 != vatomic32_await_eq_#t~ite637#1); [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-8: havoc vatomic32_await_eq_#t~ret636#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-13: havoc verification_spin_end_~v#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume !(vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296); [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-11: havoc verification_spin_end_#in~v#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-12: havoc verification_spin_end_~v#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-17: assume { :end_inline_vatomic32_read } true;vatomic32_await_eq_~o~5#1 := vatomic32_await_eq_#t~ret636#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-18: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-15: vatomic32_await_eq_#t~ite637#1 := 1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-21: havoc vatomic32_read_#t~mem432#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-22: havoc vatomic32_read_#res#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-19: havoc vatomic32_read_#t~mem432#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-20: vatomic32_await_eq_#t~ret636#1 := vatomic32_read_#res#1; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume true; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume !true; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume false; [2025-02-08 08:45:50,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume !false; [2025-02-08 08:45:50,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6012-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-08 08:45:50,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6012: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-08 08:45:50,488 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:45:50,488 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:45:50,615 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:45:50,616 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:45:50,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:50 BoogieIcfgContainer [2025-02-08 08:45:50,616 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:45:50,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:45:50,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:45:50,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:45:50,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:45:47" (1/3) ... [2025-02-08 08:45:50,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223b02bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:45:50, skipping insertion in model container [2025-02-08 08:45:50,621 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:50,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223b02bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:45:50, skipping insertion in model container [2025-02-08 08:45:50,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:50" (3/3) ... [2025-02-08 08:45:50,622 INFO L128 eAbstractionObserver]: Analyzing ICFG clhlock.i [2025-02-08 08:45:50,631 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:45:50,632 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG clhlock.i that has 2 procedures, 124 locations, 1 initial locations, 37 loop locations, and 35 error locations. [2025-02-08 08:45:50,632 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:45:50,742 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 08:45:50,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 178 transitions, 363 flow [2025-02-08 08:45:50,821 INFO L124 PetriNetUnfolderBase]: 68/226 cut-off events. [2025-02-08 08:45:50,824 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:45:50,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 226 events. 68/226 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 776 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 137. Up to 6 conditions per place. [2025-02-08 08:45:50,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 178 transitions, 363 flow [2025-02-08 08:45:50,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 178 transitions, 363 flow [2025-02-08 08:45:50,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:45:50,855 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;@38d202b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:45:50,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-02-08 08:45:50,860 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:45:50,861 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-02-08 08:45:50,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:45:50,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:50,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:45:50,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 08:45:50,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:50,866 INFO L85 PathProgramCache]: Analyzing trace with hash 28145, now seen corresponding path program 1 times [2025-02-08 08:45:50,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:50,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485062821] [2025-02-08 08:45:50,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:50,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:50,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:45:50,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:45:50,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:50,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:51,119 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,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485062821] [2025-02-08 08:45:51,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485062821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:51,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:51,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699069346] [2025-02-08 08:45:51,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:51,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:51,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:51,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:51,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:51,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 178 [2025-02-08 08:45:51,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 178 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:51,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 178 [2025-02-08 08:45:51,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:51,372 INFO L124 PetriNetUnfolderBase]: 247/924 cut-off events. [2025-02-08 08:45:51,372 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:45:51,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 924 events. 247/924 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5721 event pairs, 225 based on Foata normal form. 606/1333 useless extension candidates. Maximal degree in co-relation 1368. Up to 525 conditions per place. [2025-02-08 08:45:51,378 INFO L140 encePairwiseOnDemand]: 123/178 looper letters, 49 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2025-02-08 08:45:51,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 123 transitions, 355 flow [2025-02-08 08:45:51,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2025-02-08 08:45:51,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.599250936329588 [2025-02-08 08:45:51,389 INFO L175 Difference]: Start difference. First operand has 127 places, 178 transitions, 363 flow. Second operand 3 states and 320 transitions. [2025-02-08 08:45:51,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 123 transitions, 355 flow [2025-02-08 08:45:51,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 123 transitions, 355 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:45:51,394 INFO L231 Difference]: Finished difference. Result has 124 places, 123 transitions, 257 flow [2025-02-08 08:45:51,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=124, PETRI_TRANSITIONS=123} [2025-02-08 08:45:51,398 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -3 predicate places. [2025-02-08 08:45:51,398 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 123 transitions, 257 flow [2025-02-08 08:45:51,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:51,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:45:51,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:45:51,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 08:45:51,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:51,400 INFO L85 PathProgramCache]: Analyzing trace with hash 28146, now seen corresponding path program 1 times [2025-02-08 08:45:51,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:51,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837826600] [2025-02-08 08:45:51,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:51,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:51,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:45:51,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:45:51,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:51,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:51,563 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,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:51,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837826600] [2025-02-08 08:45:51,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837826600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:51,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:51,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:51,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783472936] [2025-02-08 08:45:51,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:51,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:51,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:51,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:51,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:51,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 178 [2025-02-08 08:45:51,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 123 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:51,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 178 [2025-02-08 08:45:51,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:51,793 INFO L124 PetriNetUnfolderBase]: 247/923 cut-off events. [2025-02-08 08:45:51,797 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:45:51,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 923 events. 247/923 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5676 event pairs, 225 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 1446. Up to 525 conditions per place. [2025-02-08 08:45:51,805 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 48 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2025-02-08 08:45:51,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 122 transitions, 355 flow [2025-02-08 08:45:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2025-02-08 08:45:51,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 08:45:51,809 INFO L175 Difference]: Start difference. First operand has 124 places, 123 transitions, 257 flow. Second operand 3 states and 267 transitions. [2025-02-08 08:45:51,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 122 transitions, 355 flow [2025-02-08 08:45:51,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 122 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:51,812 INFO L231 Difference]: Finished difference. Result has 123 places, 122 transitions, 255 flow [2025-02-08 08:45:51,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=123, PETRI_TRANSITIONS=122} [2025-02-08 08:45:51,814 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -4 predicate places. [2025-02-08 08:45:51,814 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 122 transitions, 255 flow [2025-02-08 08:45:51,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:51,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:45:51,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:45:51,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 08:45:51,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:51,815 INFO L85 PathProgramCache]: Analyzing trace with hash 27072199, now seen corresponding path program 1 times [2025-02-08 08:45:51,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:51,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122734971] [2025-02-08 08:45:51,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:51,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:51,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:45:51,836 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,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:51,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:51,950 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,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:51,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122734971] [2025-02-08 08:45:51,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122734971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:51,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:51,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:51,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120077292] [2025-02-08 08:45:51,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:51,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:45:51,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:51,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:45:51,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:45:52,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 178 [2025-02-08 08:45:52,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 122 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 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,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:52,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 178 [2025-02-08 08:45:52,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:52,229 INFO L124 PetriNetUnfolderBase]: 247/922 cut-off events. [2025-02-08 08:45:52,230 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:45:52,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1456 conditions, 922 events. 247/922 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5699 event pairs, 225 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 1444. Up to 521 conditions per place. [2025-02-08 08:45:52,235 INFO L140 encePairwiseOnDemand]: 174/178 looper letters, 46 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2025-02-08 08:45:52,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 121 transitions, 351 flow [2025-02-08 08:45:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 338 transitions. [2025-02-08 08:45:52,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4747191011235955 [2025-02-08 08:45:52,238 INFO L175 Difference]: Start difference. First operand has 123 places, 122 transitions, 255 flow. Second operand 4 states and 338 transitions. [2025-02-08 08:45:52,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 121 transitions, 351 flow [2025-02-08 08:45:52,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 121 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:52,241 INFO L231 Difference]: Finished difference. Result has 123 places, 121 transitions, 255 flow [2025-02-08 08:45:52,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=123, PETRI_TRANSITIONS=121} [2025-02-08 08:45:52,242 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -4 predicate places. [2025-02-08 08:45:52,242 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 121 transitions, 255 flow [2025-02-08 08:45:52,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 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,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:52,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:45:52,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:45:52,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 08:45:52,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash 27072200, now seen corresponding path program 1 times [2025-02-08 08:45:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:52,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203986827] [2025-02-08 08:45:52,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:52,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:45:52,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:45:52,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:52,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:52,415 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,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:52,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203986827] [2025-02-08 08:45:52,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203986827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:52,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:52,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:52,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613574100] [2025-02-08 08:45:52,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:52,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:45:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:52,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:45:52,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:45:52,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 178 [2025-02-08 08:45:52,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 121 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 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,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:52,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 178 [2025-02-08 08:45:52,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:52,695 INFO L124 PetriNetUnfolderBase]: 247/921 cut-off events. [2025-02-08 08:45:52,695 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:45:52,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 921 events. 247/921 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5707 event pairs, 225 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 1438. Up to 521 conditions per place. [2025-02-08 08:45:52,700 INFO L140 encePairwiseOnDemand]: 174/178 looper letters, 45 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2025-02-08 08:45:52,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 120 transitions, 349 flow [2025-02-08 08:45:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2025-02-08 08:45:52,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47331460674157305 [2025-02-08 08:45:52,702 INFO L175 Difference]: Start difference. First operand has 123 places, 121 transitions, 255 flow. Second operand 4 states and 337 transitions. [2025-02-08 08:45:52,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 120 transitions, 349 flow [2025-02-08 08:45:52,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 120 transitions, 343 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:45:52,704 INFO L231 Difference]: Finished difference. Result has 122 places, 120 transitions, 253 flow [2025-02-08 08:45:52,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=122, PETRI_TRANSITIONS=120} [2025-02-08 08:45:52,704 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -5 predicate places. [2025-02-08 08:45:52,704 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 120 transitions, 253 flow [2025-02-08 08:45:52,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 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,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:52,708 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] [2025-02-08 08:45:52,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:45:52,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 08:45:52,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash -359917215, now seen corresponding path program 1 times [2025-02-08 08:45:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:52,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049384047] [2025-02-08 08:45:52,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:52,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:52,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:45:52,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:45:52,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:52,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:52,756 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,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:52,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049384047] [2025-02-08 08:45:52,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049384047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:52,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:52,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:52,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130250236] [2025-02-08 08:45:52,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:52,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:52,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:52,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:52,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:52,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 178 [2025-02-08 08:45:52,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 120 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:52,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 178 [2025-02-08 08:45:52,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:52,886 INFO L124 PetriNetUnfolderBase]: 247/922 cut-off events. [2025-02-08 08:45:52,887 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:45:52,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 922 events. 247/922 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5662 event pairs, 225 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 1440. Up to 525 conditions per place. [2025-02-08 08:45:52,890 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 47 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2025-02-08 08:45:52,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 121 transitions, 353 flow [2025-02-08 08:45:52,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-02-08 08:45:52,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49812734082397003 [2025-02-08 08:45:52,891 INFO L175 Difference]: Start difference. First operand has 122 places, 120 transitions, 253 flow. Second operand 3 states and 266 transitions. [2025-02-08 08:45:52,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 121 transitions, 353 flow [2025-02-08 08:45:52,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 121 transitions, 347 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:45:52,895 INFO L231 Difference]: Finished difference. Result has 122 places, 121 transitions, 259 flow [2025-02-08 08:45:52,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=122, PETRI_TRANSITIONS=121} [2025-02-08 08:45:52,896 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -5 predicate places. [2025-02-08 08:45:52,896 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 121 transitions, 259 flow [2025-02-08 08:45:52,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:52,896 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:52,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:45:52,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 08:45:52,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:52,897 INFO L85 PathProgramCache]: Analyzing trace with hash 180480921, now seen corresponding path program 1 times [2025-02-08 08:45:52,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:52,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903460857] [2025-02-08 08:45:52,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:52,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:52,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:45:52,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:45:52,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:52,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:52,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:52,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903460857] [2025-02-08 08:45:52,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903460857] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:45:52,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362036389] [2025-02-08 08:45:52,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:52,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:52,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:52,940 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:45:52,942 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:45:53,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:45:53,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:45:53,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:53,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:53,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:45:53,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:45:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:53,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:45:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:53,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362036389] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:45:53,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:45:53,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-08 08:45:53,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697306677] [2025-02-08 08:45:53,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:45:53,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:45:53,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:53,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:45:53,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:45:53,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 178 [2025-02-08 08:45:53,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 121 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 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,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:53,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 178 [2025-02-08 08:45:53,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:53,266 INFO L124 PetriNetUnfolderBase]: 247/924 cut-off events. [2025-02-08 08:45:53,266 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 08:45:53,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 924 events. 247/924 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5703 event pairs, 225 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 1438. Up to 525 conditions per place. [2025-02-08 08:45:53,270 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 47 selfloop transitions, 4 changer transitions 0/123 dead transitions. [2025-02-08 08:45:53,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 123 transitions, 369 flow [2025-02-08 08:45:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:45:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:45:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2025-02-08 08:45:53,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4640449438202247 [2025-02-08 08:45:53,272 INFO L175 Difference]: Start difference. First operand has 122 places, 121 transitions, 259 flow. Second operand 5 states and 413 transitions. [2025-02-08 08:45:53,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 123 transitions, 369 flow [2025-02-08 08:45:53,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 365 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:53,274 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 281 flow [2025-02-08 08:45:53,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2025-02-08 08:45:53,275 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 0 predicate places. [2025-02-08 08:45:53,275 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 281 flow [2025-02-08 08:45:53,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 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,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:53,276 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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:53,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:45:53,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:45:53,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 08:45:53,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash -615480167, now seen corresponding path program 2 times [2025-02-08 08:45:53,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:53,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403359464] [2025-02-08 08:45:53,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:45:53,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:53,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-08 08:45:53,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 25 statements. [2025-02-08 08:45:53,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:45:53,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:45:53,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:53,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403359464] [2025-02-08 08:45:53,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403359464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:53,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:53,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:53,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388577057] [2025-02-08 08:45:53,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:53,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:53,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:53,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:53,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:53,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 178 [2025-02-08 08:45:53,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:53,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 178 [2025-02-08 08:45:53,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:53,725 INFO L124 PetriNetUnfolderBase]: 301/1065 cut-off events. [2025-02-08 08:45:53,726 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 08:45:53,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 1065 events. 301/1065 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6845 event pairs, 225 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 1680. Up to 527 conditions per place. [2025-02-08 08:45:53,729 INFO L140 encePairwiseOnDemand]: 174/178 looper letters, 78 selfloop transitions, 2 changer transitions 0/148 dead transitions. [2025-02-08 08:45:53,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 148 transitions, 491 flow [2025-02-08 08:45:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2025-02-08 08:45:53,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5299625468164794 [2025-02-08 08:45:53,733 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 281 flow. Second operand 3 states and 283 transitions. [2025-02-08 08:45:53,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 148 transitions, 491 flow [2025-02-08 08:45:53,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 148 transitions, 481 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:53,736 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 271 flow [2025-02-08 08:45:53,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2025-02-08 08:45:53,737 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -1 predicate places. [2025-02-08 08:45:53,737 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 271 flow [2025-02-08 08:45:53,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:53,738 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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:53,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:45:53,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 08:45:53,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash -615480166, now seen corresponding path program 1 times [2025-02-08 08:45:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:53,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451067467] [2025-02-08 08:45:53,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:53,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:53,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:45:53,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:45:53,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:53,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:45:53,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:53,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451067467] [2025-02-08 08:45:53,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451067467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:53,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:53,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:53,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784155979] [2025-02-08 08:45:53,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:53,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:53,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:53,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:53,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:53,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 178 [2025-02-08 08:45:53,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 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,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:53,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 178 [2025-02-08 08:45:53,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:54,131 INFO L124 PetriNetUnfolderBase]: 246/895 cut-off events. [2025-02-08 08:45:54,132 INFO L125 PetriNetUnfolderBase]: For 40/42 co-relation queries the response was YES. [2025-02-08 08:45:54,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 895 events. 246/895 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5635 event pairs, 121 based on Foata normal form. 27/734 useless extension candidates. Maximal degree in co-relation 1427. Up to 334 conditions per place. [2025-02-08 08:45:54,135 INFO L140 encePairwiseOnDemand]: 171/178 looper letters, 101 selfloop transitions, 5 changer transitions 0/175 dead transitions. [2025-02-08 08:45:54,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 175 transitions, 591 flow [2025-02-08 08:45:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2025-02-08 08:45:54,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5463483146067416 [2025-02-08 08:45:54,138 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 271 flow. Second operand 4 states and 389 transitions. [2025-02-08 08:45:54,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 175 transitions, 591 flow [2025-02-08 08:45:54,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 175 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:54,141 INFO L231 Difference]: Finished difference. Result has 128 places, 121 transitions, 289 flow [2025-02-08 08:45:54,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=289, PETRI_PLACES=128, PETRI_TRANSITIONS=121} [2025-02-08 08:45:54,143 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 1 predicate places. [2025-02-08 08:45:54,144 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 121 transitions, 289 flow [2025-02-08 08:45:54,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 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,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:54,144 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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:45:54,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:45:54,144 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 08:45:54,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:54,145 INFO L85 PathProgramCache]: Analyzing trace with hash 800098028, now seen corresponding path program 1 times [2025-02-08 08:45:54,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:54,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848896110] [2025-02-08 08:45:54,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:54,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:54,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:45:54,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:45:54,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:54,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:45:54,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:45:54,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:45:54,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:45:54,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:54,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:45:54,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:45:54,214 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:45:54,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 48 remaining) [2025-02-08 08:45:54,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (38 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (37 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (36 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 48 remaining) [2025-02-08 08:45:54,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 48 remaining) [2025-02-08 08:45:54,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 48 remaining) [2025-02-08 08:45:54,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 48 remaining) [2025-02-08 08:45:54,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 48 remaining) [2025-02-08 08:45:54,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 48 remaining) [2025-02-08 08:45:54,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 48 remaining) [2025-02-08 08:45:54,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 48 remaining) [2025-02-08 08:45:54,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 48 remaining) [2025-02-08 08:45:54,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 48 remaining) [2025-02-08 08:45:54,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 48 remaining) [2025-02-08 08:45:54,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 48 remaining) [2025-02-08 08:45:54,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 48 remaining) [2025-02-08 08:45:54,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 48 remaining) [2025-02-08 08:45:54,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 48 remaining) [2025-02-08 08:45:54,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 48 remaining) [2025-02-08 08:45:54,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 48 remaining) [2025-02-08 08:45:54,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 48 remaining) [2025-02-08 08:45:54,221 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 48 remaining) [2025-02-08 08:45:54,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:45:54,221 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:54,224 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:45:54,224 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 08:45:54,291 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:45:54,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 268 transitions, 552 flow [2025-02-08 08:45:54,316 INFO L124 PetriNetUnfolderBase]: 118/399 cut-off events. [2025-02-08 08:45:54,316 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 08:45:54,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 399 events. 118/399 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1761 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 258. Up to 12 conditions per place. [2025-02-08 08:45:54,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 268 transitions, 552 flow [2025-02-08 08:45:54,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 268 transitions, 552 flow [2025-02-08 08:45:54,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:45:54,324 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;@38d202b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:45:54,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-02-08 08:45:54,343 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:45:54,343 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-02-08 08:45:54,343 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:45:54,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:54,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:45:54,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2025-02-08 08:45:54,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash 36721, now seen corresponding path program 1 times [2025-02-08 08:45:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:54,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929886604] [2025-02-08 08:45:54,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:54,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:45:54,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:45:54,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:54,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:54,386 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,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:54,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929886604] [2025-02-08 08:45:54,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929886604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:54,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:54,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:54,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950353952] [2025-02-08 08:45:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:54,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:54,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:54,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:54,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:54,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 268 [2025-02-08 08:45:54,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 268 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:54,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 268 [2025-02-08 08:45:54,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:56,803 INFO L124 PetriNetUnfolderBase]: 13880/30389 cut-off events. [2025-02-08 08:45:56,803 INFO L125 PetriNetUnfolderBase]: For 230/242 co-relation queries the response was YES. [2025-02-08 08:45:56,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51655 conditions, 30389 events. 13880/30389 cut-off events. For 230/242 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 308889 event pairs, 12775 based on Foata normal form. 21734/43727 useless extension candidates. Maximal degree in co-relation 46087. Up to 21126 conditions per place. [2025-02-08 08:45:56,935 INFO L140 encePairwiseOnDemand]: 187/268 looper letters, 78 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2025-02-08 08:45:56,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 187 transitions, 550 flow [2025-02-08 08:45:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2025-02-08 08:45:56,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5970149253731343 [2025-02-08 08:45:56,937 INFO L175 Difference]: Start difference. First operand has 192 places, 268 transitions, 552 flow. Second operand 3 states and 480 transitions. [2025-02-08 08:45:56,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 187 transitions, 550 flow [2025-02-08 08:45:56,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 187 transitions, 550 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:45:56,940 INFO L231 Difference]: Finished difference. Result has 187 places, 187 transitions, 394 flow [2025-02-08 08:45:56,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=187, PETRI_TRANSITIONS=187} [2025-02-08 08:45:56,941 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -5 predicate places. [2025-02-08 08:45:56,941 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 187 transitions, 394 flow [2025-02-08 08:45:56,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:56,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:45:56,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:45:56,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2025-02-08 08:45:56,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash 36722, now seen corresponding path program 1 times [2025-02-08 08:45:56,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:56,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456847506] [2025-02-08 08:45:56,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:56,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:56,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:45:56,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:45:56,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:56,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:56,997 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,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:56,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456847506] [2025-02-08 08:45:56,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456847506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:56,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:56,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:56,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703465871] [2025-02-08 08:45:56,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:56,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:56,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:56,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:56,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:57,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 268 [2025-02-08 08:45:57,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 187 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:57,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 268 [2025-02-08 08:45:57,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:59,157 INFO L124 PetriNetUnfolderBase]: 13880/30388 cut-off events. [2025-02-08 08:45:59,158 INFO L125 PetriNetUnfolderBase]: For 236/248 co-relation queries the response was YES. [2025-02-08 08:45:59,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51656 conditions, 30388 events. 13880/30388 cut-off events. For 236/248 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 309183 event pairs, 12775 based on Foata normal form. 0/21993 useless extension candidates. Maximal degree in co-relation 51643. Up to 21126 conditions per place. [2025-02-08 08:45:59,274 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 77 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2025-02-08 08:45:59,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 186 transitions, 550 flow [2025-02-08 08:45:59,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2025-02-08 08:45:59,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4987562189054726 [2025-02-08 08:45:59,279 INFO L175 Difference]: Start difference. First operand has 187 places, 187 transitions, 394 flow. Second operand 3 states and 401 transitions. [2025-02-08 08:45:59,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 186 transitions, 550 flow [2025-02-08 08:45:59,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 186 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:59,281 INFO L231 Difference]: Finished difference. Result has 186 places, 186 transitions, 392 flow [2025-02-08 08:45:59,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=186, PETRI_TRANSITIONS=186} [2025-02-08 08:45:59,282 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -6 predicate places. [2025-02-08 08:45:59,282 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 186 transitions, 392 flow [2025-02-08 08:45:59,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:59,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:45:59,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:45:59,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2025-02-08 08:45:59,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash 35322311, now seen corresponding path program 1 times [2025-02-08 08:45:59,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:59,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843012750] [2025-02-08 08:45:59,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:59,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:45:59,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:45:59,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:59,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:59,330 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,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:59,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843012750] [2025-02-08 08:45:59,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843012750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:59,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:59,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:59,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250133893] [2025-02-08 08:45:59,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:59,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:45:59,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:59,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:45:59,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:45:59,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 268 [2025-02-08 08:45:59,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 186 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 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,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:59,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 268 [2025-02-08 08:45:59,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:01,337 INFO L124 PetriNetUnfolderBase]: 13880/30387 cut-off events. [2025-02-08 08:46:01,338 INFO L125 PetriNetUnfolderBase]: For 236/248 co-relation queries the response was YES. [2025-02-08 08:46:01,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51654 conditions, 30387 events. 13880/30387 cut-off events. For 236/248 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 309132 event pairs, 12775 based on Foata normal form. 0/21993 useless extension candidates. Maximal degree in co-relation 51641. Up to 21122 conditions per place. [2025-02-08 08:46:01,476 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 75 selfloop transitions, 3 changer transitions 0/185 dead transitions. [2025-02-08 08:46:01,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 185 transitions, 546 flow [2025-02-08 08:46:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2025-02-08 08:46:01,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47294776119402987 [2025-02-08 08:46:01,478 INFO L175 Difference]: Start difference. First operand has 186 places, 186 transitions, 392 flow. Second operand 4 states and 507 transitions. [2025-02-08 08:46:01,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 185 transitions, 546 flow [2025-02-08 08:46:01,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 185 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:01,481 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 392 flow [2025-02-08 08:46:01,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=392, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-02-08 08:46:01,481 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -6 predicate places. [2025-02-08 08:46:01,481 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 392 flow [2025-02-08 08:46:01,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 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,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:01,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:46:01,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:46:01,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2025-02-08 08:46:01,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:01,483 INFO L85 PathProgramCache]: Analyzing trace with hash 35322312, now seen corresponding path program 1 times [2025-02-08 08:46:01,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:01,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447250708] [2025-02-08 08:46:01,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:01,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:01,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:46:01,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:46:01,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:01,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:01,597 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,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:01,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447250708] [2025-02-08 08:46:01,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447250708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:01,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:01,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:46:01,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699994289] [2025-02-08 08:46:01,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:01,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:46:01,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:01,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:46:01,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:46:01,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 268 [2025-02-08 08:46:01,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 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,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:01,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 268 [2025-02-08 08:46:01,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:03,865 INFO L124 PetriNetUnfolderBase]: 13880/30386 cut-off events. [2025-02-08 08:46:03,865 INFO L125 PetriNetUnfolderBase]: For 236/248 co-relation queries the response was YES. [2025-02-08 08:46:03,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51653 conditions, 30386 events. 13880/30386 cut-off events. For 236/248 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 308993 event pairs, 12775 based on Foata normal form. 0/21993 useless extension candidates. Maximal degree in co-relation 51635. Up to 21122 conditions per place. [2025-02-08 08:46:04,007 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 74 selfloop transitions, 3 changer transitions 0/184 dead transitions. [2025-02-08 08:46:04,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 184 transitions, 544 flow [2025-02-08 08:46:04,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2025-02-08 08:46:04,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47201492537313433 [2025-02-08 08:46:04,009 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 392 flow. Second operand 4 states and 506 transitions. [2025-02-08 08:46:04,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 184 transitions, 544 flow [2025-02-08 08:46:04,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 184 transitions, 538 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:46:04,011 INFO L231 Difference]: Finished difference. Result has 185 places, 184 transitions, 390 flow [2025-02-08 08:46:04,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=185, PETRI_TRANSITIONS=184} [2025-02-08 08:46:04,012 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -7 predicate places. [2025-02-08 08:46:04,012 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 184 transitions, 390 flow [2025-02-08 08:46:04,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 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,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:04,012 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] [2025-02-08 08:46:04,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:46:04,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2025-02-08 08:46:04,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash 738388449, now seen corresponding path program 1 times [2025-02-08 08:46:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:04,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082876423] [2025-02-08 08:46:04,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:04,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:46:04,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:46:04,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:04,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:04,040 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,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:04,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082876423] [2025-02-08 08:46:04,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082876423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:04,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:04,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:46:04,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288306922] [2025-02-08 08:46:04,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:04,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:46:04,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:04,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:46:04,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:46:04,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 268 [2025-02-08 08:46:04,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 184 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:04,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 268 [2025-02-08 08:46:04,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:06,234 INFO L124 PetriNetUnfolderBase]: 13880/30387 cut-off events. [2025-02-08 08:46:06,234 INFO L125 PetriNetUnfolderBase]: For 236/248 co-relation queries the response was YES. [2025-02-08 08:46:06,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51655 conditions, 30387 events. 13880/30387 cut-off events. For 236/248 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 309083 event pairs, 12775 based on Foata normal form. 0/21994 useless extension candidates. Maximal degree in co-relation 51637. Up to 21126 conditions per place. [2025-02-08 08:46:06,377 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 76 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2025-02-08 08:46:06,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 185 transitions, 548 flow [2025-02-08 08:46:06,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:46:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:46:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2025-02-08 08:46:06,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4975124378109453 [2025-02-08 08:46:06,379 INFO L175 Difference]: Start difference. First operand has 185 places, 184 transitions, 390 flow. Second operand 3 states and 400 transitions. [2025-02-08 08:46:06,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 185 transitions, 548 flow [2025-02-08 08:46:06,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 185 transitions, 542 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:46:06,386 INFO L231 Difference]: Finished difference. Result has 185 places, 185 transitions, 396 flow [2025-02-08 08:46:06,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=185, PETRI_TRANSITIONS=185} [2025-02-08 08:46:06,387 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -7 predicate places. [2025-02-08 08:46:06,387 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 185 transitions, 396 flow [2025-02-08 08:46:06,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:06,392 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,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:46:06,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2025-02-08 08:46:06,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash -131781595, now seen corresponding path program 1 times [2025-02-08 08:46:06,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:06,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589024552] [2025-02-08 08:46:06,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:06,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:06,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:46:06,410 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,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:06,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:06,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:06,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589024552] [2025-02-08 08:46:06,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589024552] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:46:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275527940] [2025-02-08 08:46:06,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:06,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:46:06,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:46:06,462 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:06,463 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:06,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:46:06,578 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,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:06,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:06,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:46:06,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:46:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:06,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:46:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:46:06,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275527940] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:46:06,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:46:06,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-08 08:46:06,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175191809] [2025-02-08 08:46:06,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:46:06,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:46:06,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:06,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:46:06,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:46:06,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 268 [2025-02-08 08:46:06,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 185 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 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,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:06,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 268 [2025-02-08 08:46:06,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:08,692 INFO L124 PetriNetUnfolderBase]: 13880/30389 cut-off events. [2025-02-08 08:46:08,692 INFO L125 PetriNetUnfolderBase]: For 239/251 co-relation queries the response was YES. [2025-02-08 08:46:08,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51664 conditions, 30389 events. 13880/30389 cut-off events. For 239/251 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 308961 event pairs, 12775 based on Foata normal form. 0/21996 useless extension candidates. Maximal degree in co-relation 51635. Up to 21126 conditions per place. [2025-02-08 08:46:08,889 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 76 selfloop transitions, 4 changer transitions 0/187 dead transitions. [2025-02-08 08:46:08,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 187 transitions, 564 flow [2025-02-08 08:46:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:46:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:46:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2025-02-08 08:46:08,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46044776119402986 [2025-02-08 08:46:08,891 INFO L175 Difference]: Start difference. First operand has 185 places, 185 transitions, 396 flow. Second operand 5 states and 617 transitions. [2025-02-08 08:46:08,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 187 transitions, 564 flow [2025-02-08 08:46:08,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 187 transitions, 560 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 08:46:08,895 INFO L231 Difference]: Finished difference. Result has 190 places, 187 transitions, 418 flow [2025-02-08 08:46:08,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=190, PETRI_TRANSITIONS=187} [2025-02-08 08:46:08,895 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -2 predicate places. [2025-02-08 08:46:08,895 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 187 transitions, 418 flow [2025-02-08 08:46:08,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 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,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:08,899 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:46:09,100 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,SelfDestructingSolverStorable14 [2025-02-08 08:46:09,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2025-02-08 08:46:09,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash -52038747, now seen corresponding path program 2 times [2025-02-08 08:46:09,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:09,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222039178] [2025-02-08 08:46:09,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:46:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:09,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-08 08:46:09,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 25 statements. [2025-02-08 08:46:09,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:46:09,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:46:09,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:09,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222039178] [2025-02-08 08:46:09,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222039178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:09,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:09,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:46:09,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875354253] [2025-02-08 08:46:09,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:09,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:46:09,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:09,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:46:09,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:46:09,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 268 [2025-02-08 08:46:09,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 187 transitions, 418 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:09,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:09,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 268 [2025-02-08 08:46:09,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:11,851 INFO L124 PetriNetUnfolderBase]: 16769/35441 cut-off events. [2025-02-08 08:46:11,852 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2025-02-08 08:46:11,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61046 conditions, 35441 events. 16769/35441 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 360358 event pairs, 12750 based on Foata normal form. 0/26136 useless extension candidates. Maximal degree in co-relation 61001. Up to 21075 conditions per place. [2025-02-08 08:46:11,995 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 134 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2025-02-08 08:46:11,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 239 transitions, 794 flow [2025-02-08 08:46:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:46:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:46:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2025-02-08 08:46:11,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5522388059701493 [2025-02-08 08:46:11,997 INFO L175 Difference]: Start difference. First operand has 190 places, 187 transitions, 418 flow. Second operand 3 states and 444 transitions. [2025-02-08 08:46:11,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 239 transitions, 794 flow [2025-02-08 08:46:11,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 239 transitions, 784 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-02-08 08:46:12,000 INFO L231 Difference]: Finished difference. Result has 189 places, 185 transitions, 408 flow [2025-02-08 08:46:12,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=189, PETRI_TRANSITIONS=185} [2025-02-08 08:46:12,001 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -3 predicate places. [2025-02-08 08:46:12,001 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 185 transitions, 408 flow [2025-02-08 08:46:12,001 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:12,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:12,001 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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:12,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:46:12,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2025-02-08 08:46:12,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash -52038746, now seen corresponding path program 1 times [2025-02-08 08:46:12,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:12,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815815075] [2025-02-08 08:46:12,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:12,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:12,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:46:12,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:46:12,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:12,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:46:12,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:12,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815815075] [2025-02-08 08:46:12,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815815075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:12,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:12,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:46:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848660254] [2025-02-08 08:46:12,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:12,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:46:12,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:12,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:46:12,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:46:12,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 268 [2025-02-08 08:46:12,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 185 transitions, 408 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:46:12,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:12,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 268 [2025-02-08 08:46:12,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:46:14,872 INFO L124 PetriNetUnfolderBase]: 13879/29734 cut-off events. [2025-02-08 08:46:14,873 INFO L125 PetriNetUnfolderBase]: For 943/955 co-relation queries the response was YES. [2025-02-08 08:46:14,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51742 conditions, 29734 events. 13879/29734 cut-off events. For 943/955 co-relation queries the response was YES. Maximal size of possible extension queue 1014. Compared 299537 event pairs, 4792 based on Foata normal form. 703/23191 useless extension candidates. Maximal degree in co-relation 51700. Up to 13159 conditions per place. [2025-02-08 08:46:15,001 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 184 selfloop transitions, 5 changer transitions 0/293 dead transitions. [2025-02-08 08:46:15,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 293 transitions, 1002 flow [2025-02-08 08:46:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:46:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:46:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 612 transitions. [2025-02-08 08:46:15,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5708955223880597 [2025-02-08 08:46:15,004 INFO L175 Difference]: Start difference. First operand has 189 places, 185 transitions, 408 flow. Second operand 4 states and 612 transitions. [2025-02-08 08:46:15,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 293 transitions, 1002 flow [2025-02-08 08:46:15,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 293 transitions, 998 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:46:15,017 INFO L231 Difference]: Finished difference. Result has 191 places, 185 transitions, 426 flow [2025-02-08 08:46:15,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=426, PETRI_PLACES=191, PETRI_TRANSITIONS=185} [2025-02-08 08:46:15,017 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -1 predicate places. [2025-02-08 08:46:15,017 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 185 transitions, 426 flow [2025-02-08 08:46:15,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:46:15,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:15,018 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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:15,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:46:15,018 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2025-02-08 08:46:15,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1790771906, now seen corresponding path program 1 times [2025-02-08 08:46:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:15,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333122471] [2025-02-08 08:46:15,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:15,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:15,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 08:46:15,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 08:46:15,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:15,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:46:15,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:46:15,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 08:46:15,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 08:46:15,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:15,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:46:15,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:46:15,079 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:46:15,079 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (65 of 66 remaining) [2025-02-08 08:46:15,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 66 remaining) [2025-02-08 08:46:15,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 66 remaining) [2025-02-08 08:46:15,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 66 remaining) [2025-02-08 08:46:15,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (56 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (55 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (54 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 66 remaining) [2025-02-08 08:46:15,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 66 remaining) [2025-02-08 08:46:15,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 66 remaining) [2025-02-08 08:46:15,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 66 remaining) [2025-02-08 08:46:15,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 66 remaining) [2025-02-08 08:46:15,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 66 remaining) [2025-02-08 08:46:15,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 66 remaining) [2025-02-08 08:46:15,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 66 remaining) [2025-02-08 08:46:15,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 66 remaining) [2025-02-08 08:46:15,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 66 remaining) [2025-02-08 08:46:15,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 66 remaining) [2025-02-08 08:46:15,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 66 remaining) [2025-02-08 08:46:15,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 66 remaining) [2025-02-08 08:46:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 08:46:15,084 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:46:15,085 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 08:46:15,085 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 08:46:15,171 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 08:46:15,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 358 transitions, 743 flow [2025-02-08 08:46:15,258 INFO L124 PetriNetUnfolderBase]: 187/639 cut-off events. [2025-02-08 08:46:15,258 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 08:46:15,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 639 events. 187/639 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3207 event pairs, 1 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 414. Up to 24 conditions per place. [2025-02-08 08:46:15,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 358 transitions, 743 flow [2025-02-08 08:46:15,274 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 358 transitions, 743 flow [2025-02-08 08:46:15,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:46:15,275 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;@38d202b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:46:15,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-02-08 08:46:15,276 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:46:15,276 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-02-08 08:46:15,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:46:15,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:46:15,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-08 08:46:15,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-02-08 08:46:15,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:46:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash 48177, now seen corresponding path program 1 times [2025-02-08 08:46:15,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:46:15,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558588963] [2025-02-08 08:46:15,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:46:15,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:46:15,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 08:46:15,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 08:46:15,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:46:15,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:46:15,308 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:15,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:46:15,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558588963] [2025-02-08 08:46:15,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558588963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:46:15,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:46:15,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:46:15,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579129944] [2025-02-08 08:46:15,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:46:15,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:46:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:46:15,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:46:15,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:46:15,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 358 [2025-02-08 08:46:15,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 358 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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:15,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:46:15,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 358 [2025-02-08 08:46:15,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand