./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/ticketlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/libvsync/ticketlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 8e9f7836ebdfb0849cf7f06257ab1fd414077ad21cfcb006a14459421df712fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:19:26,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:19:26,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:19:26,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:19:26,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:19:26,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:19:26,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:19:26,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:19:26,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:19:26,349 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:19:26,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:19:26,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:19:26,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:19:26,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:19:26,350 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:19:26,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:19:26,351 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:19:26,351 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:19:26,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:19:26,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:19:26,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:19:26,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:19:26,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:19:26,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:19:26,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:19:26,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:19:26,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:19:26,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:19:26,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:19:26,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:19:26,352 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/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 -> 8e9f7836ebdfb0849cf7f06257ab1fd414077ad21cfcb006a14459421df712fb [2025-03-04 10:19:26,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:19:26,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:19:26,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:19:26,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:19:26,591 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:19:26,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/ticketlock.i [2025-03-04 10:19:27,765 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d37bfa8/a7791ddb81c64fd3ac61a069a06fe09b/FLAG86901d5de [2025-03-04 10:19:28,251 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:19:28,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/ticketlock.i [2025-03-04 10:19:28,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d37bfa8/a7791ddb81c64fd3ac61a069a06fe09b/FLAG86901d5de [2025-03-04 10:19:28,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d37bfa8/a7791ddb81c64fd3ac61a069a06fe09b [2025-03-04 10:19:28,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:19:28,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:19:28,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:19:28,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:19:28,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:19:28,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:19:28" (1/1) ... [2025-03-04 10:19:28,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a14da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:28, skipping insertion in model container [2025-03-04 10:19:28,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:19:28" (1/1) ... [2025-03-04 10:19:28,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:19:29,774 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:19:29,784 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:19:29,784 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:19:29,789 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:19:29,789 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:19:30,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:19:30,229 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:19:30,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-04 10:19:30,315 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-04 10:19:30,315 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-04 10:19:30,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-04 10:19:30,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-04 10:19:30,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-04 10:19:30,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-04 10:19:30,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-04 10:19:30,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-04 10:19:30,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-04 10:19:30,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-04 10:19:30,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-04 10:19:30,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-04 10:19:30,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-04 10:19:30,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-04 10:19:30,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-04 10:19:30,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-04 10:19:30,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-04 10:19:30,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-04 10:19:30,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-04 10:19:30,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-04 10:19:30,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-04 10:19:30,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-04 10:19:30,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-04 10:19:30,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-04 10:19:30,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-04 10:19:30,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-04 10:19:30,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-04 10:19:30,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-04 10:19:30,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-04 10:19:30,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-04 10:19:30,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-04 10:19:30,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-04 10:19:30,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-04 10:19:30,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-04 10:19:30,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-04 10:19:30,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-04 10:19:30,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-04 10:19:30,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-04 10:19:30,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-04 10:19:30,329 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-04 10:19:30,329 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-04 10:19:30,329 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-04 10:19:30,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-04 10:19:30,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-04 10:19:30,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-04 10:19:30,331 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-04 10:19:30,331 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-04 10:19:30,361 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-04 10:19:30,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-04 10:19:30,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-04 10:19:30,363 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-04 10:19:30,363 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-04 10:19:30,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-04 10:19:30,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-04 10:19:30,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-04 10:19:30,365 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-04 10:19:30,365 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-04 10:19:30,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-04 10:19:30,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-04 10:19:30,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-04 10:19:30,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-04 10:19:30,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-04 10:19:30,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-04 10:19:30,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-04 10:19:30,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-04 10:19:30,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-04 10:19:30,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-04 10:19:30,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-04 10:19:30,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-04 10:19:30,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-04 10:19:30,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-04 10:19:30,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-04 10:19:30,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-04 10:19:30,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-04 10:19:30,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-04 10:19:30,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-04 10:19:30,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-04 10:19:30,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-04 10:19:30,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-04 10:19:30,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-04 10:19:30,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-04 10:19:30,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-04 10:19:30,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-04 10:19:30,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-04 10:19:30,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-04 10:19:30,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-04 10:19:30,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-04 10:19:30,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-04 10:19:30,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-04 10:19:30,377 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-04 10:19:30,377 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-04 10:19:30,378 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-04 10:19:30,378 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-04 10:19:30,378 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-04 10:19:30,378 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-04 10:19:30,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-04 10:19:30,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-04 10:19:30,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-04 10:19:30,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-04 10:19:30,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:19:30,598 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:19:30,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30 WrapperNode [2025-03-04 10:19:30,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:19:30,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:19:30,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:19:30,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:19:30,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (1/1) ... [2025-03-04 10:19:30,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (1/1) ... [2025-03-04 10:19:30,712 INFO L138 Inliner]: procedures = 918, calls = 924, calls flagged for inlining = 825, calls inlined = 41, statements flattened = 358 [2025-03-04 10:19:30,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:19:30,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:19:30,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:19:30,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:19:30,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (1/1) ... [2025-03-04 10:19:30,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (1/1) ... [2025-03-04 10:19:30,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (1/1) ... [2025-03-04 10:19:30,737 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 10, 2]. 71 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2, 0]. The 4 writes are split as follows [0, 3, 1]. [2025-03-04 10:19:30,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (1/1) ... [2025-03-04 10:19:30,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (1/1) ... [2025-03-04 10:19:30,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (1/1) ... [2025-03-04 10:19:30,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (1/1) ... [2025-03-04 10:19:30,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (1/1) ... [2025-03-04 10:19:30,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (1/1) ... [2025-03-04 10:19:30,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:19:30,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:19:30,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:19:30,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:19:30,768 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (1/1) ... [2025-03-04 10:19:30,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:19:30,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:19:30,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:19:30,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:19:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-04 10:19:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:19:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:19:30,827 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:19:30,950 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:19:30,951 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:19:31,284 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-04 10:19:31,285 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-03-04 10:19:31,285 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-03-04 10:19:31,285 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-04 10:19:31,285 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4516: havoc vatomic32_get_inc_#t~ret577#1; [2025-03-04 10:19:31,285 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115: havoc vatomic32_get_inc_rlx_#t~ret156#1; [2025-03-04 10:19:31,383 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6007: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-04 10:19:31,383 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6007-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-04 10:19:31,384 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:19:31,384 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:19:31,578 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:19:31,578 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:19:31,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:19:31 BoogieIcfgContainer [2025-03-04 10:19:31,578 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:19:31,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:19:31,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:19:31,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:19:31,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:19:28" (1/3) ... [2025-03-04 10:19:31,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e8c064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:19:31, skipping insertion in model container [2025-03-04 10:19:31,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:30" (2/3) ... [2025-03-04 10:19:31,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e8c064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:19:31, skipping insertion in model container [2025-03-04 10:19:31,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:19:31" (3/3) ... [2025-03-04 10:19:31,587 INFO L128 eAbstractionObserver]: Analyzing ICFG ticketlock.i [2025-03-04 10:19:31,598 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:19:31,600 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ticketlock.i that has 2 procedures, 112 locations, 1 initial locations, 20 loop locations, and 23 error locations. [2025-03-04 10:19:31,601 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:19:31,695 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 10:19:31,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 182 transitions, 371 flow [2025-03-04 10:19:31,786 INFO L124 PetriNetUnfolderBase]: 83/224 cut-off events. [2025-03-04 10:19:31,791 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:19:31,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 224 events. 83/224 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 750 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2025-03-04 10:19:31,797 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 182 transitions, 371 flow [2025-03-04 10:19:31,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 182 transitions, 371 flow [2025-03-04 10:19:31,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:19:31,818 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;@24eeaca2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:19:31,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-04 10:19:31,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:19:31,824 INFO L124 PetriNetUnfolderBase]: 6/14 cut-off events. [2025-03-04 10:19:31,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:19:31,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:31,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:19:31,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:19:31,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:31,829 INFO L85 PathProgramCache]: Analyzing trace with hash 996950918, now seen corresponding path program 1 times [2025-03-04 10:19:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:31,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509095148] [2025-03-04 10:19:31,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:31,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:19:31,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:19:31,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:31,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:31,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:31,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509095148] [2025-03-04 10:19:31,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509095148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:31,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:31,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:19:31,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541570140] [2025-03-04 10:19:31,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:31,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:19:31,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:31,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:19:31,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:19:31,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 182 [2025-03-04 10:19:31,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 182 transitions, 371 flow. Second operand has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 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-03-04 10:19:31,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:31,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 182 [2025-03-04 10:19:32,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:32,301 INFO L124 PetriNetUnfolderBase]: 629/1477 cut-off events. [2025-03-04 10:19:32,302 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:19:32,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2730 conditions, 1477 events. 629/1477 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9224 event pairs, 540 based on Foata normal form. 621/1806 useless extension candidates. Maximal degree in co-relation 2673. Up to 1248 conditions per place. [2025-03-04 10:19:32,311 INFO L140 encePairwiseOnDemand]: 117/182 looper letters, 78 selfloop transitions, 0 changer transitions 0/115 dead transitions. [2025-03-04 10:19:32,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 115 transitions, 393 flow [2025-03-04 10:19:32,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:19:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 10:19:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 217 transitions. [2025-03-04 10:19:32,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2025-03-04 10:19:32,324 INFO L175 Difference]: Start difference. First operand has 115 places, 182 transitions, 371 flow. Second operand 2 states and 217 transitions. [2025-03-04 10:19:32,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 115 transitions, 393 flow [2025-03-04 10:19:32,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 393 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:19:32,330 INFO L231 Difference]: Finished difference. Result has 110 places, 115 transitions, 237 flow [2025-03-04 10:19:32,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=237, PETRI_PLACES=110, PETRI_TRANSITIONS=115} [2025-03-04 10:19:32,335 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places. [2025-03-04 10:19:32,335 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 115 transitions, 237 flow [2025-03-04 10:19:32,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 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-03-04 10:19:32,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:32,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:32,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:19:32,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:19:32,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:32,336 INFO L85 PathProgramCache]: Analyzing trace with hash 281573318, now seen corresponding path program 1 times [2025-03-04 10:19:32,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:32,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158190594] [2025-03-04 10:19:32,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:32,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:32,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:19:32,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:19:32,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:32,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158190594] [2025-03-04 10:19:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158190594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:32,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:32,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:19:32,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608555044] [2025-03-04 10:19:32,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:32,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:19:32,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:32,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:19:32,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:19:32,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 182 [2025-03-04 10:19:32,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 115 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-03-04 10:19:32,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:32,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 182 [2025-03-04 10:19:32,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:32,786 INFO L124 PetriNetUnfolderBase]: 753/1762 cut-off events. [2025-03-04 10:19:32,787 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:19:32,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 1762 events. 753/1762 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11570 event pairs, 540 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 3248. Up to 1247 conditions per place. [2025-03-04 10:19:32,795 INFO L140 encePairwiseOnDemand]: 178/182 looper letters, 140 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2025-03-04 10:19:32,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 175 transitions, 641 flow [2025-03-04 10:19:32,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:19:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:19:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2025-03-04 10:19:32,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44505494505494503 [2025-03-04 10:19:32,798 INFO L175 Difference]: Start difference. First operand has 110 places, 115 transitions, 237 flow. Second operand 3 states and 243 transitions. [2025-03-04 10:19:32,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 175 transitions, 641 flow [2025-03-04 10:19:32,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 175 transitions, 641 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:19:32,801 INFO L231 Difference]: Finished difference. Result has 110 places, 113 transitions, 237 flow [2025-03-04 10:19:32,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=110, PETRI_TRANSITIONS=113} [2025-03-04 10:19:32,802 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places. [2025-03-04 10:19:32,802 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 113 transitions, 237 flow [2025-03-04 10:19:32,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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-03-04 10:19:32,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:32,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:32,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:19:32,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:19:32,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash 281573319, now seen corresponding path program 1 times [2025-03-04 10:19:32,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:32,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922535647] [2025-03-04 10:19:32,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:32,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:32,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:19:32,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:19:32,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:32,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:32,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:32,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:32,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922535647] [2025-03-04 10:19:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922535647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:32,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:32,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:19:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099544611] [2025-03-04 10:19:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:19:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:32,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:19:32,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:19:33,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 182 [2025-03-04 10:19:33,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 113 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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-03-04 10:19:33,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:33,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 182 [2025-03-04 10:19:33,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:33,405 INFO L124 PetriNetUnfolderBase]: 628/2063 cut-off events. [2025-03-04 10:19:33,405 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-04 10:19:33,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 2063 events. 628/2063 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 16808 event pairs, 54 based on Foata normal form. 56/1780 useless extension candidates. Maximal degree in co-relation 3367. Up to 826 conditions per place. [2025-03-04 10:19:33,415 INFO L140 encePairwiseOnDemand]: 175/182 looper letters, 198 selfloop transitions, 5 changer transitions 0/237 dead transitions. [2025-03-04 10:19:33,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 237 transitions, 891 flow [2025-03-04 10:19:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:19:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:19:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 349 transitions. [2025-03-04 10:19:33,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4793956043956044 [2025-03-04 10:19:33,422 INFO L175 Difference]: Start difference. First operand has 110 places, 113 transitions, 237 flow. Second operand 4 states and 349 transitions. [2025-03-04 10:19:33,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 237 transitions, 891 flow [2025-03-04 10:19:33,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 237 transitions, 887 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:19:33,434 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 255 flow [2025-03-04 10:19:33,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-03-04 10:19:33,435 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2025-03-04 10:19:33,435 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 255 flow [2025-03-04 10:19:33,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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-03-04 10:19:33,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:33,435 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:33,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:19:33,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:19:33,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash -830530635, now seen corresponding path program 1 times [2025-03-04 10:19:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:33,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011923054] [2025-03-04 10:19:33,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:33,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:19:33,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:19:33,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:33,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:19:33,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:19:33,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:19:33,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:19:33,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:33,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:19:33,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:19:33,513 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:19:33,513 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2025-03-04 10:19:33,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 40 remaining) [2025-03-04 10:19:33,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (34 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (33 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (32 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 40 remaining) [2025-03-04 10:19:33,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 40 remaining) [2025-03-04 10:19:33,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 40 remaining) [2025-03-04 10:19:33,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 40 remaining) [2025-03-04 10:19:33,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 40 remaining) [2025-03-04 10:19:33,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 40 remaining) [2025-03-04 10:19:33,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 40 remaining) [2025-03-04 10:19:33,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 40 remaining) [2025-03-04 10:19:33,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 40 remaining) [2025-03-04 10:19:33,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 40 remaining) [2025-03-04 10:19:33,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 40 remaining) [2025-03-04 10:19:33,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 40 remaining) [2025-03-04 10:19:33,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:19:33,516 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 10:19:33,520 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 10:19:33,520 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 10:19:33,599 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:19:33,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 309 transitions, 634 flow [2025-03-04 10:19:33,631 INFO L124 PetriNetUnfolderBase]: 157/426 cut-off events. [2025-03-04 10:19:33,632 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:19:33,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 426 events. 157/426 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1787 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 324. Up to 12 conditions per place. [2025-03-04 10:19:33,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 309 transitions, 634 flow [2025-03-04 10:19:33,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 309 transitions, 634 flow [2025-03-04 10:19:33,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:19:33,650 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;@24eeaca2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:19:33,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-03-04 10:19:33,651 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:19:33,652 INFO L124 PetriNetUnfolderBase]: 6/14 cut-off events. [2025-03-04 10:19:33,652 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:19:33,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:33,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:19:33,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-04 10:19:33,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1291831163, now seen corresponding path program 1 times [2025-03-04 10:19:33,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:33,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150259911] [2025-03-04 10:19:33,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:33,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:33,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:19:33,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:19:33,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:33,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:33,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:33,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150259911] [2025-03-04 10:19:33,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150259911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:33,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:33,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:19:33,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181260070] [2025-03-04 10:19:33,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:33,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:19:33,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:33,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:19:33,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:19:33,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 309 [2025-03-04 10:19:33,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 309 transitions, 634 flow. Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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-03-04 10:19:33,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:33,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 309 [2025-03-04 10:19:33,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:40,500 INFO L124 PetriNetUnfolderBase]: 73231/117820 cut-off events. [2025-03-04 10:19:40,500 INFO L125 PetriNetUnfolderBase]: For 478/478 co-relation queries the response was YES. [2025-03-04 10:19:40,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225667 conditions, 117820 events. 73231/117820 cut-off events. For 478/478 co-relation queries the response was YES. Maximal size of possible extension queue 3566. Compared 1041343 event pairs, 63342 based on Foata normal form. 44101/133268 useless extension candidates. Maximal degree in co-relation 218373. Up to 107565 conditions per place. [2025-03-04 10:19:41,190 INFO L140 encePairwiseOnDemand]: 197/309 looper letters, 142 selfloop transitions, 0 changer transitions 0/195 dead transitions. [2025-03-04 10:19:41,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 195 transitions, 690 flow [2025-03-04 10:19:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:19:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 10:19:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 360 transitions. [2025-03-04 10:19:41,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5825242718446602 [2025-03-04 10:19:41,193 INFO L175 Difference]: Start difference. First operand has 192 places, 309 transitions, 634 flow. Second operand 2 states and 360 transitions. [2025-03-04 10:19:41,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 195 transitions, 690 flow [2025-03-04 10:19:41,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 195 transitions, 690 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:19:41,197 INFO L231 Difference]: Finished difference. Result has 183 places, 195 transitions, 406 flow [2025-03-04 10:19:41,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=406, PETRI_PLACES=183, PETRI_TRANSITIONS=195} [2025-03-04 10:19:41,198 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -9 predicate places. [2025-03-04 10:19:41,199 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 195 transitions, 406 flow [2025-03-04 10:19:41,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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-03-04 10:19:41,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:41,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:41,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:19:41,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-04 10:19:41,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash 193657115, now seen corresponding path program 1 times [2025-03-04 10:19:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:41,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63522966] [2025-03-04 10:19:41,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:41,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:41,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:19:41,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:19:41,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:41,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:41,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:41,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63522966] [2025-03-04 10:19:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63522966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:41,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:19:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873781229] [2025-03-04 10:19:41,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:41,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:19:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:41,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:19:41,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:19:41,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 309 [2025-03-04 10:19:41,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 195 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:41,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:41,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 309 [2025-03-04 10:19:41,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:48,751 INFO L124 PetriNetUnfolderBase]: 87057/140938 cut-off events. [2025-03-04 10:19:48,751 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2025-03-04 10:19:48,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268829 conditions, 140938 events. 87057/140938 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 4275. Compared 1280911 event pairs, 63288 based on Foata normal form. 0/107876 useless extension candidates. Maximal degree in co-relation 268824. Up to 107447 conditions per place. [2025-03-04 10:19:49,361 INFO L140 encePairwiseOnDemand]: 305/309 looper letters, 266 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2025-03-04 10:19:49,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 317 transitions, 1186 flow [2025-03-04 10:19:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:19:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:19:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2025-03-04 10:19:49,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44983818770226536 [2025-03-04 10:19:49,364 INFO L175 Difference]: Start difference. First operand has 183 places, 195 transitions, 406 flow. Second operand 3 states and 417 transitions. [2025-03-04 10:19:49,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 317 transitions, 1186 flow [2025-03-04 10:19:49,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 317 transitions, 1186 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:19:49,371 INFO L231 Difference]: Finished difference. Result has 183 places, 193 transitions, 406 flow [2025-03-04 10:19:49,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=183, PETRI_TRANSITIONS=193} [2025-03-04 10:19:49,372 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -9 predicate places. [2025-03-04 10:19:49,372 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 193 transitions, 406 flow [2025-03-04 10:19:49,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:49,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:49,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:49,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:19:49,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-04 10:19:49,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:49,374 INFO L85 PathProgramCache]: Analyzing trace with hash 193657116, now seen corresponding path program 1 times [2025-03-04 10:19:49,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:49,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105318355] [2025-03-04 10:19:49,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:49,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:49,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:19:49,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:19:49,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:49,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:49,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105318355] [2025-03-04 10:19:49,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105318355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:49,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:49,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:19:49,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664746255] [2025-03-04 10:19:49,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:49,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:19:49,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:49,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:19:49,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:19:49,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 309 [2025-03-04 10:19:49,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 193 transitions, 406 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:49,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:49,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 309 [2025-03-04 10:19:49,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:57,164 INFO L124 PetriNetUnfolderBase]: 80112/133406 cut-off events. [2025-03-04 10:19:57,164 INFO L125 PetriNetUnfolderBase]: For 3642/3645 co-relation queries the response was YES. [2025-03-04 10:19:57,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254352 conditions, 133406 events. 80112/133406 cut-off events. For 3642/3645 co-relation queries the response was YES. Maximal size of possible extension queue 3801. Compared 1248942 event pairs, 28823 based on Foata normal form. 0/102648 useless extension candidates. Maximal degree in co-relation 254346. Up to 70499 conditions per place. [2025-03-04 10:19:57,836 INFO L140 encePairwiseOnDemand]: 302/309 looper letters, 387 selfloop transitions, 5 changer transitions 0/441 dead transitions. [2025-03-04 10:19:57,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 441 transitions, 1686 flow [2025-03-04 10:19:57,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:19:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:19:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2025-03-04 10:19:57,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48381877022653724 [2025-03-04 10:19:57,838 INFO L175 Difference]: Start difference. First operand has 183 places, 193 transitions, 406 flow. Second operand 4 states and 598 transitions. [2025-03-04 10:19:57,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 441 transitions, 1686 flow [2025-03-04 10:19:58,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 441 transitions, 1682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:19:58,015 INFO L231 Difference]: Finished difference. Result has 185 places, 193 transitions, 424 flow [2025-03-04 10:19:58,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=424, PETRI_PLACES=185, PETRI_TRANSITIONS=193} [2025-03-04 10:19:58,016 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -7 predicate places. [2025-03-04 10:19:58,016 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 193 transitions, 424 flow [2025-03-04 10:19:58,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:58,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:58,016 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:58,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:19:58,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-04 10:19:58,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash -577955326, now seen corresponding path program 1 times [2025-03-04 10:19:58,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:58,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194040733] [2025-03-04 10:19:58,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:58,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:58,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:19:58,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:19:58,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:58,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:19:58,036 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:19:58,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:19:58,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:19:58,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:58,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:19:58,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:19:58,055 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:19:58,055 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 56 remaining) [2025-03-04 10:19:58,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (50 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (49 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (48 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2025-03-04 10:19:58,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 56 remaining) [2025-03-04 10:19:58,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2025-03-04 10:19:58,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2025-03-04 10:19:58,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2025-03-04 10:19:58,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2025-03-04 10:19:58,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2025-03-04 10:19:58,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2025-03-04 10:19:58,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2025-03-04 10:19:58,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2025-03-04 10:19:58,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:19:58,059 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 10:19:58,059 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 10:19:58,059 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 10:19:58,152 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:19:58,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 269 places, 436 transitions, 899 flow [2025-03-04 10:19:58,210 INFO L124 PetriNetUnfolderBase]: 250/691 cut-off events. [2025-03-04 10:19:58,210 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 10:19:58,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 691 events. 250/691 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3316 event pairs, 1 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 513. Up to 24 conditions per place. [2025-03-04 10:19:58,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 269 places, 436 transitions, 899 flow [2025-03-04 10:19:58,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 269 places, 436 transitions, 899 flow [2025-03-04 10:19:58,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:19:58,238 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;@24eeaca2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:19:58,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-03-04 10:19:58,239 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:19:58,239 INFO L124 PetriNetUnfolderBase]: 6/14 cut-off events. [2025-03-04 10:19:58,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:19:58,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:58,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:19:58,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-04 10:19:58,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1707908143, now seen corresponding path program 1 times [2025-03-04 10:19:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:58,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554255787] [2025-03-04 10:19:58,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:58,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:58,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:19:58,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:19:58,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:58,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:58,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:58,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554255787] [2025-03-04 10:19:58,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554255787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:58,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:58,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:19:58,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598808303] [2025-03-04 10:19:58,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:58,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:19:58,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:58,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:19:58,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:19:58,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 436 [2025-03-04 10:19:58,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 436 transitions, 899 flow. Second operand has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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-03-04 10:19:58,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:58,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 436 [2025-03-04 10:19:58,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand