./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/clhlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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/clhlock.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 bed480fb9329cf4d2bde4e192428cf2ff72174b29c5e6148c18915395bc76ca3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:18:47,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:18:47,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:18:47,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:18:47,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:18:47,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:18:47,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:18:47,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:18:47,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:18:47,690 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:18:47,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:18:47,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:18:47,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:18:47,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:18:47,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:18:47,693 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:18:47,693 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:18:47,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:18:47,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:18:47,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:18:47,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:47,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:18:47,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:18:47,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:18:47,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:18:47,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:18:47,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:18:47,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:18:47,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:18:47,694 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 -> bed480fb9329cf4d2bde4e192428cf2ff72174b29c5e6148c18915395bc76ca3 [2025-03-04 10:18:47,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:18:47,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:18:47,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:18:47,924 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:18:47,924 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:18:47,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/clhlock.i [2025-03-04 10:18:49,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4200d1520/454bf9175b4547be8b9042287ef9ff29/FLAGac23765fe [2025-03-04 10:18:49,565 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:18:49,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/clhlock.i [2025-03-04 10:18:49,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4200d1520/454bf9175b4547be8b9042287ef9ff29/FLAGac23765fe [2025-03-04 10:18:49,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4200d1520/454bf9175b4547be8b9042287ef9ff29 [2025-03-04 10:18:49,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:18:49,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:18:49,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:49,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:18:49,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:18:49,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:49" (1/1) ... [2025-03-04 10:18:49,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fadf487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:49, skipping insertion in model container [2025-03-04 10:18:49,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:49" (1/1) ... [2025-03-04 10:18:49,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:18:51,022 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:18:51,025 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:18:51,026 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:18:51,030 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:18:51,031 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:18:51,149 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:18:51,157 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:18:51,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:51,359 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:18:51,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-04 10:18:51,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-04 10:18:51,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-04 10:18:51,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-04 10:18:51,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-04 10:18:51,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-04 10:18:51,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-04 10:18:51,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-04 10:18:51,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-04 10:18:51,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-04 10:18:51,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-04 10:18:51,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-04 10:18:51,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-04 10:18:51,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-04 10:18:51,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-04 10:18:51,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-04 10:18:51,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-04 10:18:51,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-04 10:18:51,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-04 10:18:51,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-04 10:18:51,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-04 10:18:51,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-04 10:18:51,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-04 10:18:51,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-04 10:18:51,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-04 10:18:51,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-04 10:18:51,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-04 10:18:51,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-04 10:18:51,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-04 10:18:51,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-04 10:18:51,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-04 10:18:51,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-04 10:18:51,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-04 10:18:51,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-04 10:18:51,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-04 10:18:51,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-04 10:18:51,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-04 10:18:51,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-04 10:18:51,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-04 10:18:51,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-04 10:18:51,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-04 10:18:51,481 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-04 10:18:51,481 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-04 10:18:51,481 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-04 10:18:51,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-04 10:18:51,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-04 10:18:51,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-04 10:18:51,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-04 10:18:51,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-04 10:18:51,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-04 10:18:51,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-04 10:18:51,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-04 10:18:51,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-04 10:18:51,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-04 10:18:51,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-04 10:18:51,485 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-04 10:18:51,485 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-04 10:18:51,485 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-04 10:18:51,485 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-04 10:18:51,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-04 10:18:51,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-04 10:18:51,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-04 10:18:51,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-04 10:18:51,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-04 10:18:51,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-04 10:18:51,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-04 10:18:51,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-04 10:18:51,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-04 10:18:51,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-04 10:18:51,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-04 10:18:51,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-04 10:18:51,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-04 10:18:51,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-04 10:18:51,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-04 10:18:51,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-04 10:18:51,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-04 10:18:51,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-04 10:18:51,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-04 10:18:51,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-04 10:18:51,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-04 10:18:51,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-04 10:18:51,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-04 10:18:51,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-04 10:18:51,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-04 10:18:51,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-04 10:18:51,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-04 10:18:51,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-04 10:18:51,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-04 10:18:51,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-04 10:18:51,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-04 10:18:51,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-04 10:18:51,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-04 10:18:51,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-04 10:18:51,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-04 10:18:51,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-04 10:18:51,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-04 10:18:51,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-04 10:18:51,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-04 10:18:51,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-04 10:18:51,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-04 10:18:51,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:51,713 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:18:51,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:51 WrapperNode [2025-03-04 10:18:51,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:51,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:51,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:18:51,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:18:51,718 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:18:51" (1/1) ... [2025-03-04 10:18:51,759 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:18:51" (1/1) ... [2025-03-04 10:18:51,784 INFO L138 Inliner]: procedures = 919, calls = 937, calls flagged for inlining = 820, calls inlined = 37, statements flattened = 315 [2025-03-04 10:18:51,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:51,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:18:51,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:18:51,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:18:51,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:51" (1/1) ... [2025-03-04 10:18:51,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:51" (1/1) ... [2025-03-04 10:18:51,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:51" (1/1) ... [2025-03-04 10:18:51,808 INFO L175 MemorySlicer]: Split 29 memory accesses to 4 slices as follows [2, 9, 16, 2]. 55 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 9, 0]. The 8 writes are split as follows [0, 5, 2, 1]. [2025-03-04 10:18:51,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:51" (1/1) ... [2025-03-04 10:18:51,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:51" (1/1) ... [2025-03-04 10:18:51,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:51" (1/1) ... [2025-03-04 10:18:51,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:51" (1/1) ... [2025-03-04 10:18:51,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:51" (1/1) ... [2025-03-04 10:18:51,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:51" (1/1) ... [2025-03-04 10:18:51,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:18:51,828 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:18:51,828 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:18:51,829 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:18:51,829 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:51" (1/1) ... [2025-03-04 10:18:51,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:51,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:51,857 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:18:51,859 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:18:51,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:18:51,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:18:51,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:18:51,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 10:18:51,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:18:51,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:18:51,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:18:51,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:18:51,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-04 10:18:51,876 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:18:51,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:18:51,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 10:18:51,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:18:51,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:18:51,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:18:51,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 10:18:51,878 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:18:52,030 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:18:52,032 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:18:52,315 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-03-04 10:18:52,451 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6012-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-04 10:18:52,451 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6012: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-04 10:18:52,452 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:18:52,452 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:18:52,646 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:18:52,648 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:18:52,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:52 BoogieIcfgContainer [2025-03-04 10:18:52,649 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:18:52,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:18:52,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:18:52,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:18:52,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:18:49" (1/3) ... [2025-03-04 10:18:52,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5334d6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:52, skipping insertion in model container [2025-03-04 10:18:52,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:51" (2/3) ... [2025-03-04 10:18:52,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5334d6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:52, skipping insertion in model container [2025-03-04 10:18:52,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:52" (3/3) ... [2025-03-04 10:18:52,657 INFO L128 eAbstractionObserver]: Analyzing ICFG clhlock.i [2025-03-04 10:18:52,668 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:18:52,671 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG clhlock.i that has 2 procedures, 123 locations, 1 initial locations, 19 loop locations, and 35 error locations. [2025-03-04 10:18:52,671 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:18:52,764 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 10:18:52,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 185 transitions, 377 flow [2025-03-04 10:18:52,850 INFO L124 PetriNetUnfolderBase]: 75/227 cut-off events. [2025-03-04 10:18:52,852 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:18:52,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 227 events. 75/227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 654 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. [2025-03-04 10:18:52,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 185 transitions, 377 flow [2025-03-04 10:18:52,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 185 transitions, 377 flow [2025-03-04 10:18:52,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:18:52,880 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;@3ac09ca8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:18:52,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-03-04 10:18:52,885 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:18:52,885 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-04 10:18:52,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:18:52,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:52,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 10:18:52,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-04 10:18:52,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash 30090, now seen corresponding path program 1 times [2025-03-04 10:18:52,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:52,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984309018] [2025-03-04 10:18:52,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:52,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:52,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 10:18:52,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 10:18:52,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:52,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:53,223 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:18:53,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:53,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984309018] [2025-03-04 10:18:53,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984309018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:53,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:53,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494906080] [2025-03-04 10:18:53,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:53,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:53,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:53,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:53,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:53,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 185 [2025-03-04 10:18:53,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 185 transitions, 377 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:18:53,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:53,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 185 [2025-03-04 10:18:53,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:53,600 INFO L124 PetriNetUnfolderBase]: 487/1347 cut-off events. [2025-03-04 10:18:53,600 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:53,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 1347 events. 487/1347 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8538 event pairs, 430 based on Foata normal form. 491/1542 useless extension candidates. Maximal degree in co-relation 2266. Up to 992 conditions per place. [2025-03-04 10:18:53,613 INFO L140 encePairwiseOnDemand]: 125/185 looper letters, 73 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2025-03-04 10:18:53,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 407 flow [2025-03-04 10:18:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2025-03-04 10:18:53,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5099099099099099 [2025-03-04 10:18:53,625 INFO L175 Difference]: Start difference. First operand has 126 places, 185 transitions, 377 flow. Second operand 3 states and 283 transitions. [2025-03-04 10:18:53,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 407 flow [2025-03-04 10:18:53,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 125 transitions, 407 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:18:53,631 INFO L231 Difference]: Finished difference. Result has 123 places, 125 transitions, 261 flow [2025-03-04 10:18:53,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=123, PETRI_TRANSITIONS=125} [2025-03-04 10:18:53,638 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -3 predicate places. [2025-03-04 10:18:53,638 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 125 transitions, 261 flow [2025-03-04 10:18:53,638 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:18:53,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:53,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 10:18:53,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:18:53,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-04 10:18:53,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:53,639 INFO L85 PathProgramCache]: Analyzing trace with hash 30091, now seen corresponding path program 1 times [2025-03-04 10:18:53,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:53,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043101153] [2025-03-04 10:18:53,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:53,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:53,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 10:18:53,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 10:18:53,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:53,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:53,820 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:18:53,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:53,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043101153] [2025-03-04 10:18:53,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043101153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:53,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:53,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:53,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7016809] [2025-03-04 10:18:53,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:53,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:53,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:53,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:53,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:53,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 185 [2025-03-04 10:18:53,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 125 transitions, 261 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:18:53,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:53,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 185 [2025-03-04 10:18:53,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:54,114 INFO L124 PetriNetUnfolderBase]: 487/1346 cut-off events. [2025-03-04 10:18:54,115 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:54,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2348 conditions, 1346 events. 487/1346 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8546 event pairs, 430 based on Foata normal form. 0/1051 useless extension candidates. Maximal degree in co-relation 2336. Up to 992 conditions per place. [2025-03-04 10:18:54,120 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 72 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2025-03-04 10:18:54,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 124 transitions, 407 flow [2025-03-04 10:18:54,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2025-03-04 10:18:54,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40540540540540543 [2025-03-04 10:18:54,124 INFO L175 Difference]: Start difference. First operand has 123 places, 125 transitions, 261 flow. Second operand 3 states and 225 transitions. [2025-03-04 10:18:54,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 124 transitions, 407 flow [2025-03-04 10:18:54,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 124 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:54,127 INFO L231 Difference]: Finished difference. Result has 122 places, 124 transitions, 259 flow [2025-03-04 10:18:54,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=122, PETRI_TRANSITIONS=124} [2025-03-04 10:18:54,128 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -4 predicate places. [2025-03-04 10:18:54,128 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 124 transitions, 259 flow [2025-03-04 10:18:54,128 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:18:54,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:54,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:18:54,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:18:54,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-04 10:18:54,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash 28943616, now seen corresponding path program 1 times [2025-03-04 10:18:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:54,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361063151] [2025-03-04 10:18:54,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:54,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:18:54,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:18:54,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:54,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:54,222 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:18:54,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:54,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361063151] [2025-03-04 10:18:54,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361063151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:54,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:54,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:54,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259252426] [2025-03-04 10:18:54,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:54,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:54,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:54,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:54,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:54,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 185 [2025-03-04 10:18:54,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 124 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 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:18:54,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:54,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 185 [2025-03-04 10:18:54,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:54,516 INFO L124 PetriNetUnfolderBase]: 487/1345 cut-off events. [2025-03-04 10:18:54,516 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:54,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2346 conditions, 1345 events. 487/1345 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8546 event pairs, 430 based on Foata normal form. 0/1051 useless extension candidates. Maximal degree in co-relation 2334. Up to 988 conditions per place. [2025-03-04 10:18:54,522 INFO L140 encePairwiseOnDemand]: 181/185 looper letters, 70 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2025-03-04 10:18:54,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 123 transitions, 403 flow [2025-03-04 10:18:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2025-03-04 10:18:54,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37027027027027026 [2025-03-04 10:18:54,525 INFO L175 Difference]: Start difference. First operand has 122 places, 124 transitions, 259 flow. Second operand 4 states and 274 transitions. [2025-03-04 10:18:54,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 123 transitions, 403 flow [2025-03-04 10:18:54,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 123 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:54,527 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 259 flow [2025-03-04 10:18:54,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2025-03-04 10:18:54,527 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -4 predicate places. [2025-03-04 10:18:54,528 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 259 flow [2025-03-04 10:18:54,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 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:18:54,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:54,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:18:54,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:18:54,528 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-04 10:18:54,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash 28943617, now seen corresponding path program 1 times [2025-03-04 10:18:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:54,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518763754] [2025-03-04 10:18:54,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:54,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:54,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:18:54,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:18:54,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:54,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:54,657 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:18:54,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:54,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518763754] [2025-03-04 10:18:54,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518763754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:54,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:54,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:54,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737747828] [2025-03-04 10:18:54,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:54,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:54,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:54,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:54,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:54,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 185 [2025-03-04 10:18:54,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 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:18:54,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:54,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 185 [2025-03-04 10:18:54,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:54,970 INFO L124 PetriNetUnfolderBase]: 487/1344 cut-off events. [2025-03-04 10:18:54,971 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:54,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 1344 events. 487/1344 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8537 event pairs, 430 based on Foata normal form. 0/1051 useless extension candidates. Maximal degree in co-relation 2328. Up to 988 conditions per place. [2025-03-04 10:18:54,977 INFO L140 encePairwiseOnDemand]: 181/185 looper letters, 69 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-03-04 10:18:54,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 401 flow [2025-03-04 10:18:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2025-03-04 10:18:54,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3689189189189189 [2025-03-04 10:18:54,979 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 259 flow. Second operand 4 states and 273 transitions. [2025-03-04 10:18:54,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 401 flow [2025-03-04 10:18:54,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 395 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:54,980 INFO L231 Difference]: Finished difference. Result has 121 places, 122 transitions, 257 flow [2025-03-04 10:18:54,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=121, PETRI_TRANSITIONS=122} [2025-03-04 10:18:54,981 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -5 predicate places. [2025-03-04 10:18:54,981 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 257 flow [2025-03-04 10:18:54,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 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:18:54,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:54,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:54,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:18:54,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-04 10:18:54,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1172007099, now seen corresponding path program 1 times [2025-03-04 10:18:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:54,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328449456] [2025-03-04 10:18:54,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:55,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:18:55,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:18:55,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:55,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:55,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:55,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328449456] [2025-03-04 10:18:55,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328449456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:55,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:55,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:55,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131702503] [2025-03-04 10:18:55,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:55,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:55,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:55,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:55,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:55,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 185 [2025-03-04 10:18:55,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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:18:55,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:55,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 185 [2025-03-04 10:18:55,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:55,197 INFO L124 PetriNetUnfolderBase]: 487/1345 cut-off events. [2025-03-04 10:18:55,197 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:55,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 1345 events. 487/1345 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8561 event pairs, 430 based on Foata normal form. 0/1051 useless extension candidates. Maximal degree in co-relation 2330. Up to 992 conditions per place. [2025-03-04 10:18:55,203 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 71 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2025-03-04 10:18:55,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 123 transitions, 405 flow [2025-03-04 10:18:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2025-03-04 10:18:55,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4036036036036036 [2025-03-04 10:18:55,206 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 257 flow. Second operand 3 states and 224 transitions. [2025-03-04 10:18:55,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 123 transitions, 405 flow [2025-03-04 10:18:55,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 123 transitions, 399 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:55,212 INFO L231 Difference]: Finished difference. Result has 121 places, 123 transitions, 263 flow [2025-03-04 10:18:55,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=121, PETRI_TRANSITIONS=123} [2025-03-04 10:18:55,213 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -5 predicate places. [2025-03-04 10:18:55,213 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 123 transitions, 263 flow [2025-03-04 10:18:55,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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:18:55,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:55,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:55,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:18:55,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-04 10:18:55,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash -667539693, now seen corresponding path program 1 times [2025-03-04 10:18:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:55,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788446646] [2025-03-04 10:18:55,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:55,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:55,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:18:55,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:18:55,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:55,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:55,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788446646] [2025-03-04 10:18:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788446646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762317846] [2025-03-04 10:18:55,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:55,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:55,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:55,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:55,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:18:55,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:18:55,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:18:55,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:55,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:55,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:18:55,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:55,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:55,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762317846] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:55,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:55,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-04 10:18:55,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737894366] [2025-03-04 10:18:55,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:55,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:55,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:55,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:55,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:55,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 185 [2025-03-04 10:18:55,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 123 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 52.833333333333336) internal successors, (317), 6 states have internal predecessors, (317), 0 states have call successors, (0), 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:18:55,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:55,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 185 [2025-03-04 10:18:55,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:55,575 INFO L124 PetriNetUnfolderBase]: 487/1347 cut-off events. [2025-03-04 10:18:55,575 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 10:18:55,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2356 conditions, 1347 events. 487/1347 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8535 event pairs, 430 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 2330. Up to 992 conditions per place. [2025-03-04 10:18:55,580 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 71 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2025-03-04 10:18:55,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 125 transitions, 421 flow [2025-03-04 10:18:55,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 327 transitions. [2025-03-04 10:18:55,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3535135135135135 [2025-03-04 10:18:55,582 INFO L175 Difference]: Start difference. First operand has 121 places, 123 transitions, 263 flow. Second operand 5 states and 327 transitions. [2025-03-04 10:18:55,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 125 transitions, 421 flow [2025-03-04 10:18:55,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 125 transitions, 417 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:55,585 INFO L231 Difference]: Finished difference. Result has 126 places, 125 transitions, 285 flow [2025-03-04 10:18:55,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=126, PETRI_TRANSITIONS=125} [2025-03-04 10:18:55,586 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2025-03-04 10:18:55,586 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 125 transitions, 285 flow [2025-03-04 10:18:55,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.833333333333336) internal successors, (317), 6 states have internal predecessors, (317), 0 states have call successors, (0), 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:18:55,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:55,587 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:55,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:55,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:18:55,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-04 10:18:55,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1547920723, now seen corresponding path program 2 times [2025-03-04 10:18:55,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:55,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123770340] [2025-03-04 10:18:55,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:55,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:18:55,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 19 statements. [2025-03-04 10:18:55,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:55,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:18:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123770340] [2025-03-04 10:18:55,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123770340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:55,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:55,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:55,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702449985] [2025-03-04 10:18:55,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:55,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:55,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:55,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:55,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:55,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 185 [2025-03-04 10:18:55,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 125 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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:18:55,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:55,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 185 [2025-03-04 10:18:55,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:56,078 INFO L124 PetriNetUnfolderBase]: 583/1571 cut-off events. [2025-03-04 10:18:56,078 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 10:18:56,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 1571 events. 583/1571 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 10394 event pairs, 430 based on Foata normal form. 0/1260 useless extension candidates. Maximal degree in co-relation 2733. Up to 994 conditions per place. [2025-03-04 10:18:56,083 INFO L140 encePairwiseOnDemand]: 181/185 looper letters, 123 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2025-03-04 10:18:56,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 171 transitions, 627 flow [2025-03-04 10:18:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-04 10:18:56,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4720720720720721 [2025-03-04 10:18:56,085 INFO L175 Difference]: Start difference. First operand has 126 places, 125 transitions, 285 flow. Second operand 3 states and 262 transitions. [2025-03-04 10:18:56,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 171 transitions, 627 flow [2025-03-04 10:18:56,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 171 transitions, 617 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:56,087 INFO L231 Difference]: Finished difference. Result has 125 places, 123 transitions, 275 flow [2025-03-04 10:18:56,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=275, PETRI_PLACES=125, PETRI_TRANSITIONS=123} [2025-03-04 10:18:56,088 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, -1 predicate places. [2025-03-04 10:18:56,088 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 123 transitions, 275 flow [2025-03-04 10:18:56,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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:18:56,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:56,088 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:56,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:18:56,088 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-04 10:18:56,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1547920724, now seen corresponding path program 1 times [2025-03-04 10:18:56,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:56,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555816713] [2025-03-04 10:18:56,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:56,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:56,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:18:56,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:18:56,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:56,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:18:56,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:56,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555816713] [2025-03-04 10:18:56,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555816713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:56,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:56,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:56,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218307497] [2025-03-04 10:18:56,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:56,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:56,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:56,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:56,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:56,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 185 [2025-03-04 10:18:56,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 123 transitions, 275 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:18:56,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:56,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 185 [2025-03-04 10:18:56,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:56,549 INFO L124 PetriNetUnfolderBase]: 486/1680 cut-off events. [2025-03-04 10:18:56,550 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 10:18:56,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 1680 events. 486/1680 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 12633 event pairs, 43 based on Foata normal form. 45/1471 useless extension candidates. Maximal degree in co-relation 2698. Up to 662 conditions per place. [2025-03-04 10:18:56,556 INFO L140 encePairwiseOnDemand]: 178/185 looper letters, 167 selfloop transitions, 5 changer transitions 0/219 dead transitions. [2025-03-04 10:18:56,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 219 transitions, 811 flow [2025-03-04 10:18:56,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2025-03-04 10:18:56,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49594594594594593 [2025-03-04 10:18:56,558 INFO L175 Difference]: Start difference. First operand has 125 places, 123 transitions, 275 flow. Second operand 4 states and 367 transitions. [2025-03-04 10:18:56,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 219 transitions, 811 flow [2025-03-04 10:18:56,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 219 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:56,563 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 293 flow [2025-03-04 10:18:56,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2025-03-04 10:18:56,564 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 1 predicate places. [2025-03-04 10:18:56,564 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 293 flow [2025-03-04 10:18:56,564 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:18:56,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:56,564 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:56,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:18:56,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-04 10:18:56,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:56,566 INFO L85 PathProgramCache]: Analyzing trace with hash -173284323, now seen corresponding path program 1 times [2025-03-04 10:18:56,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:56,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540772346] [2025-03-04 10:18:56,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:56,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:56,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:18:56,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:18:56,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:56,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:18:56,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:18:56,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:18:56,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:18:56,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:56,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:18:56,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:18:56,637 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:18:56,637 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 60 remaining) [2025-03-04 10:18:56,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 60 remaining) [2025-03-04 10:18:56,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 60 remaining) [2025-03-04 10:18:56,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 60 remaining) [2025-03-04 10:18:56,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 60 remaining) [2025-03-04 10:18:56,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 60 remaining) [2025-03-04 10:18:56,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 60 remaining) [2025-03-04 10:18:56,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 60 remaining) [2025-03-04 10:18:56,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 60 remaining) [2025-03-04 10:18:56,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (50 of 60 remaining) [2025-03-04 10:18:56,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (49 of 60 remaining) [2025-03-04 10:18:56,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (48 of 60 remaining) [2025-03-04 10:18:56,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 60 remaining) [2025-03-04 10:18:56,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 60 remaining) [2025-03-04 10:18:56,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 60 remaining) [2025-03-04 10:18:56,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 60 remaining) [2025-03-04 10:18:56,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 60 remaining) [2025-03-04 10:18:56,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 60 remaining) [2025-03-04 10:18:56,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 60 remaining) [2025-03-04 10:18:56,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:18:56,644 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:56,647 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 10:18:56,647 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 10:18:56,729 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:18:56,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 296 transitions, 608 flow [2025-03-04 10:18:56,772 INFO L124 PetriNetUnfolderBase]: 135/413 cut-off events. [2025-03-04 10:18:56,773 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:18:56,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 413 events. 135/413 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1666 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 292. Up to 12 conditions per place. [2025-03-04 10:18:56,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 296 transitions, 608 flow [2025-03-04 10:18:56,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 296 transitions, 608 flow [2025-03-04 10:18:56,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:18:56,783 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;@3ac09ca8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:18:56,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-03-04 10:18:56,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:18:56,784 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-04 10:18:56,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:18:56,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:56,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 10:18:56,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-03-04 10:18:56,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash 39562, now seen corresponding path program 1 times [2025-03-04 10:18:56,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:56,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794434522] [2025-03-04 10:18:56,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:56,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 10:18:56,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 10:18:56,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:56,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:56,854 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:18:56,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:56,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794434522] [2025-03-04 10:18:56,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794434522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:56,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:56,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:56,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189621744] [2025-03-04 10:18:56,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:56,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:56,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:56,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:56,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:56,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 296 [2025-03-04 10:18:56,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 296 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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:18:56,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:56,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 296 [2025-03-04 10:18:56,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:02,021 INFO L124 PetriNetUnfolderBase]: 45488/81745 cut-off events. [2025-03-04 10:19:02,021 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2025-03-04 10:19:02,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149616 conditions, 81745 events. 45488/81745 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 2114. Compared 779549 event pairs, 40506 based on Foata normal form. 27751/90006 useless extension candidates. Maximal degree in co-relation 146714. Up to 67641 conditions per place. [2025-03-04 10:19:02,384 INFO L140 encePairwiseOnDemand]: 202/296 looper letters, 123 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2025-03-04 10:19:02,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 202 transitions, 670 flow [2025-03-04 10:19:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:19:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:19:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2025-03-04 10:19:02,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2025-03-04 10:19:02,387 INFO L175 Difference]: Start difference. First operand has 201 places, 296 transitions, 608 flow. Second operand 3 states and 448 transitions. [2025-03-04 10:19:02,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 202 transitions, 670 flow [2025-03-04 10:19:02,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 202 transitions, 670 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:19:02,390 INFO L231 Difference]: Finished difference. Result has 196 places, 202 transitions, 424 flow [2025-03-04 10:19:02,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=196, PETRI_TRANSITIONS=202} [2025-03-04 10:19:02,392 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -5 predicate places. [2025-03-04 10:19:02,392 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 202 transitions, 424 flow [2025-03-04 10:19:02,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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:02,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:02,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 10:19:02,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:19:02,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-03-04 10:19:02,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash 39563, now seen corresponding path program 1 times [2025-03-04 10:19:02,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:02,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460469727] [2025-03-04 10:19:02,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:02,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:02,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 10:19:02,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 10:19:02,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:02,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:02,461 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:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460469727] [2025-03-04 10:19:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460469727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:02,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:02,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:19:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039957119] [2025-03-04 10:19:02,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:02,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:19:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:02,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:19:02,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:19:02,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 296 [2025-03-04 10:19:02,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 202 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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:02,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:02,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 296 [2025-03-04 10:19:02,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:06,949 INFO L124 PetriNetUnfolderBase]: 45488/81744 cut-off events. [2025-03-04 10:19:06,949 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2025-03-04 10:19:07,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149617 conditions, 81744 events. 45488/81744 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 2112. Compared 779313 event pairs, 40506 based on Foata normal form. 0/62255 useless extension candidates. Maximal degree in co-relation 149604. Up to 67641 conditions per place. [2025-03-04 10:19:07,312 INFO L140 encePairwiseOnDemand]: 293/296 looper letters, 122 selfloop transitions, 2 changer transitions 0/201 dead transitions. [2025-03-04 10:19:07,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 201 transitions, 670 flow [2025-03-04 10:19:07,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:19:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:19:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-03-04 10:19:07,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4009009009009009 [2025-03-04 10:19:07,314 INFO L175 Difference]: Start difference. First operand has 196 places, 202 transitions, 424 flow. Second operand 3 states and 356 transitions. [2025-03-04 10:19:07,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 201 transitions, 670 flow [2025-03-04 10:19:07,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 201 transitions, 666 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:19:07,317 INFO L231 Difference]: Finished difference. Result has 195 places, 201 transitions, 422 flow [2025-03-04 10:19:07,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=195, PETRI_TRANSITIONS=201} [2025-03-04 10:19:07,318 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -6 predicate places. [2025-03-04 10:19:07,318 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 201 transitions, 422 flow [2025-03-04 10:19:07,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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:07,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:07,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:19:07,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:19:07,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-03-04 10:19:07,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:07,319 INFO L85 PathProgramCache]: Analyzing trace with hash 38055680, now seen corresponding path program 1 times [2025-03-04 10:19:07,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:07,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014242169] [2025-03-04 10:19:07,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:07,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:07,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:19:07,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:19:07,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:07,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:07,370 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:07,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:07,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014242169] [2025-03-04 10:19:07,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014242169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:07,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:07,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:19:07,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091401166] [2025-03-04 10:19:07,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:07,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:19:07,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:07,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:19:07,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:19:07,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 296 [2025-03-04 10:19:07,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 201 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:07,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:07,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 296 [2025-03-04 10:19:07,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:11,989 INFO L124 PetriNetUnfolderBase]: 45488/81743 cut-off events. [2025-03-04 10:19:11,989 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2025-03-04 10:19:12,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149615 conditions, 81743 events. 45488/81743 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 2114. Compared 779631 event pairs, 40506 based on Foata normal form. 0/62255 useless extension candidates. Maximal degree in co-relation 149602. Up to 67637 conditions per place. [2025-03-04 10:19:12,367 INFO L140 encePairwiseOnDemand]: 292/296 looper letters, 120 selfloop transitions, 3 changer transitions 0/200 dead transitions. [2025-03-04 10:19:12,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 200 transitions, 666 flow [2025-03-04 10:19:12,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:19:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:19:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2025-03-04 10:19:12,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36486486486486486 [2025-03-04 10:19:12,369 INFO L175 Difference]: Start difference. First operand has 195 places, 201 transitions, 422 flow. Second operand 4 states and 432 transitions. [2025-03-04 10:19:12,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 200 transitions, 666 flow [2025-03-04 10:19:12,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 200 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:19:12,371 INFO L231 Difference]: Finished difference. Result has 195 places, 200 transitions, 422 flow [2025-03-04 10:19:12,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=422, PETRI_PLACES=195, PETRI_TRANSITIONS=200} [2025-03-04 10:19:12,372 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -6 predicate places. [2025-03-04 10:19:12,372 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 200 transitions, 422 flow [2025-03-04 10:19:12,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:12,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:12,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:19:12,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:19:12,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-03-04 10:19:12,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash 38055681, now seen corresponding path program 1 times [2025-03-04 10:19:12,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:12,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968205200] [2025-03-04 10:19:12,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:12,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:12,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:19:12,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:19:12,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:12,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:12,623 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:12,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:12,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968205200] [2025-03-04 10:19:12,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968205200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:12,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:12,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:19:12,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425338907] [2025-03-04 10:19:12,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:12,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:19:12,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:12,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:19:12,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:19:12,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 296 [2025-03-04 10:19:12,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 200 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:12,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:12,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 296 [2025-03-04 10:19:12,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:17,224 INFO L124 PetriNetUnfolderBase]: 45488/81742 cut-off events. [2025-03-04 10:19:17,224 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2025-03-04 10:19:17,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149614 conditions, 81742 events. 45488/81742 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 2114. Compared 779503 event pairs, 40506 based on Foata normal form. 0/62255 useless extension candidates. Maximal degree in co-relation 149596. Up to 67637 conditions per place. [2025-03-04 10:19:17,615 INFO L140 encePairwiseOnDemand]: 292/296 looper letters, 119 selfloop transitions, 3 changer transitions 0/199 dead transitions. [2025-03-04 10:19:17,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 199 transitions, 664 flow [2025-03-04 10:19:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:19:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:19:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 431 transitions. [2025-03-04 10:19:17,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3640202702702703 [2025-03-04 10:19:17,617 INFO L175 Difference]: Start difference. First operand has 195 places, 200 transitions, 422 flow. Second operand 4 states and 431 transitions. [2025-03-04 10:19:17,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 199 transitions, 664 flow [2025-03-04 10:19:17,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 199 transitions, 658 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:19:17,619 INFO L231 Difference]: Finished difference. Result has 194 places, 199 transitions, 420 flow [2025-03-04 10:19:17,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=420, PETRI_PLACES=194, PETRI_TRANSITIONS=199} [2025-03-04 10:19:17,620 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -7 predicate places. [2025-03-04 10:19:17,620 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 199 transitions, 420 flow [2025-03-04 10:19:17,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:17,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:17,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:17,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:19:17,620 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2025-03-04 10:19:17,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:17,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1563246779, now seen corresponding path program 1 times [2025-03-04 10:19:17,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:17,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919497016] [2025-03-04 10:19:17,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:17,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:19:17,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:19:17,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:17,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:17,647 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:17,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919497016] [2025-03-04 10:19:17,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919497016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:17,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:17,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:19:17,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29900741] [2025-03-04 10:19:17,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:17,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:19:17,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:17,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:19:17,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:19:17,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 296 [2025-03-04 10:19:17,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 199 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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:17,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:17,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 296 [2025-03-04 10:19:17,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand