./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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/bounded_mpmc_check_full.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 f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:31:35,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:31:35,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:31:35,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:31:35,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:31:35,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:31:35,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:31:35,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:31:35,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:31:35,961 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:31:35,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:31:35,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:31:35,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:31:35,962 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:31:35,963 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:31:35,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:31:35,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:31:35,963 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 -> f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe [2025-03-09 01:31:36,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:31:36,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:31:36,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:31:36,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:31:36,185 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:31:36,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-03-09 01:31:37,269 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35db56597/20ffebb2016f49e2acae01805f9e59f2/FLAG8aaad3df8 [2025-03-09 01:31:37,661 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:31:37,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-03-09 01:31:37,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35db56597/20ffebb2016f49e2acae01805f9e59f2/FLAG8aaad3df8 [2025-03-09 01:31:37,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35db56597/20ffebb2016f49e2acae01805f9e59f2 [2025-03-09 01:31:37,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:31:37,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:31:37,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:31:37,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:31:37,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:31:37,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:31:37" (1/1) ... [2025-03-09 01:31:37,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26046535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:37, skipping insertion in model container [2025-03-09 01:31:37,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:31:37" (1/1) ... [2025-03-09 01:31:37,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:31:38,986 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:31:38,991 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:31:38,991 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:31:38,996 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:31:38,996 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:31:39,119 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:31:39,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:31:39,146 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:31:39,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-03-09 01:31:39,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-03-09 01:31:39,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-03-09 01:31:39,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-03-09 01:31:39,232 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-03-09 01:31:39,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-03-09 01:31:39,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-03-09 01:31:39,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-03-09 01:31:39,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-03-09 01:31:39,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-03-09 01:31:39,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-03-09 01:31:39,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-03-09 01:31:39,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-03-09 01:31:39,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-03-09 01:31:39,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-03-09 01:31:39,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-03-09 01:31:39,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-03-09 01:31:39,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-03-09 01:31:39,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-03-09 01:31:39,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-03-09 01:31:39,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-03-09 01:31:39,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-03-09 01:31:39,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-03-09 01:31:39,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-03-09 01:31:39,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-03-09 01:31:39,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-03-09 01:31:39,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-03-09 01:31:39,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-03-09 01:31:39,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-03-09 01:31:39,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-03-09 01:31:39,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-03-09 01:31:39,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-03-09 01:31:39,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-03-09 01:31:39,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-03-09 01:31:39,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-03-09 01:31:39,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-03-09 01:31:39,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-03-09 01:31:39,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-03-09 01:31:39,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-03-09 01:31:39,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-03-09 01:31:39,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-03-09 01:31:39,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-03-09 01:31:39,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-03-09 01:31:39,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-03-09 01:31:39,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-03-09 01:31:39,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-03-09 01:31:39,247 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-03-09 01:31:39,247 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-03-09 01:31:39,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-03-09 01:31:39,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-03-09 01:31:39,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-03-09 01:31:39,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-03-09 01:31:39,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-03-09 01:31:39,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-03-09 01:31:39,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-03-09 01:31:39,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-03-09 01:31:39,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-03-09 01:31:39,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-03-09 01:31:39,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-03-09 01:31:39,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-03-09 01:31:39,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-03-09 01:31:39,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-03-09 01:31:39,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-03-09 01:31:39,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-03-09 01:31:39,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-03-09 01:31:39,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-03-09 01:31:39,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-03-09 01:31:39,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-03-09 01:31:39,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-03-09 01:31:39,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-03-09 01:31:39,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-03-09 01:31:39,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-03-09 01:31:39,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-03-09 01:31:39,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-03-09 01:31:39,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-03-09 01:31:39,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-03-09 01:31:39,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-03-09 01:31:39,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-03-09 01:31:39,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-03-09 01:31:39,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-03-09 01:31:39,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-03-09 01:31:39,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-03-09 01:31:39,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-03-09 01:31:39,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-03-09 01:31:39,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-03-09 01:31:39,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-03-09 01:31:39,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-03-09 01:31:39,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-03-09 01:31:39,262 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-03-09 01:31:39,262 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-03-09 01:31:39,262 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-03-09 01:31:39,262 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-03-09 01:31:39,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-03-09 01:31:39,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-03-09 01:31:39,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-03-09 01:31:39,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-03-09 01:31:39,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-03-09 01:31:39,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-03-09 01:31:39,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-03-09 01:31:39,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-03-09 01:31:39,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:31:39,480 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:31:39,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:39 WrapperNode [2025-03-09 01:31:39,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:31:39,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:31:39,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:31:39,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:31:39,485 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:31:39" (1/1) ... [2025-03-09 01:31:39,526 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:31:39" (1/1) ... [2025-03-09 01:31:39,569 INFO L138 Inliner]: procedures = 914, calls = 957, calls flagged for inlining = 822, calls inlined = 64, statements flattened = 649 [2025-03-09 01:31:39,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:31:39,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:31:39,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:31:39,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:31:39,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:39" (1/1) ... [2025-03-09 01:31:39,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:39" (1/1) ... [2025-03-09 01:31:39,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:39" (1/1) ... [2025-03-09 01:31:39,611 INFO L175 MemorySlicer]: Split 65 memory accesses to 5 slices as follows [2, 9, 8, 44, 2]. 68 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 4, 6, 0]. The 20 writes are split as follows [0, 2, 3, 14, 1]. [2025-03-09 01:31:39,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:39" (1/1) ... [2025-03-09 01:31:39,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:39" (1/1) ... [2025-03-09 01:31:39,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:39" (1/1) ... [2025-03-09 01:31:39,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:39" (1/1) ... [2025-03-09 01:31:39,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:39" (1/1) ... [2025-03-09 01:31:39,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:39" (1/1) ... [2025-03-09 01:31:39,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:31:39,651 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:31:39,651 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:31:39,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:31:39,652 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:39" (1/1) ... [2025-03-09 01:31:39,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:31:39,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:39,676 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:31:39,678 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:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:31:39,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:31:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-03-09 01:31:39,699 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 01:31:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 01:31:39,700 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:31:39,844 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:31:39,845 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:31:40,580 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-03-09 01:31:40,580 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-9: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-03-09 01:31:40,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-18: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-03-09 01:31:40,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-09 01:31:40,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-9: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-09 01:31:40,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-09 01:31:40,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-9: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-09 01:31:40,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-18: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-09 01:31:40,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-27: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-09 01:31:40,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-09 01:31:40,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-09 01:31:40,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043: havoc main_~#r~0#1.base, main_~#r~0#1.offset; [2025-03-09 01:31:40,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-1: SUMMARY for call ULTIMATE.dealloc(main_~#r~0#1.base, main_~#r~0#1.offset); srcloc: null [2025-03-09 01:31:40,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808: havoc vatomic32_await_eq_rlx_#t~ret172#1; [2025-03-09 01:31:40,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-03-09 01:31:40,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6019: havoc ~#xbo~0#1.base, ~#xbo~0#1.offset; [2025-03-09 01:31:40,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6019-1: SUMMARY for call ULTIMATE.dealloc(~#xbo~0#1.base, ~#xbo~0#1.offset); srcloc: null [2025-03-09 01:31:40,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-09 01:31:40,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-09 01:31:40,706 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:31:40,706 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:31:41,024 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:31:41,024 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:31:41,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:31:41 BoogieIcfgContainer [2025-03-09 01:31:41,024 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:31:41,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:31:41,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:31:41,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:31:41,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:31:37" (1/3) ... [2025-03-09 01:31:41,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d7b9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:31:41, skipping insertion in model container [2025-03-09 01:31:41,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:39" (2/3) ... [2025-03-09 01:31:41,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d7b9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:31:41, skipping insertion in model container [2025-03-09 01:31:41,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:31:41" (3/3) ... [2025-03-09 01:31:41,031 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-03-09 01:31:41,041 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:31:41,043 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_mpmc_check_full.i that has 2 procedures, 251 locations, 1 initial locations, 16 loop locations, and 104 error locations. [2025-03-09 01:31:41,043 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:31:41,125 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 01:31:41,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 312 transitions, 631 flow [2025-03-09 01:31:41,273 INFO L124 PetriNetUnfolderBase]: 108/530 cut-off events. [2025-03-09 01:31:41,280 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:31:41,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 530 events. 108/530 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2399 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 265. Up to 12 conditions per place. [2025-03-09 01:31:41,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 254 places, 312 transitions, 631 flow [2025-03-09 01:31:41,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 312 transitions, 631 flow [2025-03-09 01:31:41,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:31:41,310 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;@3bfec53e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:31:41,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2025-03-09 01:31:41,317 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:31:41,318 INFO L124 PetriNetUnfolderBase]: 6/16 cut-off events. [2025-03-09 01:31:41,318 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:31:41,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:41,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:31:41,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:41,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:41,323 INFO L85 PathProgramCache]: Analyzing trace with hash 63546824, now seen corresponding path program 1 times [2025-03-09 01:31:41,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:41,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414603036] [2025-03-09 01:31:41,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:41,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:31:41,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:31:41,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:41,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:41,487 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:31:41,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414603036] [2025-03-09 01:31:41,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414603036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:41,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:41,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:41,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393519125] [2025-03-09 01:31:41,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:41,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 01:31:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:41,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 01:31:41,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:31:41,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 312 [2025-03-09 01:31:41,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 312 transitions, 631 flow. Second operand has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:41,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:41,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 312 [2025-03-09 01:31:41,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:42,431 INFO L124 PetriNetUnfolderBase]: 2858/7087 cut-off events. [2025-03-09 01:31:42,431 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:31:42,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12453 conditions, 7087 events. 2858/7087 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 54441 event pairs, 2277 based on Foata normal form. 604/4879 useless extension candidates. Maximal degree in co-relation 12124. Up to 5361 conditions per place. [2025-03-09 01:31:42,475 INFO L140 encePairwiseOnDemand]: 256/312 looper letters, 148 selfloop transitions, 0 changer transitions 0/249 dead transitions. [2025-03-09 01:31:42,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 249 transitions, 801 flow [2025-03-09 01:31:42,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 01:31:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 01:31:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 406 transitions. [2025-03-09 01:31:42,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6506410256410257 [2025-03-09 01:31:42,490 INFO L175 Difference]: Start difference. First operand has 254 places, 312 transitions, 631 flow. Second operand 2 states and 406 transitions. [2025-03-09 01:31:42,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 249 transitions, 801 flow [2025-03-09 01:31:42,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 249 transitions, 801 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:31:42,500 INFO L231 Difference]: Finished difference. Result has 240 places, 249 transitions, 505 flow [2025-03-09 01:31:42,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=505, PETRI_PLACES=240, PETRI_TRANSITIONS=249} [2025-03-09 01:31:42,505 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -14 predicate places. [2025-03-09 01:31:42,507 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 249 transitions, 505 flow [2025-03-09 01:31:42,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:42,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:42,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:31:42,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:31:42,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:42,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:42,508 INFO L85 PathProgramCache]: Analyzing trace with hash 63545956, now seen corresponding path program 1 times [2025-03-09 01:31:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:42,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466451042] [2025-03-09 01:31:42,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:42,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:31:42,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:31:42,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:42,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:42,619 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:31:42,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:42,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466451042] [2025-03-09 01:31:42,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466451042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:42,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:42,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:42,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913944343] [2025-03-09 01:31:42,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:42,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:42,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:42,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:42,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:42,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 312 [2025-03-09 01:31:42,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 249 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:42,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:42,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 312 [2025-03-09 01:31:42,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:43,453 INFO L124 PetriNetUnfolderBase]: 2858/7084 cut-off events. [2025-03-09 01:31:43,453 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:31:43,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12450 conditions, 7084 events. 2858/7084 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 54441 event pairs, 2277 based on Foata normal form. 1/4273 useless extension candidates. Maximal degree in co-relation 12446. Up to 5342 conditions per place. [2025-03-09 01:31:43,482 INFO L140 encePairwiseOnDemand]: 309/312 looper letters, 145 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2025-03-09 01:31:43,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 246 transitions, 793 flow [2025-03-09 01:31:43,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2025-03-09 01:31:43,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48183760683760685 [2025-03-09 01:31:43,486 INFO L175 Difference]: Start difference. First operand has 240 places, 249 transitions, 505 flow. Second operand 3 states and 451 transitions. [2025-03-09 01:31:43,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 246 transitions, 793 flow [2025-03-09 01:31:43,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 246 transitions, 793 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:31:43,492 INFO L231 Difference]: Finished difference. Result has 239 places, 246 transitions, 503 flow [2025-03-09 01:31:43,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=503, PETRI_PLACES=239, PETRI_TRANSITIONS=246} [2025-03-09 01:31:43,494 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -15 predicate places. [2025-03-09 01:31:43,495 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 246 transitions, 503 flow [2025-03-09 01:31:43,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:43,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:43,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:31:43,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:31:43,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:43,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash 934312185, now seen corresponding path program 1 times [2025-03-09 01:31:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:43,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348320167] [2025-03-09 01:31:43,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:43,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:31:43,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:31:43,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:43,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:43,609 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:31:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348320167] [2025-03-09 01:31:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348320167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:43,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:43,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:31:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191233273] [2025-03-09 01:31:43,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:43,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:43,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:43,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:43,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 312 [2025-03-09 01:31:43,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 246 transitions, 503 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:43,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:43,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 312 [2025-03-09 01:31:43,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:44,301 INFO L124 PetriNetUnfolderBase]: 2858/7082 cut-off events. [2025-03-09 01:31:44,302 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:31:44,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12451 conditions, 7082 events. 2858/7082 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 54385 event pairs, 2277 based on Foata normal form. 1/4273 useless extension candidates. Maximal degree in co-relation 12446. Up to 5342 conditions per place. [2025-03-09 01:31:44,321 INFO L140 encePairwiseOnDemand]: 308/312 looper letters, 145 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2025-03-09 01:31:44,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 244 transitions, 793 flow [2025-03-09 01:31:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2025-03-09 01:31:44,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47649572649572647 [2025-03-09 01:31:44,323 INFO L175 Difference]: Start difference. First operand has 239 places, 246 transitions, 503 flow. Second operand 3 states and 446 transitions. [2025-03-09 01:31:44,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 244 transitions, 793 flow [2025-03-09 01:31:44,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 244 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:44,326 INFO L231 Difference]: Finished difference. Result has 237 places, 244 transitions, 499 flow [2025-03-09 01:31:44,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=237, PETRI_TRANSITIONS=244} [2025-03-09 01:31:44,327 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -17 predicate places. [2025-03-09 01:31:44,327 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 244 transitions, 499 flow [2025-03-09 01:31:44,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:44,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:44,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:31:44,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:31:44,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:44,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash 934312186, now seen corresponding path program 1 times [2025-03-09 01:31:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:44,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878011864] [2025-03-09 01:31:44,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:44,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:31:44,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:31:44,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:44,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:44,459 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:31:44,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:44,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878011864] [2025-03-09 01:31:44,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878011864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:44,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:44,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:31:44,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593201630] [2025-03-09 01:31:44,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:44,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:44,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:44,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:44,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:44,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 312 [2025-03-09 01:31:44,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 244 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:44,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:44,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 312 [2025-03-09 01:31:44,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:45,214 INFO L124 PetriNetUnfolderBase]: 2858/7080 cut-off events. [2025-03-09 01:31:45,215 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:31:45,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12449 conditions, 7080 events. 2858/7080 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 54456 event pairs, 2277 based on Foata normal form. 1/4272 useless extension candidates. Maximal degree in co-relation 12444. Up to 5342 conditions per place. [2025-03-09 01:31:45,240 INFO L140 encePairwiseOnDemand]: 308/312 looper letters, 145 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2025-03-09 01:31:45,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 242 transitions, 789 flow [2025-03-09 01:31:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2025-03-09 01:31:45,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47649572649572647 [2025-03-09 01:31:45,242 INFO L175 Difference]: Start difference. First operand has 237 places, 244 transitions, 499 flow. Second operand 3 states and 446 transitions. [2025-03-09 01:31:45,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 242 transitions, 789 flow [2025-03-09 01:31:45,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 242 transitions, 785 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:45,245 INFO L231 Difference]: Finished difference. Result has 235 places, 242 transitions, 495 flow [2025-03-09 01:31:45,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=235, PETRI_TRANSITIONS=242} [2025-03-09 01:31:45,246 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -19 predicate places. [2025-03-09 01:31:45,246 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 242 transitions, 495 flow [2025-03-09 01:31:45,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:45,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:45,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:31:45,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:31:45,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:45,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:45,247 INFO L85 PathProgramCache]: Analyzing trace with hash 934316017, now seen corresponding path program 1 times [2025-03-09 01:31:45,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:45,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005261008] [2025-03-09 01:31:45,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:45,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:45,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:31:45,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:31:45,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:45,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:45,290 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:31:45,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:45,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005261008] [2025-03-09 01:31:45,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005261008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:45,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:45,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:45,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212399237] [2025-03-09 01:31:45,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:45,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:45,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:45,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:45,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:45,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 312 [2025-03-09 01:31:45,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 242 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:45,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:45,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 312 [2025-03-09 01:31:45,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:45,954 INFO L124 PetriNetUnfolderBase]: 2858/7077 cut-off events. [2025-03-09 01:31:45,954 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:31:45,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12445 conditions, 7077 events. 2858/7077 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 54436 event pairs, 2277 based on Foata normal form. 1/4269 useless extension candidates. Maximal degree in co-relation 12440. Up to 5342 conditions per place. [2025-03-09 01:31:45,971 INFO L140 encePairwiseOnDemand]: 309/312 looper letters, 144 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2025-03-09 01:31:45,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 239 transitions, 781 flow [2025-03-09 01:31:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2025-03-09 01:31:45,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2025-03-09 01:31:45,975 INFO L175 Difference]: Start difference. First operand has 235 places, 242 transitions, 495 flow. Second operand 3 states and 450 transitions. [2025-03-09 01:31:45,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 239 transitions, 781 flow [2025-03-09 01:31:45,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 239 transitions, 777 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:45,978 INFO L231 Difference]: Finished difference. Result has 232 places, 239 transitions, 489 flow [2025-03-09 01:31:45,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=489, PETRI_PLACES=232, PETRI_TRANSITIONS=239} [2025-03-09 01:31:45,980 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -22 predicate places. [2025-03-09 01:31:45,980 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 239 transitions, 489 flow [2025-03-09 01:31:45,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:45,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:45,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:45,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:31:45,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:45,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash 225910317, now seen corresponding path program 1 times [2025-03-09 01:31:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:45,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769678246] [2025-03-09 01:31:45,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:45,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:45,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:31:45,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:31:45,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:45,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:31:46,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:46,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769678246] [2025-03-09 01:31:46,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769678246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:46,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:46,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:31:46,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076914688] [2025-03-09 01:31:46,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:46,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:31:46,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:46,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:31:46,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:31:46,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 312 [2025-03-09 01:31:46,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 239 transitions, 489 flow. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:46,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:46,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 312 [2025-03-09 01:31:46,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:46,769 INFO L124 PetriNetUnfolderBase]: 2858/7076 cut-off events. [2025-03-09 01:31:46,770 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:31:46,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12444 conditions, 7076 events. 2858/7076 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 54491 event pairs, 2199 based on Foata normal form. 0/4271 useless extension candidates. Maximal degree in co-relation 12439. Up to 5174 conditions per place. [2025-03-09 01:31:46,783 INFO L140 encePairwiseOnDemand]: 298/312 looper letters, 165 selfloop transitions, 10 changer transitions 0/267 dead transitions. [2025-03-09 01:31:46,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 267 transitions, 895 flow [2025-03-09 01:31:46,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2025-03-09 01:31:46,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4288461538461538 [2025-03-09 01:31:46,786 INFO L175 Difference]: Start difference. First operand has 232 places, 239 transitions, 489 flow. Second operand 5 states and 669 transitions. [2025-03-09 01:31:46,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 267 transitions, 895 flow [2025-03-09 01:31:46,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 267 transitions, 891 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:46,791 INFO L231 Difference]: Finished difference. Result has 231 places, 239 transitions, 520 flow [2025-03-09 01:31:46,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=520, PETRI_PLACES=231, PETRI_TRANSITIONS=239} [2025-03-09 01:31:46,792 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -23 predicate places. [2025-03-09 01:31:46,792 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 239 transitions, 520 flow [2025-03-09 01:31:46,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:46,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:46,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:46,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:31:46,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:46,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:46,793 INFO L85 PathProgramCache]: Analyzing trace with hash 225910318, now seen corresponding path program 1 times [2025-03-09 01:31:46,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:46,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690955132] [2025-03-09 01:31:46,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:46,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:31:46,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:31:46,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:46,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:46,929 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:31:46,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:46,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690955132] [2025-03-09 01:31:46,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690955132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:46,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:46,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:46,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459328336] [2025-03-09 01:31:46,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:46,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:31:46,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:46,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:31:46,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:31:47,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 312 [2025-03-09 01:31:47,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 239 transitions, 520 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:47,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:47,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 312 [2025-03-09 01:31:47,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:47,584 INFO L124 PetriNetUnfolderBase]: 2858/7075 cut-off events. [2025-03-09 01:31:47,584 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-03-09 01:31:47,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12790 conditions, 7075 events. 2858/7075 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 54558 event pairs, 2274 based on Foata normal form. 0/4444 useless extension candidates. Maximal degree in co-relation 12784. Up to 5345 conditions per place. [2025-03-09 01:31:47,604 INFO L140 encePairwiseOnDemand]: 307/312 looper letters, 141 selfloop transitions, 4 changer transitions 0/238 dead transitions. [2025-03-09 01:31:47,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 238 transitions, 808 flow [2025-03-09 01:31:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:31:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:31:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2025-03-09 01:31:47,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4310897435897436 [2025-03-09 01:31:47,606 INFO L175 Difference]: Start difference. First operand has 231 places, 239 transitions, 520 flow. Second operand 4 states and 538 transitions. [2025-03-09 01:31:47,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 238 transitions, 808 flow [2025-03-09 01:31:47,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 238 transitions, 795 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:47,613 INFO L231 Difference]: Finished difference. Result has 230 places, 238 transitions, 513 flow [2025-03-09 01:31:47,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=513, PETRI_PLACES=230, PETRI_TRANSITIONS=238} [2025-03-09 01:31:47,614 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -24 predicate places. [2025-03-09 01:31:47,614 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 238 transitions, 513 flow [2025-03-09 01:31:47,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:47,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:47,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:47,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:31:47,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:47,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:47,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1943457800, now seen corresponding path program 1 times [2025-03-09 01:31:47,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:47,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807273089] [2025-03-09 01:31:47,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:47,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:47,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:31:47,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:31:47,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:47,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:47,758 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:31:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:47,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807273089] [2025-03-09 01:31:47,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807273089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:47,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:47,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:47,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701313956] [2025-03-09 01:31:47,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:47,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:31:47,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:47,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:31:47,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:31:47,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 312 [2025-03-09 01:31:47,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 238 transitions, 513 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:47,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:47,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 312 [2025-03-09 01:31:47,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:48,392 INFO L124 PetriNetUnfolderBase]: 2858/7074 cut-off events. [2025-03-09 01:31:48,392 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-09 01:31:48,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12702 conditions, 7074 events. 2858/7074 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 54565 event pairs, 2274 based on Foata normal form. 0/4444 useless extension candidates. Maximal degree in co-relation 12696. Up to 5345 conditions per place. [2025-03-09 01:31:48,412 INFO L140 encePairwiseOnDemand]: 307/312 looper letters, 140 selfloop transitions, 4 changer transitions 0/237 dead transitions. [2025-03-09 01:31:48,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 237 transitions, 799 flow [2025-03-09 01:31:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:31:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:31:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2025-03-09 01:31:48,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43028846153846156 [2025-03-09 01:31:48,414 INFO L175 Difference]: Start difference. First operand has 230 places, 238 transitions, 513 flow. Second operand 4 states and 537 transitions. [2025-03-09 01:31:48,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 237 transitions, 799 flow [2025-03-09 01:31:48,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 237 transitions, 791 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:48,418 INFO L231 Difference]: Finished difference. Result has 229 places, 237 transitions, 511 flow [2025-03-09 01:31:48,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=511, PETRI_PLACES=229, PETRI_TRANSITIONS=237} [2025-03-09 01:31:48,419 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -25 predicate places. [2025-03-09 01:31:48,419 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 237 transitions, 511 flow [2025-03-09 01:31:48,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:48,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:48,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:48,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:31:48,420 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:48,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash 647894090, now seen corresponding path program 1 times [2025-03-09 01:31:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:48,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873801001] [2025-03-09 01:31:48,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:48,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:48,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:31:48,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:31:48,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:48,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:48,586 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:31:48,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:48,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873801001] [2025-03-09 01:31:48,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873801001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:48,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:48,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996402544] [2025-03-09 01:31:48,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:48,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:31:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:48,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:31:48,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:31:48,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 312 [2025-03-09 01:31:48,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 237 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:48,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:48,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 312 [2025-03-09 01:31:48,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:49,221 INFO L124 PetriNetUnfolderBase]: 2858/7073 cut-off events. [2025-03-09 01:31:49,221 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-09 01:31:49,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12700 conditions, 7073 events. 2858/7073 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 54557 event pairs, 2274 based on Foata normal form. 0/4444 useless extension candidates. Maximal degree in co-relation 12694. Up to 5345 conditions per place. [2025-03-09 01:31:49,238 INFO L140 encePairwiseOnDemand]: 307/312 looper letters, 139 selfloop transitions, 4 changer transitions 0/236 dead transitions. [2025-03-09 01:31:49,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 236 transitions, 795 flow [2025-03-09 01:31:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:31:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:31:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2025-03-09 01:31:49,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2025-03-09 01:31:49,239 INFO L175 Difference]: Start difference. First operand has 229 places, 237 transitions, 511 flow. Second operand 4 states and 536 transitions. [2025-03-09 01:31:49,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 236 transitions, 795 flow [2025-03-09 01:31:49,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 236 transitions, 787 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:49,243 INFO L231 Difference]: Finished difference. Result has 228 places, 236 transitions, 509 flow [2025-03-09 01:31:49,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=509, PETRI_PLACES=228, PETRI_TRANSITIONS=236} [2025-03-09 01:31:49,244 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -26 predicate places. [2025-03-09 01:31:49,244 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 236 transitions, 509 flow [2025-03-09 01:31:49,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:49,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:49,246 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:49,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:31:49,246 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:49,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:49,246 INFO L85 PathProgramCache]: Analyzing trace with hash -143977638, now seen corresponding path program 1 times [2025-03-09 01:31:49,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:49,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913865835] [2025-03-09 01:31:49,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:49,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:49,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:31:49,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:31:49,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:49,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:49,373 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:31:49,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:49,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913865835] [2025-03-09 01:31:49,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913865835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:49,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:49,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:49,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838174616] [2025-03-09 01:31:49,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:49,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:31:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:49,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:31:49,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:31:49,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 312 [2025-03-09 01:31:49,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 236 transitions, 509 flow. Second operand has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:49,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:49,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 312 [2025-03-09 01:31:49,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:50,005 INFO L124 PetriNetUnfolderBase]: 2858/7072 cut-off events. [2025-03-09 01:31:50,005 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-09 01:31:50,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12698 conditions, 7072 events. 2858/7072 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 54541 event pairs, 2274 based on Foata normal form. 0/4444 useless extension candidates. Maximal degree in co-relation 12692. Up to 5345 conditions per place. [2025-03-09 01:31:50,027 INFO L140 encePairwiseOnDemand]: 308/312 looper letters, 139 selfloop transitions, 3 changer transitions 0/235 dead transitions. [2025-03-09 01:31:50,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 235 transitions, 791 flow [2025-03-09 01:31:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:31:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:31:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2025-03-09 01:31:50,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4286858974358974 [2025-03-09 01:31:50,028 INFO L175 Difference]: Start difference. First operand has 228 places, 236 transitions, 509 flow. Second operand 4 states and 535 transitions. [2025-03-09 01:31:50,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 235 transitions, 791 flow [2025-03-09 01:31:50,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 235 transitions, 783 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:50,032 INFO L231 Difference]: Finished difference. Result has 227 places, 235 transitions, 505 flow [2025-03-09 01:31:50,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=505, PETRI_PLACES=227, PETRI_TRANSITIONS=235} [2025-03-09 01:31:50,033 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -27 predicate places. [2025-03-09 01:31:50,033 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 235 transitions, 505 flow [2025-03-09 01:31:50,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:50,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:50,033 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:31:50,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:31:50,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:50,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:50,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1436477960, now seen corresponding path program 1 times [2025-03-09 01:31:50,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:50,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635842954] [2025-03-09 01:31:50,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:50,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:50,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:31:50,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:31:50,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:50,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:50,169 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:31:50,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:50,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635842954] [2025-03-09 01:31:50,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635842954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:50,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:50,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:31:50,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291446821] [2025-03-09 01:31:50,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:50,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:31:50,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:50,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:31:50,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:31:50,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 312 [2025-03-09 01:31:50,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 235 transitions, 505 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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:31:50,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:50,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 312 [2025-03-09 01:31:50,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:50,933 INFO L124 PetriNetUnfolderBase]: 2921/7310 cut-off events. [2025-03-09 01:31:50,933 INFO L125 PetriNetUnfolderBase]: For 86/89 co-relation queries the response was YES. [2025-03-09 01:31:50,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13058 conditions, 7310 events. 2921/7310 cut-off events. For 86/89 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 57195 event pairs, 2145 based on Foata normal form. 1/4612 useless extension candidates. Maximal degree in co-relation 13052. Up to 5467 conditions per place. [2025-03-09 01:31:50,963 INFO L140 encePairwiseOnDemand]: 305/312 looper letters, 146 selfloop transitions, 6 changer transitions 0/243 dead transitions. [2025-03-09 01:31:50,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 243 transitions, 825 flow [2025-03-09 01:31:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:31:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:31:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2025-03-09 01:31:50,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-03-09 01:31:50,965 INFO L175 Difference]: Start difference. First operand has 227 places, 235 transitions, 505 flow. Second operand 4 states and 546 transitions. [2025-03-09 01:31:50,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 243 transitions, 825 flow [2025-03-09 01:31:50,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 243 transitions, 819 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:50,970 INFO L231 Difference]: Finished difference. Result has 229 places, 240 transitions, 541 flow [2025-03-09 01:31:50,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=541, PETRI_PLACES=229, PETRI_TRANSITIONS=240} [2025-03-09 01:31:50,970 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -25 predicate places. [2025-03-09 01:31:50,971 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 240 transitions, 541 flow [2025-03-09 01:31:50,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 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:31:50,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:50,971 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:31:50,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:31:50,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:50,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:50,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1436477959, now seen corresponding path program 1 times [2025-03-09 01:31:50,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:50,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529788533] [2025-03-09 01:31:50,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:50,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:50,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:31:50,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:31:50,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:50,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:51,023 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:31:51,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:51,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529788533] [2025-03-09 01:31:51,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529788533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:51,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:51,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:51,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147110970] [2025-03-09 01:31:51,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:51,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:51,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:51,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:51,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 312 [2025-03-09 01:31:51,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 240 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:51,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:51,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 312 [2025-03-09 01:31:51,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:51,699 INFO L124 PetriNetUnfolderBase]: 2930/7414 cut-off events. [2025-03-09 01:31:51,699 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2025-03-09 01:31:51,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13477 conditions, 7414 events. 2930/7414 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 58881 event pairs, 2085 based on Foata normal form. 0/4733 useless extension candidates. Maximal degree in co-relation 13469. Up to 5166 conditions per place. [2025-03-09 01:31:51,713 INFO L140 encePairwiseOnDemand]: 305/312 looper letters, 273 selfloop transitions, 6 changer transitions 0/368 dead transitions. [2025-03-09 01:31:51,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 368 transitions, 1382 flow [2025-03-09 01:31:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2025-03-09 01:31:51,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6014957264957265 [2025-03-09 01:31:51,714 INFO L175 Difference]: Start difference. First operand has 229 places, 240 transitions, 541 flow. Second operand 3 states and 563 transitions. [2025-03-09 01:31:51,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 368 transitions, 1382 flow [2025-03-09 01:31:51,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 368 transitions, 1382 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:31:51,718 INFO L231 Difference]: Finished difference. Result has 233 places, 244 transitions, 587 flow [2025-03-09 01:31:51,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=587, PETRI_PLACES=233, PETRI_TRANSITIONS=244} [2025-03-09 01:31:51,719 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -21 predicate places. [2025-03-09 01:31:51,719 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 244 transitions, 587 flow [2025-03-09 01:31:51,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:51,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:51,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:51,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:31:51,719 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:51,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:51,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1012040538, now seen corresponding path program 1 times [2025-03-09 01:31:51,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:51,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296328764] [2025-03-09 01:31:51,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:51,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:51,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:31:51,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:31:51,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:51,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:51,865 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:31:51,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:51,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296328764] [2025-03-09 01:31:51,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296328764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:51,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:51,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:31:51,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517698035] [2025-03-09 01:31:51,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:51,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:51,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:51,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:51,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:31:51,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 312 [2025-03-09 01:31:51,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 244 transitions, 587 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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:31:51,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:51,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 312 [2025-03-09 01:31:51,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:52,636 INFO L124 PetriNetUnfolderBase]: 2912/7420 cut-off events. [2025-03-09 01:31:52,637 INFO L125 PetriNetUnfolderBase]: For 812/818 co-relation queries the response was YES. [2025-03-09 01:31:52,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13725 conditions, 7420 events. 2912/7420 cut-off events. For 812/818 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 58861 event pairs, 2043 based on Foata normal form. 3/4750 useless extension candidates. Maximal degree in co-relation 13715. Up to 4970 conditions per place. [2025-03-09 01:31:52,662 INFO L140 encePairwiseOnDemand]: 306/312 looper letters, 300 selfloop transitions, 7 changer transitions 0/398 dead transitions. [2025-03-09 01:31:52,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 398 transitions, 1539 flow [2025-03-09 01:31:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 784 transitions. [2025-03-09 01:31:52,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5025641025641026 [2025-03-09 01:31:52,665 INFO L175 Difference]: Start difference. First operand has 233 places, 244 transitions, 587 flow. Second operand 5 states and 784 transitions. [2025-03-09 01:31:52,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 398 transitions, 1539 flow [2025-03-09 01:31:52,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 398 transitions, 1525 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:52,672 INFO L231 Difference]: Finished difference. Result has 238 places, 247 transitions, 623 flow [2025-03-09 01:31:52,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=623, PETRI_PLACES=238, PETRI_TRANSITIONS=247} [2025-03-09 01:31:52,673 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, -16 predicate places. [2025-03-09 01:31:52,673 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 247 transitions, 623 flow [2025-03-09 01:31:52,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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:31:52,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:52,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:52,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:31:52,673 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:52,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1012040539, now seen corresponding path program 1 times [2025-03-09 01:31:52,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:52,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101906058] [2025-03-09 01:31:52,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:52,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:31:52,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:31:52,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:52,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:53,057 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:31:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101906058] [2025-03-09 01:31:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101906058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:53,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:53,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:31:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474911760] [2025-03-09 01:31:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:53,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:31:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:53,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:31:53,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:31:53,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 312 [2025-03-09 01:31:53,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 247 transitions, 623 flow. Second operand has 9 states, 9 states have (on average 97.77777777777777) internal successors, (880), 9 states have internal predecessors, (880), 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:31:53,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:53,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 312 [2025-03-09 01:31:53,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:55,724 INFO L124 PetriNetUnfolderBase]: 5713/13666 cut-off events. [2025-03-09 01:31:55,724 INFO L125 PetriNetUnfolderBase]: For 2625/2636 co-relation queries the response was YES. [2025-03-09 01:31:55,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25879 conditions, 13666 events. 5713/13666 cut-off events. For 2625/2636 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 119503 event pairs, 2079 based on Foata normal form. 185/8603 useless extension candidates. Maximal degree in co-relation 25867. Up to 5061 conditions per place. [2025-03-09 01:31:55,765 INFO L140 encePairwiseOnDemand]: 299/312 looper letters, 701 selfloop transitions, 35 changer transitions 1/827 dead transitions. [2025-03-09 01:31:55,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 827 transitions, 3371 flow [2025-03-09 01:31:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:31:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 01:31:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2366 transitions. [2025-03-09 01:31:55,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44607843137254904 [2025-03-09 01:31:55,769 INFO L175 Difference]: Start difference. First operand has 238 places, 247 transitions, 623 flow. Second operand 17 states and 2366 transitions. [2025-03-09 01:31:55,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 827 transitions, 3371 flow [2025-03-09 01:31:55,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 827 transitions, 3365 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:55,781 INFO L231 Difference]: Finished difference. Result has 261 places, 268 transitions, 835 flow [2025-03-09 01:31:55,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=835, PETRI_PLACES=261, PETRI_TRANSITIONS=268} [2025-03-09 01:31:55,782 INFO L279 CegarLoopForPetriNet]: 254 programPoint places, 7 predicate places. [2025-03-09 01:31:55,782 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 268 transitions, 835 flow [2025-03-09 01:31:55,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.77777777777777) internal successors, (880), 9 states have internal predecessors, (880), 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:31:55,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:55,783 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:55,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:31:55,783 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-03-09 01:31:55,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1305611144, now seen corresponding path program 1 times [2025-03-09 01:31:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330416930] [2025-03-09 01:31:55,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:55,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:55,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:31:55,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:31:55,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:55,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:31:55,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:31:55,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:31:55,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:31:55,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:55,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:31:55,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:31:55,865 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:31:55,866 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (124 of 125 remaining) [2025-03-09 01:31:55,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 125 remaining) [2025-03-09 01:31:55,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 125 remaining) [2025-03-09 01:31:55,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (121 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK (118 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 125 remaining) [2025-03-09 01:31:55,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 125 remaining) [2025-03-09 01:31:55,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (93 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (86 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK (81 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 125 remaining) [2025-03-09 01:31:55,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (66 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (49 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (46 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 125 remaining) [2025-03-09 01:31:55,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 125 remaining) [2025-03-09 01:31:55,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 125 remaining) [2025-03-09 01:31:55,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 125 remaining) [2025-03-09 01:31:55,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:31:55,874 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:55,876 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:31:55,876 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 01:31:55,938 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:31:55,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 360 transitions, 736 flow [2025-03-09 01:31:55,993 INFO L124 PetriNetUnfolderBase]: 209/1014 cut-off events. [2025-03-09 01:31:55,993 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:31:55,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 1014 events. 209/1014 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5942 event pairs, 0 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 532. Up to 24 conditions per place. [2025-03-09 01:31:55,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 298 places, 360 transitions, 736 flow [2025-03-09 01:31:56,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 298 places, 360 transitions, 736 flow [2025-03-09 01:31:56,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:31:56,008 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;@3bfec53e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:31:56,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 145 error locations. [2025-03-09 01:31:56,010 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:31:56,010 INFO L124 PetriNetUnfolderBase]: 6/16 cut-off events. [2025-03-09 01:31:56,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:31:56,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:56,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:31:56,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 142 more)] === [2025-03-09 01:31:56,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash 74629064, now seen corresponding path program 1 times [2025-03-09 01:31:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:56,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128960707] [2025-03-09 01:31:56,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:56,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:31:56,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:31:56,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:56,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:56,019 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:31:56,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128960707] [2025-03-09 01:31:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128960707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:56,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:56,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:56,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526238982] [2025-03-09 01:31:56,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:56,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 01:31:56,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:56,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 01:31:56,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:31:56,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 360 [2025-03-09 01:31:56,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 360 transitions, 736 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:56,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:56,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 360 [2025-03-09 01:31:56,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:12,885 INFO L124 PetriNetUnfolderBase]: 154637/269365 cut-off events. [2025-03-09 01:32:12,885 INFO L125 PetriNetUnfolderBase]: For 230/235 co-relation queries the response was YES. [2025-03-09 01:32:13,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493714 conditions, 269365 events. 154637/269365 cut-off events. For 230/235 co-relation queries the response was YES. Maximal size of possible extension queue 3989. Compared 2687623 event pairs, 128404 based on Foata normal form. 16897/177317 useless extension candidates. Maximal degree in co-relation 464136. Up to 224211 conditions per place. [2025-03-09 01:32:14,362 INFO L140 encePairwiseOnDemand]: 301/360 looper letters, 179 selfloop transitions, 0 changer transitions 0/294 dead transitions. [2025-03-09 01:32:14,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 294 transitions, 962 flow [2025-03-09 01:32:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 01:32:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 01:32:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 468 transitions. [2025-03-09 01:32:14,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-09 01:32:14,364 INFO L175 Difference]: Start difference. First operand has 298 places, 360 transitions, 736 flow. Second operand 2 states and 468 transitions. [2025-03-09 01:32:14,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 294 transitions, 962 flow [2025-03-09 01:32:14,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 294 transitions, 962 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:32:14,367 INFO L231 Difference]: Finished difference. Result has 282 places, 294 transitions, 604 flow [2025-03-09 01:32:14,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=604, PETRI_PLACES=282, PETRI_TRANSITIONS=294} [2025-03-09 01:32:14,368 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, -16 predicate places. [2025-03-09 01:32:14,368 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 294 transitions, 604 flow [2025-03-09 01:32:14,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:14,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:14,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:32:14,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:32:14,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (and 142 more)] === [2025-03-09 01:32:14,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash 74628196, now seen corresponding path program 1 times [2025-03-09 01:32:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:14,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267368298] [2025-03-09 01:32:14,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:14,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:32:14,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:32:14,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:14,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:14,388 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:14,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:14,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267368298] [2025-03-09 01:32:14,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267368298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:32:14,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:32:14,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:32:14,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596860723] [2025-03-09 01:32:14,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:32:14,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:32:14,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:14,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:32:14,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:32:14,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 360 [2025-03-09 01:32:14,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 294 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:14,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 360 [2025-03-09 01:32:14,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand