./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/hclhlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/hclhlock.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 b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:31:59,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:32:00,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:32:00,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:32:00,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:32:00,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:32:00,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:32:00,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:32:00,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:32:00,071 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:32:00,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:32:00,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:32:00,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:32:00,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:32:00,073 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:32:00,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:32:00,073 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:32:00,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:32:00,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:32:00,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:32:00,073 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:32:00,074 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:32:00,074 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:32:00,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:32:00,074 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:32:00,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:32:00,074 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:32:00,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:32:00,074 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:32:00,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:32:00,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:32:00,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:32:00,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:32:00,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:32:00,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:32:00,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:32:00,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:32:00,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:32:00,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:32:00,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:32:00,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:32:00,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:32:00,076 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 -> b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 [2025-03-09 01:32:00,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:32:00,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:32:00,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:32:00,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:32:00,338 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:32:00,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/hclhlock.i [2025-03-09 01:32:01,467 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85dae2aa9/2fe985dc3f3b49808e64e3a8103e0feb/FLAG4ccdc9a17 [2025-03-09 01:32:01,848 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:32:01,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i [2025-03-09 01:32:01,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85dae2aa9/2fe985dc3f3b49808e64e3a8103e0feb/FLAG4ccdc9a17 [2025-03-09 01:32:02,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85dae2aa9/2fe985dc3f3b49808e64e3a8103e0feb [2025-03-09 01:32:02,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:32:02,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:32:02,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:32:02,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:32:02,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:32:02,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:32:02" (1/1) ... [2025-03-09 01:32:02,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cba1191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:02, skipping insertion in model container [2025-03-09 01:32:02,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:32:02" (1/1) ... [2025-03-09 01:32:02,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:32:03,144 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-09 01:32:03,148 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-09 01:32:03,148 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-09 01:32:03,152 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-09 01:32:03,153 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-09 01:32:03,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:32:03,811 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:32:03,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-09 01:32:03,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-09 01:32:03,904 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-09 01:32:03,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-09 01:32:03,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-09 01:32:03,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-09 01:32:03,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-09 01:32:03,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-09 01:32:03,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-09 01:32:03,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-09 01:32:03,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-09 01:32:03,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-09 01:32:03,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-09 01:32:03,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-09 01:32:03,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-09 01:32:03,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-09 01:32:03,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-09 01:32:03,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-09 01:32:03,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-09 01:32:03,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-09 01:32:03,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-09 01:32:03,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-09 01:32:03,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-09 01:32:03,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-09 01:32:03,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-09 01:32:03,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-09 01:32:03,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-09 01:32:03,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-09 01:32:03,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-09 01:32:03,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-09 01:32:03,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-09 01:32:03,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-09 01:32:03,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-09 01:32:03,915 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-09 01:32:03,915 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-09 01:32:03,915 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-09 01:32:03,916 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-09 01:32:03,916 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-09 01:32:03,916 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-09 01:32:03,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-09 01:32:03,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-09 01:32:03,918 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-09 01:32:03,918 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-09 01:32:03,918 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-09 01:32:03,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-09 01:32:03,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-09 01:32:03,920 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-09 01:32:03,920 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-09 01:32:03,921 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-09 01:32:03,921 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-09 01:32:03,922 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-09 01:32:03,923 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-09 01:32:03,923 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-09 01:32:03,923 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-09 01:32:03,924 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-09 01:32:03,924 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-09 01:32:03,925 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-09 01:32:03,925 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-09 01:32:03,926 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-09 01:32:03,926 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-09 01:32:03,927 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-09 01:32:03,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-09 01:32:03,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-09 01:32:03,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-09 01:32:03,928 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-09 01:32:03,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-09 01:32:03,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-09 01:32:03,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-09 01:32:03,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-09 01:32:03,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-09 01:32:03,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-09 01:32:03,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-09 01:32:03,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-09 01:32:03,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-09 01:32:03,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-09 01:32:03,931 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-09 01:32:03,931 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-09 01:32:03,931 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-09 01:32:03,931 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-09 01:32:03,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-09 01:32:03,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-09 01:32:03,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-09 01:32:03,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-09 01:32:03,935 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-09 01:32:03,935 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-09 01:32:03,936 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-09 01:32:03,936 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-09 01:32:03,936 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-09 01:32:03,936 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-09 01:32:03,937 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-09 01:32:03,937 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-09 01:32:03,937 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-09 01:32:03,938 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-09 01:32:03,938 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-09 01:32:03,938 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-09 01:32:03,938 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-09 01:32:03,938 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-09 01:32:03,939 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-09 01:32:03,940 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-09 01:32:03,940 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-09 01:32:04,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:32:04,205 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:32:04,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04 WrapperNode [2025-03-09 01:32:04,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:32:04,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:32:04,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:32:04,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:32:04,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (1/1) ... [2025-03-09 01:32:04,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (1/1) ... [2025-03-09 01:32:04,318 INFO L138 Inliner]: procedures = 921, calls = 972, calls flagged for inlining = 848, calls inlined = 84, statements flattened = 850 [2025-03-09 01:32:04,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:32:04,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:32:04,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:32:04,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:32:04,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (1/1) ... [2025-03-09 01:32:04,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (1/1) ... [2025-03-09 01:32:04,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (1/1) ... [2025-03-09 01:32:04,354 INFO L175 MemorySlicer]: Split 50 memory accesses to 4 slices as follows [2, 28, 18, 2]. 56 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 7, 6, 0]. The 15 writes are split as follows [0, 9, 5, 1]. [2025-03-09 01:32:04,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (1/1) ... [2025-03-09 01:32:04,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (1/1) ... [2025-03-09 01:32:04,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (1/1) ... [2025-03-09 01:32:04,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (1/1) ... [2025-03-09 01:32:04,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (1/1) ... [2025-03-09 01:32:04,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (1/1) ... [2025-03-09 01:32:04,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:32:04,384 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:32:04,384 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:32:04,384 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:32:04,385 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (1/1) ... [2025-03-09 01:32:04,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:32:04,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:04,409 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-09 01:32:04,412 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-09 01:32:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:32:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:32:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:32:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 01:32:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:32:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:32:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:32:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 01:32:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 01:32:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:32:04,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:32:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-09 01:32:04,434 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-09 01:32:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:32:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:32:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:32:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 01:32:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 01:32:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:32:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:32:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:32:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 01:32:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:32:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:32:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:32:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 01:32:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-09 01:32:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:32:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:32:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:32:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 01:32:04,437 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:32:04,601 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:32:04,602 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:32:05,354 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-09 01:32:05,354 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-9: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-09 01:32:05,354 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-18: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-09 01:32:05,354 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-27: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-09 01:32:05,354 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-09 01:32:05,354 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-9: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-09 01:32:05,354 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-09 01:32:05,354 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290-9: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-09 01:32:05,355 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-03-09 01:32:05,355 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-03-09 01:32:05,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-09 01:32:05,560 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-09 01:32:05,563 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:32:05,563 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:32:05,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:32:05,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:32:05,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:32:05 BoogieIcfgContainer [2025-03-09 01:32:05,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:32:05,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:32:05,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:32:05,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:32:05,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:32:02" (1/3) ... [2025-03-09 01:32:05,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb1d7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:32:05, skipping insertion in model container [2025-03-09 01:32:05,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:32:04" (2/3) ... [2025-03-09 01:32:05,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb1d7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:32:05, skipping insertion in model container [2025-03-09 01:32:05,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:32:05" (3/3) ... [2025-03-09 01:32:05,957 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-03-09 01:32:05,969 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:32:05,971 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 338 locations, 1 initial locations, 42 loop locations, and 88 error locations. [2025-03-09 01:32:05,971 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:32:06,126 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 01:32:06,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 341 places, 495 transitions, 997 flow [2025-03-09 01:32:06,295 INFO L124 PetriNetUnfolderBase]: 170/537 cut-off events. [2025-03-09 01:32:06,296 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:32:06,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 537 events. 170/537 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2036 event pairs, 0 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 402. Up to 8 conditions per place. [2025-03-09 01:32:06,307 INFO L82 GeneralOperation]: Start removeDead. Operand has 341 places, 495 transitions, 997 flow [2025-03-09 01:32:06,316 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 341 places, 495 transitions, 997 flow [2025-03-09 01:32:06,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:32:06,334 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;@56ccff25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:32:06,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 154 error locations. [2025-03-09 01:32:06,339 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:32:06,339 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-09 01:32:06,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:06,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:06,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:32:06,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:06,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash 81510, now seen corresponding path program 1 times [2025-03-09 01:32:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:06,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305075555] [2025-03-09 01:32:06,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:06,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:06,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:32:06,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:32:06,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:06,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:06,645 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-09 01:32:06,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:06,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305075555] [2025-03-09 01:32:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305075555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:06,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:32:06,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088651472] [2025-03-09 01:32:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:06,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:06,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:06,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:06,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:06,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 495 transitions, 997 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-09 01:32:06,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:06,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:06,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:07,504 INFO L124 PetriNetUnfolderBase]: 1543/4159 cut-off events. [2025-03-09 01:32:07,504 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:32:07,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7068 conditions, 4159 events. 1543/4159 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31384 event pairs, 1240 based on Foata normal form. 1590/4957 useless extension candidates. Maximal degree in co-relation 6922. Up to 2900 conditions per place. [2025-03-09 01:32:07,530 INFO L140 encePairwiseOnDemand]: 360/495 looper letters, 190 selfloop transitions, 4 changer transitions 0/347 dead transitions. [2025-03-09 01:32:07,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 347 transitions, 1089 flow [2025-03-09 01:32:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-03-09 01:32:07,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5279461279461279 [2025-03-09 01:32:07,548 INFO L175 Difference]: Start difference. First operand has 341 places, 495 transitions, 997 flow. Second operand 3 states and 784 transitions. [2025-03-09 01:32:07,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 347 transitions, 1089 flow [2025-03-09 01:32:07,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 347 transitions, 1089 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:32:07,575 INFO L231 Difference]: Finished difference. Result has 319 places, 347 transitions, 709 flow [2025-03-09 01:32:07,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=709, PETRI_PLACES=319, PETRI_TRANSITIONS=347} [2025-03-09 01:32:07,582 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -22 predicate places. [2025-03-09 01:32:07,583 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 347 transitions, 709 flow [2025-03-09 01:32:07,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-09 01:32:07,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:07,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:32:07,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:32:07,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:07,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:07,585 INFO L85 PathProgramCache]: Analyzing trace with hash 81511, now seen corresponding path program 1 times [2025-03-09 01:32:07,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:07,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241468277] [2025-03-09 01:32:07,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:07,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:07,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:32:07,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:32:07,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:07,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:07,776 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-09 01:32:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241468277] [2025-03-09 01:32:07,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241468277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:07,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:07,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:32:07,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645467186] [2025-03-09 01:32:07,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:07,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:07,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:07,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:07,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:07,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:07,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 347 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-09 01:32:07,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:07,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:07,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:08,485 INFO L124 PetriNetUnfolderBase]: 1543/4158 cut-off events. [2025-03-09 01:32:08,485 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:32:08,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7071 conditions, 4158 events. 1543/4158 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31345 event pairs, 1240 based on Foata normal form. 0/3368 useless extension candidates. Maximal degree in co-relation 7046. Up to 2901 conditions per place. [2025-03-09 01:32:08,508 INFO L140 encePairwiseOnDemand]: 492/495 looper letters, 191 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2025-03-09 01:32:08,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 346 transitions, 1093 flow [2025-03-09 01:32:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 653 transitions. [2025-03-09 01:32:08,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43973063973063975 [2025-03-09 01:32:08,512 INFO L175 Difference]: Start difference. First operand has 319 places, 347 transitions, 709 flow. Second operand 3 states and 653 transitions. [2025-03-09 01:32:08,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 346 transitions, 1093 flow [2025-03-09 01:32:08,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 346 transitions, 1085 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:32:08,520 INFO L231 Difference]: Finished difference. Result has 318 places, 346 transitions, 703 flow [2025-03-09 01:32:08,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=318, PETRI_TRANSITIONS=346} [2025-03-09 01:32:08,521 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -23 predicate places. [2025-03-09 01:32:08,523 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 346 transitions, 703 flow [2025-03-09 01:32:08,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-09 01:32:08,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:08,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:32:08,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:32:08,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:08,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:08,526 INFO L85 PathProgramCache]: Analyzing trace with hash 78400219, now seen corresponding path program 1 times [2025-03-09 01:32:08,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:08,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86216289] [2025-03-09 01:32:08,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:08,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:08,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:32:08,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:32:08,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:08,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:08,633 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-09 01:32:08,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:08,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86216289] [2025-03-09 01:32:08,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86216289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:08,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:08,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:08,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907067438] [2025-03-09 01:32:08,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:08,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:32:08,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:08,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:32:08,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:32:08,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:08,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 346 transitions, 703 flow. Second operand has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 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-09 01:32:08,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:08,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:08,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:09,404 INFO L124 PetriNetUnfolderBase]: 1543/4156 cut-off events. [2025-03-09 01:32:09,404 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:32:09,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7065 conditions, 4156 events. 1543/4156 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31420 event pairs, 1240 based on Foata normal form. 0/3366 useless extension candidates. Maximal degree in co-relation 7053. Up to 2891 conditions per place. [2025-03-09 01:32:09,421 INFO L140 encePairwiseOnDemand]: 487/495 looper letters, 185 selfloop transitions, 6 changer transitions 0/344 dead transitions. [2025-03-09 01:32:09,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 344 transitions, 1081 flow [2025-03-09 01:32:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:32:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:32:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 958 transitions. [2025-03-09 01:32:09,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38707070707070707 [2025-03-09 01:32:09,424 INFO L175 Difference]: Start difference. First operand has 318 places, 346 transitions, 703 flow. Second operand 5 states and 958 transitions. [2025-03-09 01:32:09,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 344 transitions, 1081 flow [2025-03-09 01:32:09,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 344 transitions, 1077 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:32:09,432 INFO L231 Difference]: Finished difference. Result has 318 places, 344 transitions, 707 flow [2025-03-09 01:32:09,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=707, PETRI_PLACES=318, PETRI_TRANSITIONS=344} [2025-03-09 01:32:09,433 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -23 predicate places. [2025-03-09 01:32:09,433 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 344 transitions, 707 flow [2025-03-09 01:32:09,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 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-09 01:32:09,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:09,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:32:09,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:32:09,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:09,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash 78400220, now seen corresponding path program 1 times [2025-03-09 01:32:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:09,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071668450] [2025-03-09 01:32:09,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:09,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:32:09,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:32:09,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:09,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:09,599 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-09 01:32:09,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:09,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071668450] [2025-03-09 01:32:09,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071668450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:09,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:09,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:09,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417147367] [2025-03-09 01:32:09,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:09,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:32:09,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:09,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:32:09,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:32:09,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:09,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 344 transitions, 707 flow. Second operand has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 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-09 01:32:09,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:09,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:09,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:10,360 INFO L124 PetriNetUnfolderBase]: 1543/4155 cut-off events. [2025-03-09 01:32:10,361 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:32:10,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 4155 events. 1543/4155 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31333 event pairs, 1240 based on Foata normal form. 0/3366 useless extension candidates. Maximal degree in co-relation 7037. Up to 2891 conditions per place. [2025-03-09 01:32:10,378 INFO L140 encePairwiseOnDemand]: 490/495 looper letters, 186 selfloop transitions, 4 changer transitions 0/343 dead transitions. [2025-03-09 01:32:10,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 343 transitions, 1085 flow [2025-03-09 01:32:10,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:32:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:32:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 956 transitions. [2025-03-09 01:32:10,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38626262626262625 [2025-03-09 01:32:10,383 INFO L175 Difference]: Start difference. First operand has 318 places, 344 transitions, 707 flow. Second operand 5 states and 956 transitions. [2025-03-09 01:32:10,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 343 transitions, 1085 flow [2025-03-09 01:32:10,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 343 transitions, 1073 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:32:10,387 INFO L231 Difference]: Finished difference. Result has 317 places, 343 transitions, 701 flow [2025-03-09 01:32:10,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=701, PETRI_PLACES=317, PETRI_TRANSITIONS=343} [2025-03-09 01:32:10,389 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -24 predicate places. [2025-03-09 01:32:10,389 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 343 transitions, 701 flow [2025-03-09 01:32:10,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 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-09 01:32:10,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:10,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:10,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:32:10,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:10,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash -839150058, now seen corresponding path program 1 times [2025-03-09 01:32:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400601665] [2025-03-09 01:32:10,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:10,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:32:10,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:32:10,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:10,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:10,599 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-09 01:32:10,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:10,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400601665] [2025-03-09 01:32:10,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400601665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:10,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:10,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:32:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894919845] [2025-03-09 01:32:10,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:10,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:32:10,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:10,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:32:10,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:32:10,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:10,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 343 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 154.16666666666666) internal successors, (925), 6 states have internal predecessors, (925), 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-09 01:32:10,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:10,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:10,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:11,608 INFO L124 PetriNetUnfolderBase]: 1543/4154 cut-off events. [2025-03-09 01:32:11,608 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:32:11,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7063 conditions, 4154 events. 1543/4154 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31388 event pairs, 1240 based on Foata normal form. 0/3367 useless extension candidates. Maximal degree in co-relation 7037. Up to 2891 conditions per place. [2025-03-09 01:32:11,626 INFO L140 encePairwiseOnDemand]: 488/495 looper letters, 183 selfloop transitions, 6 changer transitions 0/342 dead transitions. [2025-03-09 01:32:11,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 342 transitions, 1077 flow [2025-03-09 01:32:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:32:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:32:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1108 transitions. [2025-03-09 01:32:11,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37306397306397304 [2025-03-09 01:32:11,629 INFO L175 Difference]: Start difference. First operand has 317 places, 343 transitions, 701 flow. Second operand 6 states and 1108 transitions. [2025-03-09 01:32:11,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 342 transitions, 1077 flow [2025-03-09 01:32:11,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 342 transitions, 1069 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:32:11,633 INFO L231 Difference]: Finished difference. Result has 317 places, 342 transitions, 703 flow [2025-03-09 01:32:11,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=317, PETRI_TRANSITIONS=342} [2025-03-09 01:32:11,635 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -24 predicate places. [2025-03-09 01:32:11,635 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 342 transitions, 703 flow [2025-03-09 01:32:11,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.16666666666666) internal successors, (925), 6 states have internal predecessors, (925), 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-09 01:32:11,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:11,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:11,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:32:11,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:11,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1891063053, now seen corresponding path program 1 times [2025-03-09 01:32:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:11,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715102418] [2025-03-09 01:32:11,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:11,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:32:11,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:32:11,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:11,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:11,680 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-09 01:32:11,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:11,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715102418] [2025-03-09 01:32:11,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715102418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:11,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:11,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:11,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481909622] [2025-03-09 01:32:11,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:11,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:11,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:11,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:11,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:11,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:11,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 342 transitions, 703 flow. Second operand has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 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-09 01:32:11,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:11,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:11,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:12,149 INFO L124 PetriNetUnfolderBase]: 1543/4151 cut-off events. [2025-03-09 01:32:12,150 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:32:12,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7061 conditions, 4151 events. 1543/4151 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31407 event pairs, 1240 based on Foata normal form. 1/3364 useless extension candidates. Maximal degree in co-relation 7033. Up to 2881 conditions per place. [2025-03-09 01:32:12,162 INFO L140 encePairwiseOnDemand]: 491/495 looper letters, 185 selfloop transitions, 3 changer transitions 0/339 dead transitions. [2025-03-09 01:32:12,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 339 transitions, 1073 flow [2025-03-09 01:32:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 801 transitions. [2025-03-09 01:32:12,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40454545454545454 [2025-03-09 01:32:12,165 INFO L175 Difference]: Start difference. First operand has 317 places, 342 transitions, 703 flow. Second operand 4 states and 801 transitions. [2025-03-09 01:32:12,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 339 transitions, 1073 flow [2025-03-09 01:32:12,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 339 transitions, 1061 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:32:12,170 INFO L231 Difference]: Finished difference. Result has 312 places, 339 transitions, 691 flow [2025-03-09 01:32:12,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=691, PETRI_PLACES=312, PETRI_TRANSITIONS=339} [2025-03-09 01:32:12,172 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -29 predicate places. [2025-03-09 01:32:12,172 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 339 transitions, 691 flow [2025-03-09 01:32:12,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 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-09 01:32:12,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:12,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:12,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:32:12,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:12,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:12,174 INFO L85 PathProgramCache]: Analyzing trace with hash 529250382, now seen corresponding path program 1 times [2025-03-09 01:32:12,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:12,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17079941] [2025-03-09 01:32:12,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:12,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:32:12,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:32:12,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:12,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:12,236 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-09 01:32:12,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:12,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17079941] [2025-03-09 01:32:12,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17079941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:12,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:12,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:12,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256489728] [2025-03-09 01:32:12,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:12,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:12,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:12,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:12,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:12,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:12,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 339 transitions, 691 flow. Second operand has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 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-09 01:32:12,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:12,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:12,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:12,774 INFO L124 PetriNetUnfolderBase]: 1543/4148 cut-off events. [2025-03-09 01:32:12,774 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:32:12,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7054 conditions, 4148 events. 1543/4148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31312 event pairs, 1240 based on Foata normal form. 1/3362 useless extension candidates. Maximal degree in co-relation 6992. Up to 2881 conditions per place. [2025-03-09 01:32:12,787 INFO L140 encePairwiseOnDemand]: 491/495 looper letters, 184 selfloop transitions, 3 changer transitions 0/336 dead transitions. [2025-03-09 01:32:12,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 336 transitions, 1059 flow [2025-03-09 01:32:12,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 800 transitions. [2025-03-09 01:32:12,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2025-03-09 01:32:12,790 INFO L175 Difference]: Start difference. First operand has 312 places, 339 transitions, 691 flow. Second operand 4 states and 800 transitions. [2025-03-09 01:32:12,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 336 transitions, 1059 flow [2025-03-09 01:32:12,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 336 transitions, 1053 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:32:12,796 INFO L231 Difference]: Finished difference. Result has 309 places, 336 transitions, 685 flow [2025-03-09 01:32:12,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=685, PETRI_PLACES=309, PETRI_TRANSITIONS=336} [2025-03-09 01:32:12,799 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -32 predicate places. [2025-03-09 01:32:12,799 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 336 transitions, 685 flow [2025-03-09 01:32:12,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 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-09 01:32:12,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:12,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:12,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:32:12,799 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:12,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash 882618696, now seen corresponding path program 1 times [2025-03-09 01:32:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:12,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328374664] [2025-03-09 01:32:12,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:12,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:32:12,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:32:12,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:12,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:12,870 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-09 01:32:12,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:12,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328374664] [2025-03-09 01:32:12,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328374664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:12,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:12,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:32:12,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181231554] [2025-03-09 01:32:12,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:12,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:12,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:12,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:12,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:12,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 495 [2025-03-09 01:32:12,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 336 transitions, 685 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-09 01:32:12,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:12,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 495 [2025-03-09 01:32:12,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:13,473 INFO L124 PetriNetUnfolderBase]: 1835/4811 cut-off events. [2025-03-09 01:32:13,473 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:32:13,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8261 conditions, 4811 events. 1835/4811 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 37218 event pairs, 1240 based on Foata normal form. 0/3954 useless extension candidates. Maximal degree in co-relation 8199. Up to 2896 conditions per place. [2025-03-09 01:32:13,485 INFO L140 encePairwiseOnDemand]: 491/495 looper letters, 333 selfloop transitions, 2 changer transitions 0/480 dead transitions. [2025-03-09 01:32:13,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 480 transitions, 1643 flow [2025-03-09 01:32:13,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-03-09 01:32:13,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5279461279461279 [2025-03-09 01:32:13,488 INFO L175 Difference]: Start difference. First operand has 309 places, 336 transitions, 685 flow. Second operand 3 states and 784 transitions. [2025-03-09 01:32:13,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 480 transitions, 1643 flow [2025-03-09 01:32:13,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 480 transitions, 1637 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:32:13,493 INFO L231 Difference]: Finished difference. Result has 306 places, 334 transitions, 679 flow [2025-03-09 01:32:13,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=306, PETRI_TRANSITIONS=334} [2025-03-09 01:32:13,495 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -35 predicate places. [2025-03-09 01:32:13,495 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 334 transitions, 679 flow [2025-03-09 01:32:13,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-09 01:32:13,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:13,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:13,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:32:13,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:13,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash 882618697, now seen corresponding path program 1 times [2025-03-09 01:32:13,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:13,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15555523] [2025-03-09 01:32:13,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:13,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:13,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:32:13,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:32:13,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:13,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:13,545 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-09 01:32:13,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:13,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15555523] [2025-03-09 01:32:13,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15555523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:13,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:13,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:13,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871936465] [2025-03-09 01:32:13,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:13,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:13,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:13,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:13,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:13,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:13,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 334 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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-09 01:32:13,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:13,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:13,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:13,963 INFO L124 PetriNetUnfolderBase]: 1543/4147 cut-off events. [2025-03-09 01:32:13,963 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-03-09 01:32:13,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7180 conditions, 4147 events. 1543/4147 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31234 event pairs, 1240 based on Foata normal form. 0/3363 useless extension candidates. Maximal degree in co-relation 7045. Up to 2893 conditions per place. [2025-03-09 01:32:13,976 INFO L140 encePairwiseOnDemand]: 492/495 looper letters, 188 selfloop transitions, 2 changer transitions 0/337 dead transitions. [2025-03-09 01:32:13,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 337 transitions, 1065 flow [2025-03-09 01:32:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2025-03-09 01:32:13,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4377104377104377 [2025-03-09 01:32:13,979 INFO L175 Difference]: Start difference. First operand has 306 places, 334 transitions, 679 flow. Second operand 3 states and 650 transitions. [2025-03-09 01:32:13,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 337 transitions, 1065 flow [2025-03-09 01:32:13,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 337 transitions, 1061 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:32:13,986 INFO L231 Difference]: Finished difference. Result has 307 places, 335 transitions, 687 flow [2025-03-09 01:32:13,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=687, PETRI_PLACES=307, PETRI_TRANSITIONS=335} [2025-03-09 01:32:13,987 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -34 predicate places. [2025-03-09 01:32:13,987 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 335 transitions, 687 flow [2025-03-09 01:32:13,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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-09 01:32:13,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:13,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:13,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:32:13,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:13,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash 626451204, now seen corresponding path program 1 times [2025-03-09 01:32:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:13,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141032016] [2025-03-09 01:32:13,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:13,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:13,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:32:14,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:32:14,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:14,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141032016] [2025-03-09 01:32:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141032016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:32:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309763518] [2025-03-09 01:32:14,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:14,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:14,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:14,076 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-09 01:32:14,078 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-09 01:32:14,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:32:14,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:32:14,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:14,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:14,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:32:14,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:32:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:32:14,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:32:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:32:14,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309763518] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:32:14,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:32:14,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-03-09 01:32:14,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257482790] [2025-03-09 01:32:14,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:14,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:14,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:14,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:14,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:32:14,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:14,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 335 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-09 01:32:14,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:14,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:14,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:14,765 INFO L124 PetriNetUnfolderBase]: 1543/4148 cut-off events. [2025-03-09 01:32:14,765 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:32:14,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7061 conditions, 4148 events. 1543/4148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31051 event pairs, 1240 based on Foata normal form. 0/3365 useless extension candidates. Maximal degree in co-relation 7037. Up to 2884 conditions per place. [2025-03-09 01:32:14,779 INFO L140 encePairwiseOnDemand]: 491/495 looper letters, 186 selfloop transitions, 3 changer transitions 0/336 dead transitions. [2025-03-09 01:32:14,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 336 transitions, 1067 flow [2025-03-09 01:32:14,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2025-03-09 01:32:14,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-09 01:32:14,781 INFO L175 Difference]: Start difference. First operand has 307 places, 335 transitions, 687 flow. Second operand 3 states and 648 transitions. [2025-03-09 01:32:14,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 336 transitions, 1067 flow [2025-03-09 01:32:14,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 336 transitions, 1065 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:32:14,785 INFO L231 Difference]: Finished difference. Result has 310 places, 336 transitions, 703 flow [2025-03-09 01:32:14,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=310, PETRI_TRANSITIONS=336} [2025-03-09 01:32:14,786 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -31 predicate places. [2025-03-09 01:32:14,786 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 336 transitions, 703 flow [2025-03-09 01:32:14,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-09 01:32:14,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:14,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:14,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:32:14,987 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,SelfDestructingSolverStorable9 [2025-03-09 01:32:14,988 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:14,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:14,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1850220400, now seen corresponding path program 1 times [2025-03-09 01:32:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:14,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516864157] [2025-03-09 01:32:14,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:14,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:14,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:32:15,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:32:15,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:15,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:15,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:15,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516864157] [2025-03-09 01:32:15,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516864157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:32:15,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77696836] [2025-03-09 01:32:15,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:15,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:15,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:15,082 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:32:15,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:32:15,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:32:15,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:32:15,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:15,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:15,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:32:15,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:32:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:15,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:32:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:15,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77696836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:32:15,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:32:15,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 01:32:15,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031828065] [2025-03-09 01:32:15,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:32:15,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:32:15,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:15,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:32:15,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:32:15,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:15,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 336 transitions, 703 flow. Second operand has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 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-09 01:32:15,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:15,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:15,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:16,002 INFO L124 PetriNetUnfolderBase]: 1543/4151 cut-off events. [2025-03-09 01:32:16,003 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:32:16,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7076 conditions, 4151 events. 1543/4151 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31091 event pairs, 1240 based on Foata normal form. 1/3370 useless extension candidates. Maximal degree in co-relation 7033. Up to 2892 conditions per place. [2025-03-09 01:32:16,014 INFO L140 encePairwiseOnDemand]: 491/495 looper letters, 189 selfloop transitions, 5 changer transitions 0/341 dead transitions. [2025-03-09 01:32:16,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 341 transitions, 1103 flow [2025-03-09 01:32:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:32:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:32:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 959 transitions. [2025-03-09 01:32:16,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38747474747474747 [2025-03-09 01:32:16,017 INFO L175 Difference]: Start difference. First operand has 310 places, 336 transitions, 703 flow. Second operand 5 states and 959 transitions. [2025-03-09 01:32:16,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 341 transitions, 1103 flow [2025-03-09 01:32:16,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 341 transitions, 1097 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:32:16,021 INFO L231 Difference]: Finished difference. Result has 314 places, 338 transitions, 723 flow [2025-03-09 01:32:16,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=723, PETRI_PLACES=314, PETRI_TRANSITIONS=338} [2025-03-09 01:32:16,022 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -27 predicate places. [2025-03-09 01:32:16,022 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 338 transitions, 723 flow [2025-03-09 01:32:16,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 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-09 01:32:16,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:16,022 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:16,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:32:16,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 01:32:16,223 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:16,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1774042315, now seen corresponding path program 2 times [2025-03-09 01:32:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:16,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935860221] [2025-03-09 01:32:16,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:32:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:16,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:32:16,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 20 statements. [2025-03-09 01:32:16,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:32:16,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:32:16,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:16,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935860221] [2025-03-09 01:32:16,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935860221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:16,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:16,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:16,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134198839] [2025-03-09 01:32:16,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:16,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:16,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:16,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:16,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:16,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:16,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 338 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-09 01:32:16,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:16,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:16,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:16,695 INFO L124 PetriNetUnfolderBase]: 1543/4148 cut-off events. [2025-03-09 01:32:16,695 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-09 01:32:16,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7081 conditions, 4148 events. 1543/4148 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31090 event pairs, 1240 based on Foata normal form. 1/3366 useless extension candidates. Maximal degree in co-relation 7032. Up to 2888 conditions per place. [2025-03-09 01:32:16,703 INFO L140 encePairwiseOnDemand]: 492/495 looper letters, 187 selfloop transitions, 3 changer transitions 0/335 dead transitions. [2025-03-09 01:32:16,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 335 transitions, 1097 flow [2025-03-09 01:32:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-03-09 01:32:16,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.435016835016835 [2025-03-09 01:32:16,706 INFO L175 Difference]: Start difference. First operand has 314 places, 338 transitions, 723 flow. Second operand 3 states and 646 transitions. [2025-03-09 01:32:16,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 335 transitions, 1097 flow [2025-03-09 01:32:16,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 335 transitions, 1091 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-09 01:32:16,710 INFO L231 Difference]: Finished difference. Result has 312 places, 335 transitions, 717 flow [2025-03-09 01:32:16,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=717, PETRI_PLACES=312, PETRI_TRANSITIONS=335} [2025-03-09 01:32:16,711 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -29 predicate places. [2025-03-09 01:32:16,711 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 335 transitions, 717 flow [2025-03-09 01:32:16,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-09 01:32:16,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:16,712 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:16,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:32:16,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:16,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:16,712 INFO L85 PathProgramCache]: Analyzing trace with hash 835633865, now seen corresponding path program 1 times [2025-03-09 01:32:16,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:16,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009781171] [2025-03-09 01:32:16,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:16,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:16,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:32:16,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:32:16,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:16,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:32:16,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:16,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009781171] [2025-03-09 01:32:16,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009781171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:16,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:16,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:32:16,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970158355] [2025-03-09 01:32:16,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:16,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:16,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:16,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:16,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:16,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:16,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 335 transitions, 717 flow. Second operand has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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-09 01:32:16,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:16,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:16,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:17,402 INFO L124 PetriNetUnfolderBase]: 1543/4145 cut-off events. [2025-03-09 01:32:17,403 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-09 01:32:17,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7078 conditions, 4145 events. 1543/4145 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31052 event pairs, 1240 based on Foata normal form. 1/3364 useless extension candidates. Maximal degree in co-relation 7031. Up to 2888 conditions per place. [2025-03-09 01:32:17,415 INFO L140 encePairwiseOnDemand]: 490/495 looper letters, 184 selfloop transitions, 5 changer transitions 0/332 dead transitions. [2025-03-09 01:32:17,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 332 transitions, 1089 flow [2025-03-09 01:32:17,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 798 transitions. [2025-03-09 01:32:17,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2025-03-09 01:32:17,417 INFO L175 Difference]: Start difference. First operand has 312 places, 335 transitions, 717 flow. Second operand 4 states and 798 transitions. [2025-03-09 01:32:17,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 332 transitions, 1089 flow [2025-03-09 01:32:17,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 332 transitions, 1083 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:32:17,423 INFO L231 Difference]: Finished difference. Result has 310 places, 332 transitions, 715 flow [2025-03-09 01:32:17,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=715, PETRI_PLACES=310, PETRI_TRANSITIONS=332} [2025-03-09 01:32:17,425 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -31 predicate places. [2025-03-09 01:32:17,425 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 332 transitions, 715 flow [2025-03-09 01:32:17,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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-09 01:32:17,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:17,426 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:17,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:32:17,426 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:17,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1432161315, now seen corresponding path program 1 times [2025-03-09 01:32:17,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:17,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459969588] [2025-03-09 01:32:17,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:17,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:17,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:32:17,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:32:17,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:17,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:32:17,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459969588] [2025-03-09 01:32:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459969588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:32:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276882881] [2025-03-09 01:32:17,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:17,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:17,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:17,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:32:17,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:32:17,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:32:18,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:32:18,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:18,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:18,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-09 01:32:18,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:32:18,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:32:18,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:32:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:32:18,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:32:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:32:18,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276882881] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:32:18,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:32:18,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 15 [2025-03-09 01:32:18,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77506579] [2025-03-09 01:32:18,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:18,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:32:18,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:18,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:32:18,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:32:18,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:18,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 332 transitions, 715 flow. Second operand has 7 states, 7 states have (on average 155.42857142857142) internal successors, (1088), 7 states have internal predecessors, (1088), 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-09 01:32:18,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:18,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:18,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:19,413 INFO L124 PetriNetUnfolderBase]: 1546/4174 cut-off events. [2025-03-09 01:32:19,413 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-09 01:32:19,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7125 conditions, 4174 events. 1546/4174 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31213 event pairs, 1240 based on Foata normal form. 0/3388 useless extension candidates. Maximal degree in co-relation 7078. Up to 2885 conditions per place. [2025-03-09 01:32:19,429 INFO L140 encePairwiseOnDemand]: 487/495 looper letters, 193 selfloop transitions, 8 changer transitions 0/344 dead transitions. [2025-03-09 01:32:19,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 344 transitions, 1149 flow [2025-03-09 01:32:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:32:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:32:19,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1423 transitions. [2025-03-09 01:32:19,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35934343434343435 [2025-03-09 01:32:19,433 INFO L175 Difference]: Start difference. First operand has 310 places, 332 transitions, 715 flow. Second operand 8 states and 1423 transitions. [2025-03-09 01:32:19,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 344 transitions, 1149 flow [2025-03-09 01:32:19,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 344 transitions, 1133 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:32:19,437 INFO L231 Difference]: Finished difference. Result has 317 places, 336 transitions, 748 flow [2025-03-09 01:32:19,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=748, PETRI_PLACES=317, PETRI_TRANSITIONS=336} [2025-03-09 01:32:19,438 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -24 predicate places. [2025-03-09 01:32:19,438 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 336 transitions, 748 flow [2025-03-09 01:32:19,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.42857142857142) internal successors, (1088), 7 states have internal predecessors, (1088), 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-09 01:32:19,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:19,439 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:19,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:32:19,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:19,643 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:19,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1432161314, now seen corresponding path program 1 times [2025-03-09 01:32:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:19,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042700222] [2025-03-09 01:32:19,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:19,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:32:19,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:32:19,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:19,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:32:19,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:19,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042700222] [2025-03-09 01:32:19,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042700222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:19,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:19,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210465868] [2025-03-09 01:32:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:19,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:32:19,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:19,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:32:19,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:32:19,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:19,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 336 transitions, 748 flow. Second operand has 5 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 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-09 01:32:19,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:19,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:19,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:20,595 INFO L124 PetriNetUnfolderBase]: 1536/4085 cut-off events. [2025-03-09 01:32:20,595 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-09 01:32:20,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7045 conditions, 4085 events. 1536/4085 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 30344 event pairs, 992 based on Foata normal form. 2/3342 useless extension candidates. Maximal degree in co-relation 6993. Up to 2342 conditions per place. [2025-03-09 01:32:20,606 INFO L140 encePairwiseOnDemand]: 487/495 looper letters, 327 selfloop transitions, 11 changer transitions 0/481 dead transitions. [2025-03-09 01:32:20,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 481 transitions, 1714 flow [2025-03-09 01:32:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:32:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:32:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1249 transitions. [2025-03-09 01:32:20,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42053872053872055 [2025-03-09 01:32:20,609 INFO L175 Difference]: Start difference. First operand has 317 places, 336 transitions, 748 flow. Second operand 6 states and 1249 transitions. [2025-03-09 01:32:20,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 481 transitions, 1714 flow [2025-03-09 01:32:20,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 481 transitions, 1711 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:32:20,614 INFO L231 Difference]: Finished difference. Result has 319 places, 335 transitions, 765 flow [2025-03-09 01:32:20,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=765, PETRI_PLACES=319, PETRI_TRANSITIONS=335} [2025-03-09 01:32:20,615 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -22 predicate places. [2025-03-09 01:32:20,615 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 335 transitions, 765 flow [2025-03-09 01:32:20,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 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-09 01:32:20,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:20,616 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:20,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:32:20,616 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:20,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1917570305, now seen corresponding path program 1 times [2025-03-09 01:32:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:20,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478420508] [2025-03-09 01:32:20,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:20,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:20,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:32:20,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:32:20,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:20,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:32:20,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:20,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478420508] [2025-03-09 01:32:20,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478420508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:20,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:20,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546674698] [2025-03-09 01:32:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:20,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:20,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:20,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:20,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 495 [2025-03-09 01:32:20,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 335 transitions, 765 flow. Second operand has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 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-09 01:32:20,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:20,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 495 [2025-03-09 01:32:20,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:21,339 INFO L124 PetriNetUnfolderBase]: 1536/4081 cut-off events. [2025-03-09 01:32:21,339 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-03-09 01:32:21,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 4081 events. 1536/4081 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 30282 event pairs, 992 based on Foata normal form. 2/3346 useless extension candidates. Maximal degree in co-relation 7125. Up to 2344 conditions per place. [2025-03-09 01:32:21,348 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 333 selfloop transitions, 6 changer transitions 0/479 dead transitions. [2025-03-09 01:32:21,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 479 transitions, 1731 flow [2025-03-09 01:32:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 933 transitions. [2025-03-09 01:32:21,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4712121212121212 [2025-03-09 01:32:21,350 INFO L175 Difference]: Start difference. First operand has 319 places, 335 transitions, 765 flow. Second operand 4 states and 933 transitions. [2025-03-09 01:32:21,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 479 transitions, 1731 flow [2025-03-09 01:32:21,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 479 transitions, 1709 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:32:21,355 INFO L231 Difference]: Finished difference. Result has 315 places, 333 transitions, 751 flow [2025-03-09 01:32:21,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=751, PETRI_PLACES=315, PETRI_TRANSITIONS=333} [2025-03-09 01:32:21,356 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -26 predicate places. [2025-03-09 01:32:21,356 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 333 transitions, 751 flow [2025-03-09 01:32:21,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 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-09 01:32:21,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:21,356 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:21,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:32:21,357 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:21,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1917570306, now seen corresponding path program 1 times [2025-03-09 01:32:21,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:21,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598834254] [2025-03-09 01:32:21,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:21,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:21,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:32:21,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:32:21,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:21,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:32:21,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:21,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598834254] [2025-03-09 01:32:21,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598834254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:21,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:21,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:21,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471641845] [2025-03-09 01:32:21,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:21,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:21,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:21,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:21,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 495 [2025-03-09 01:32:21,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 333 transitions, 751 flow. Second operand has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 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-09 01:32:21,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:21,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 495 [2025-03-09 01:32:21,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:22,108 INFO L124 PetriNetUnfolderBase]: 1546/4164 cut-off events. [2025-03-09 01:32:22,109 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-03-09 01:32:22,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7254 conditions, 4164 events. 1546/4164 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31194 event pairs, 1240 based on Foata normal form. 4/3392 useless extension candidates. Maximal degree in co-relation 7202. Up to 2888 conditions per place. [2025-03-09 01:32:22,122 INFO L140 encePairwiseOnDemand]: 490/495 looper letters, 187 selfloop transitions, 5 changer transitions 0/331 dead transitions. [2025-03-09 01:32:22,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 331 transitions, 1131 flow [2025-03-09 01:32:22,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 790 transitions. [2025-03-09 01:32:22,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2025-03-09 01:32:22,124 INFO L175 Difference]: Start difference. First operand has 315 places, 333 transitions, 751 flow. Second operand 4 states and 790 transitions. [2025-03-09 01:32:22,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 331 transitions, 1131 flow [2025-03-09 01:32:22,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 331 transitions, 1119 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:32:22,130 INFO L231 Difference]: Finished difference. Result has 313 places, 331 transitions, 745 flow [2025-03-09 01:32:22,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=745, PETRI_PLACES=313, PETRI_TRANSITIONS=331} [2025-03-09 01:32:22,131 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -28 predicate places. [2025-03-09 01:32:22,131 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 331 transitions, 745 flow [2025-03-09 01:32:22,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 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-09 01:32:22,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:22,132 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:22,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:32:22,132 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:22,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash -944131694, now seen corresponding path program 1 times [2025-03-09 01:32:22,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:22,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261690220] [2025-03-09 01:32:22,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:22,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:22,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:32:22,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:32:22,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:22,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:32:22,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:22,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261690220] [2025-03-09 01:32:22,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261690220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:32:22,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871210113] [2025-03-09 01:32:22,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:22,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:22,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:22,228 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:32:22,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:32:22,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:32:22,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:32:22,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:22,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:22,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:32:22,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:32:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:32:22,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:32:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:32:22,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871210113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:32:22,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:32:22,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2025-03-09 01:32:22,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673989725] [2025-03-09 01:32:22,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:32:22,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:32:22,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:22,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:32:22,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:32:22,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:22,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 331 transitions, 745 flow. Second operand has 9 states, 9 states have (on average 157.44444444444446) internal successors, (1417), 9 states have internal predecessors, (1417), 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-09 01:32:22,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:22,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:22,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:23,114 INFO L124 PetriNetUnfolderBase]: 1549/4191 cut-off events. [2025-03-09 01:32:23,114 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-09 01:32:23,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7181 conditions, 4191 events. 1549/4191 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31042 event pairs, 1240 based on Foata normal form. 2/3417 useless extension candidates. Maximal degree in co-relation 7129. Up to 2877 conditions per place. [2025-03-09 01:32:23,125 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 208 selfloop transitions, 8 changer transitions 0/355 dead transitions. [2025-03-09 01:32:23,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 355 transitions, 1251 flow [2025-03-09 01:32:23,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:32:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:32:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1289 transitions. [2025-03-09 01:32:23,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.372005772005772 [2025-03-09 01:32:23,128 INFO L175 Difference]: Start difference. First operand has 313 places, 331 transitions, 745 flow. Second operand 7 states and 1289 transitions. [2025-03-09 01:32:23,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 355 transitions, 1251 flow [2025-03-09 01:32:23,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 355 transitions, 1235 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:32:23,132 INFO L231 Difference]: Finished difference. Result has 319 places, 333 transitions, 777 flow [2025-03-09 01:32:23,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=777, PETRI_PLACES=319, PETRI_TRANSITIONS=333} [2025-03-09 01:32:23,132 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -22 predicate places. [2025-03-09 01:32:23,132 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 333 transitions, 777 flow [2025-03-09 01:32:23,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 157.44444444444446) internal successors, (1417), 9 states have internal predecessors, (1417), 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-09 01:32:23,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:23,133 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:23,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:32:23,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:32:23,333 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:23,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1228370252, now seen corresponding path program 1 times [2025-03-09 01:32:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:23,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164627064] [2025-03-09 01:32:23,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:23,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 01:32:23,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:32:23,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:23,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:32:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164627064] [2025-03-09 01:32:23,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164627064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:32:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39039330] [2025-03-09 01:32:23,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:23,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:23,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:23,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:32:23,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:32:23,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 01:32:23,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:32:23,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:23,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:23,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-09 01:32:23,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:32:23,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:32:23,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:32:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:24,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:32:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:32:24,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39039330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:32:24,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:32:24,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2025-03-09 01:32:24,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866975560] [2025-03-09 01:32:24,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:32:24,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:32:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:24,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:32:24,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:32:25,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-09 01:32:25,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 333 transitions, 777 flow. Second operand has 23 states, 23 states have (on average 156.52173913043478) internal successors, (3600), 23 states have internal predecessors, (3600), 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-09 01:32:25,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:25,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-09 01:32:25,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:27,218 INFO L124 PetriNetUnfolderBase]: 1548/4193 cut-off events. [2025-03-09 01:32:27,218 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-09 01:32:27,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7193 conditions, 4193 events. 1548/4193 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31093 event pairs, 1240 based on Foata normal form. 4/3421 useless extension candidates. Maximal degree in co-relation 7136. Up to 2877 conditions per place. [2025-03-09 01:32:27,231 INFO L140 encePairwiseOnDemand]: 481/495 looper letters, 194 selfloop transitions, 22 changer transitions 0/355 dead transitions. [2025-03-09 01:32:27,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 355 transitions, 1267 flow [2025-03-09 01:32:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:32:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 01:32:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2820 transitions. [2025-03-09 01:32:27,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33511586452762926 [2025-03-09 01:32:27,236 INFO L175 Difference]: Start difference. First operand has 319 places, 333 transitions, 777 flow. Second operand 17 states and 2820 transitions. [2025-03-09 01:32:27,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 355 transitions, 1267 flow [2025-03-09 01:32:27,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 355 transitions, 1251 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-09 01:32:27,240 INFO L231 Difference]: Finished difference. Result has 332 places, 339 transitions, 847 flow [2025-03-09 01:32:27,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=847, PETRI_PLACES=332, PETRI_TRANSITIONS=339} [2025-03-09 01:32:27,241 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -9 predicate places. [2025-03-09 01:32:27,241 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 339 transitions, 847 flow [2025-03-09 01:32:27,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 156.52173913043478) internal successors, (3600), 23 states have internal predecessors, (3600), 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-09 01:32:27,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:27,243 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:27,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:32:27,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:27,444 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:27,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:27,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2057195310, now seen corresponding path program 1 times [2025-03-09 01:32:27,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:27,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084740483] [2025-03-09 01:32:27,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:27,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:27,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-09 01:32:27,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 01:32:27,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:27,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-09 01:32:27,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:27,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084740483] [2025-03-09 01:32:27,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084740483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:27,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:27,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:27,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272273431] [2025-03-09 01:32:27,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:27,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:32:27,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:27,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:32:27,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:32:27,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 495 [2025-03-09 01:32:27,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 339 transitions, 847 flow. Second operand has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-09 01:32:27,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:27,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 495 [2025-03-09 01:32:27,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:28,688 INFO L124 PetriNetUnfolderBase]: 1653/5321 cut-off events. [2025-03-09 01:32:28,688 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-09 01:32:28,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8624 conditions, 5321 events. 1653/5321 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 45860 event pairs, 248 based on Foata normal form. 0/4508 useless extension candidates. Maximal degree in co-relation 8565. Up to 1958 conditions per place. [2025-03-09 01:32:28,701 INFO L140 encePairwiseOnDemand]: 488/495 looper letters, 489 selfloop transitions, 5 changer transitions 0/631 dead transitions. [2025-03-09 01:32:28,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 631 transitions, 2419 flow [2025-03-09 01:32:28,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:32:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:32:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1083 transitions. [2025-03-09 01:32:28,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546969696969697 [2025-03-09 01:32:28,703 INFO L175 Difference]: Start difference. First operand has 332 places, 339 transitions, 847 flow. Second operand 4 states and 1083 transitions. [2025-03-09 01:32:28,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 631 transitions, 2419 flow [2025-03-09 01:32:28,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 631 transitions, 2374 flow, removed 7 selfloop flow, removed 11 redundant places. [2025-03-09 01:32:28,709 INFO L231 Difference]: Finished difference. Result has 325 places, 339 transitions, 824 flow [2025-03-09 01:32:28,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=824, PETRI_PLACES=325, PETRI_TRANSITIONS=339} [2025-03-09 01:32:28,710 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -16 predicate places. [2025-03-09 01:32:28,710 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 339 transitions, 824 flow [2025-03-09 01:32:28,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-09 01:32:28,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:28,710 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:28,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:32:28,710 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:28,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash 195802945, now seen corresponding path program 1 times [2025-03-09 01:32:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:28,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861848718] [2025-03-09 01:32:28,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:28,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:28,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 01:32:28,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 01:32:28,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:28,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:32:28,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:28,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861848718] [2025-03-09 01:32:28,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861848718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:28,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:28,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:32:28,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899887889] [2025-03-09 01:32:28,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:28,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:28,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:28,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:28,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:28,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 495 [2025-03-09 01:32:28,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 339 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-09 01:32:28,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:28,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 495 [2025-03-09 01:32:28,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:29,466 INFO L124 PetriNetUnfolderBase]: 1541/4190 cut-off events. [2025-03-09 01:32:29,467 INFO L125 PetriNetUnfolderBase]: For 1032/1035 co-relation queries the response was YES. [2025-03-09 01:32:29,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8068 conditions, 4190 events. 1541/4190 cut-off events. For 1032/1035 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31224 event pairs, 1240 based on Foata normal form. 3/3540 useless extension candidates. Maximal degree in co-relation 8011. Up to 2911 conditions per place. [2025-03-09 01:32:29,484 INFO L140 encePairwiseOnDemand]: 492/495 looper letters, 195 selfloop transitions, 4 changer transitions 0/334 dead transitions. [2025-03-09 01:32:29,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 334 transitions, 1207 flow [2025-03-09 01:32:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:32:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:32:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-03-09 01:32:29,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42828282828282827 [2025-03-09 01:32:29,486 INFO L175 Difference]: Start difference. First operand has 325 places, 339 transitions, 824 flow. Second operand 3 states and 636 transitions. [2025-03-09 01:32:29,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 334 transitions, 1207 flow [2025-03-09 01:32:29,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 334 transitions, 1202 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:32:29,491 INFO L231 Difference]: Finished difference. Result has 323 places, 334 transitions, 812 flow [2025-03-09 01:32:29,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=323, PETRI_TRANSITIONS=334} [2025-03-09 01:32:29,492 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -18 predicate places. [2025-03-09 01:32:29,492 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 334 transitions, 812 flow [2025-03-09 01:32:29,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-09 01:32:29,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:29,493 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:29,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:32:29,493 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-09 01:32:29,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash -617647118, now seen corresponding path program 1 times [2025-03-09 01:32:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109029083] [2025-03-09 01:32:29,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:29,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 01:32:29,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 01:32:29,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:29,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:29,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:32:29,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 01:32:29,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 01:32:29,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:29,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:32:29,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:32:29,755 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:32:29,756 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (153 of 154 remaining) [2025-03-09 01:32:29,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 154 remaining) [2025-03-09 01:32:29,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 154 remaining) [2025-03-09 01:32:29,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 154 remaining) [2025-03-09 01:32:29,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 154 remaining) [2025-03-09 01:32:29,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 154 remaining) [2025-03-09 01:32:29,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 154 remaining) [2025-03-09 01:32:29,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (146 of 154 remaining) [2025-03-09 01:32:29,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (145 of 154 remaining) [2025-03-09 01:32:29,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 154 remaining) [2025-03-09 01:32:29,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (142 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (141 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (138 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (135 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (134 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 154 remaining) [2025-03-09 01:32:29,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 154 remaining) [2025-03-09 01:32:29,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr64ASSERT_VIOLATIONMEMORY_LEAK (127 of 154 remaining) [2025-03-09 01:32:29,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 154 remaining) [2025-03-09 01:32:29,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 154 remaining) [2025-03-09 01:32:29,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr63ASSERT_VIOLATIONMEMORY_LEAK (124 of 154 remaining) [2025-03-09 01:32:29,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 154 remaining) [2025-03-09 01:32:29,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 154 remaining) [2025-03-09 01:32:29,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 154 remaining) [2025-03-09 01:32:29,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 154 remaining) [2025-03-09 01:32:29,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr27ASSERT_VIOLATIONMEMORY_LEAK (119 of 154 remaining) [2025-03-09 01:32:29,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 154 remaining) [2025-03-09 01:32:29,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 154 remaining) [2025-03-09 01:32:29,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr24ASSERT_VIOLATIONMEMORY_LEAK (110 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr52ASSERT_VIOLATIONMEMORY_LEAK (107 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr51ASSERT_VIOLATIONMEMORY_LEAK (104 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 154 remaining) [2025-03-09 01:32:29,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 154 remaining) [2025-03-09 01:32:29,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 154 remaining) [2025-03-09 01:32:29,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 154 remaining) [2025-03-09 01:32:29,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 154 remaining) [2025-03-09 01:32:29,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 154 remaining) [2025-03-09 01:32:29,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 154 remaining) [2025-03-09 01:32:29,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr50ASSERT_VIOLATIONMEMORY_LEAK (95 of 154 remaining) [2025-03-09 01:32:29,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 154 remaining) [2025-03-09 01:32:29,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 154 remaining) [2025-03-09 01:32:29,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 154 remaining) [2025-03-09 01:32:29,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 154 remaining) [2025-03-09 01:32:29,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONMEMORY_LEAK (90 of 154 remaining) [2025-03-09 01:32:29,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONMEMORY_LEAK (87 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONMEMORY_LEAK (86 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONMEMORY_LEAK (81 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr64ASSERT_VIOLATIONMEMORY_LEAK (62 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr63ASSERT_VIOLATIONMEMORY_LEAK (59 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr27ASSERT_VIOLATIONMEMORY_LEAK (54 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 154 remaining) [2025-03-09 01:32:29,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 154 remaining) [2025-03-09 01:32:29,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 154 remaining) [2025-03-09 01:32:29,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 154 remaining) [2025-03-09 01:32:29,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr24ASSERT_VIOLATIONMEMORY_LEAK (45 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr52ASSERT_VIOLATIONMEMORY_LEAK (42 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr51ASSERT_VIOLATIONMEMORY_LEAK (39 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr50ASSERT_VIOLATIONMEMORY_LEAK (30 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONMEMORY_LEAK (25 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 154 remaining) [2025-03-09 01:32:29,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONMEMORY_LEAK (22 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONMEMORY_LEAK (16 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 154 remaining) [2025-03-09 01:32:29,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 154 remaining) [2025-03-09 01:32:29,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:32:29,766 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:29,770 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:32:29,770 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 01:32:29,979 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:32:29,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 587 places, 856 transitions, 1728 flow [2025-03-09 01:32:30,109 INFO L124 PetriNetUnfolderBase]: 309/973 cut-off events. [2025-03-09 01:32:30,110 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:32:30,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 973 events. 309/973 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4911 event pairs, 0 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 792. Up to 12 conditions per place. [2025-03-09 01:32:30,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 587 places, 856 transitions, 1728 flow [2025-03-09 01:32:30,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 587 places, 856 transitions, 1728 flow [2025-03-09 01:32:30,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:32:30,156 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;@56ccff25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:32:30,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 219 error locations. [2025-03-09 01:32:30,157 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:32:30,157 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-09 01:32:30,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:32:30,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:30,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-09 01:32:30,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 216 more)] === [2025-03-09 01:32:30,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash 108902, now seen corresponding path program 1 times [2025-03-09 01:32:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:30,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774118701] [2025-03-09 01:32:30,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:30,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:30,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 01:32:30,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 01:32:30,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:30,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:30,199 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-09 01:32:30,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:30,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774118701] [2025-03-09 01:32:30,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774118701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:30,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:30,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:32:30,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877331436] [2025-03-09 01:32:30,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:30,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:30,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:30,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:30,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:30,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 856 [2025-03-09 01:32:30,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 856 transitions, 1728 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 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-09 01:32:30,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:30,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 856 [2025-03-09 01:32:30,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand