./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:15:32,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:15:32,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:15:32,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:15:32,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:15:32,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:15:32,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:15:32,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:15:32,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:15:32,264 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:15:32,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:15:32,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:15:32,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:15:32,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:15:32,264 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:15:32,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:15:32,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:15:32,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:32,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:15:32,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:15:32,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:15:32,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:32,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:15:32,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:15:32,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:15:32,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:15:32,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:15:32,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:15:32,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:15:32,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:15:32,266 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe [2025-01-10 01:15:32,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:15:32,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:15:32,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:15:32,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:15:32,508 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:15:32,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-01-10 01:15:33,662 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4327ae8b/03e66b8e572d4fb9851b7977563d92a1/FLAGa5bf4c15b [2025-01-10 01:15:34,055 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:15:34,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-01-10 01:15:34,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4327ae8b/03e66b8e572d4fb9851b7977563d92a1/FLAGa5bf4c15b [2025-01-10 01:15:34,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c4327ae8b/03e66b8e572d4fb9851b7977563d92a1 [2025-01-10 01:15:34,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:15:34,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:15:34,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:15:34,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:15:34,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:15:34,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:15:34" (1/1) ... [2025-01-10 01:15:34,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfc6d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:34, skipping insertion in model container [2025-01-10 01:15:34,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:15:34" (1/1) ... [2025-01-10 01:15:34,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:15:35,545 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:35,548 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:35,549 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:35,552 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:35,553 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:35,689 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:15:35,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:15:35,700 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:15:35,806 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-01-10 01:15:35,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-01-10 01:15:35,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-01-10 01:15:35,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-01-10 01:15:35,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-01-10 01:15:35,810 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-01-10 01:15:35,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-01-10 01:15:35,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-01-10 01:15:35,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-01-10 01:15:35,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-01-10 01:15:35,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-01-10 01:15:35,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-01-10 01:15:35,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-01-10 01:15:35,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-01-10 01:15:35,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-01-10 01:15:35,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-01-10 01:15:35,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-01-10 01:15:35,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-01-10 01:15:35,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-01-10 01:15:35,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-01-10 01:15:35,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-01-10 01:15:35,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-01-10 01:15:35,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-01-10 01:15:35,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-01-10 01:15:35,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-01-10 01:15:35,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-01-10 01:15:35,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-01-10 01:15:35,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-01-10 01:15:35,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-01-10 01:15:35,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-01-10 01:15:35,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-01-10 01:15:35,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-01-10 01:15:35,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-01-10 01:15:35,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-01-10 01:15:35,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-01-10 01:15:35,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-01-10 01:15:35,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-01-10 01:15:35,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-01-10 01:15:35,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-01-10 01:15:35,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-01-10 01:15:35,820 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-01-10 01:15:35,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-01-10 01:15:35,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-01-10 01:15:35,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-01-10 01:15:35,823 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-01-10 01:15:35,823 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-01-10 01:15:35,823 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-01-10 01:15:35,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-01-10 01:15:35,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-01-10 01:15:35,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-01-10 01:15:35,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-01-10 01:15:35,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-01-10 01:15:35,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-01-10 01:15:35,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-01-10 01:15:35,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-01-10 01:15:35,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-01-10 01:15:35,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-01-10 01:15:35,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-01-10 01:15:35,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-01-10 01:15:35,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-01-10 01:15:35,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-01-10 01:15:35,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-01-10 01:15:35,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-01-10 01:15:35,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-01-10 01:15:35,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-01-10 01:15:35,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-01-10 01:15:35,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-01-10 01:15:35,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-01-10 01:15:35,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-01-10 01:15:35,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-01-10 01:15:35,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-01-10 01:15:35,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-01-10 01:15:35,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-01-10 01:15:35,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-01-10 01:15:35,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-01-10 01:15:35,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-01-10 01:15:35,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-01-10 01:15:35,838 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-01-10 01:15:35,838 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-01-10 01:15:35,838 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-01-10 01:15:35,838 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-01-10 01:15:35,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-01-10 01:15:35,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-01-10 01:15:35,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-01-10 01:15:35,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-01-10 01:15:35,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-01-10 01:15:35,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-01-10 01:15:35,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-01-10 01:15:35,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-01-10 01:15:35,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-01-10 01:15:35,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-01-10 01:15:35,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-01-10 01:15:35,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-01-10 01:15:35,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-01-10 01:15:35,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-01-10 01:15:35,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-01-10 01:15:35,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-01-10 01:15:35,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-01-10 01:15:35,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-01-10 01:15:35,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-01-10 01:15:35,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:15:36,069 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:15:36,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36 WrapperNode [2025-01-10 01:15:36,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:15:36,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:15:36,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:15:36,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:15:36,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,189 INFO L138 Inliner]: procedures = 914, calls = 957, calls flagged for inlining = 822, calls inlined = 64, statements flattened = 649 [2025-01-10 01:15:36,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:15:36,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:15:36,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:15:36,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:15:36,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,224 INFO L175 MemorySlicer]: Split 65 memory accesses to 5 slices as follows [2, 8, 2, 44, 9]. 68 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 4, 0, 6, 5]. The 20 writes are split as follows [0, 3, 1, 14, 2]. [2025-01-10 01:15:36,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,247 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:15:36,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:15:36,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:15:36,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:15:36,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (1/1) ... [2025-01-10 01:15:36,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:15:36,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:15:36,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:15:36,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:15:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:15:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:15:36,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 01:15:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 01:15:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:15:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:15:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:15:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 01:15:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 01:15:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:15:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-01-10 01:15:36,327 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-01-10 01:15:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 01:15:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 01:15:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 01:15:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-10 01:15:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-10 01:15:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:15:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:15:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:15:36,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 01:15:36,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 01:15:36,330 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:15:36,509 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:15:36,511 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:15:37,363 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:15:37,363 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:15:37,717 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:15:37,718 INFO L312 CfgBuilder]: Removed 20 assume(true) statements. [2025-01-10 01:15:37,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:15:37 BoogieIcfgContainer [2025-01-10 01:15:37,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:15:37,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:15:37,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:15:37,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:15:37,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:15:34" (1/3) ... [2025-01-10 01:15:37,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a93c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:15:37, skipping insertion in model container [2025-01-10 01:15:37,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:15:36" (2/3) ... [2025-01-10 01:15:37,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a93c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:15:37, skipping insertion in model container [2025-01-10 01:15:37,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:15:37" (3/3) ... [2025-01-10 01:15:37,724 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-01-10 01:15:37,734 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:15:37,735 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_mpmc_check_full.i that has 2 procedures, 258 locations, 1 initial locations, 23 loop locations, and 104 error locations. [2025-01-10 01:15:37,735 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:15:37,819 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 01:15:37,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 319 transitions, 645 flow [2025-01-10 01:15:37,977 INFO L124 PetriNetUnfolderBase]: 108/544 cut-off events. [2025-01-10 01:15:37,979 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:15:37,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 544 events. 108/544 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2502 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 272. Up to 6 conditions per place. [2025-01-10 01:15:37,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 319 transitions, 645 flow [2025-01-10 01:15:37,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 261 places, 319 transitions, 645 flow [2025-01-10 01:15:37,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:15:38,005 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;@15c04dc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:15:38,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2025-01-10 01:15:38,009 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:15:38,010 INFO L124 PetriNetUnfolderBase]: 6/16 cut-off events. [2025-01-10 01:15:38,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:15:38,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:38,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:15:38,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:38,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash 69604055, now seen corresponding path program 1 times [2025-01-10 01:15:38,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:38,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106805211] [2025-01-10 01:15:38,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:38,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:15:38,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:15:38,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:38,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:38,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:38,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106805211] [2025-01-10 01:15:38,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106805211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:38,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:38,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:38,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490723136] [2025-01-10 01:15:38,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:38,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:15:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:38,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:15:38,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:15:38,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 319 [2025-01-10 01:15:38,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 319 transitions, 645 flow. Second operand has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 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-01-10 01:15:38,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:38,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 319 [2025-01-10 01:15:38,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:39,004 INFO L124 PetriNetUnfolderBase]: 2858/7285 cut-off events. [2025-01-10 01:15:39,004 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-10 01:15:39,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12651 conditions, 7285 events. 2858/7285 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 57115 event pairs, 2277 based on Foata normal form. 800/5266 useless extension candidates. Maximal degree in co-relation 12314. Up to 5361 conditions per place. [2025-01-10 01:15:39,065 INFO L140 encePairwiseOnDemand]: 263/319 looper letters, 148 selfloop transitions, 0 changer transitions 0/256 dead transitions. [2025-01-10 01:15:39,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 256 transitions, 815 flow [2025-01-10 01:15:39,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:15:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 01:15:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 420 transitions. [2025-01-10 01:15:39,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.658307210031348 [2025-01-10 01:15:39,086 INFO L175 Difference]: Start difference. First operand has 261 places, 319 transitions, 645 flow. Second operand 2 states and 420 transitions. [2025-01-10 01:15:39,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 256 transitions, 815 flow [2025-01-10 01:15:39,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 256 transitions, 815 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:15:39,093 INFO L231 Difference]: Finished difference. Result has 247 places, 256 transitions, 519 flow [2025-01-10 01:15:39,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=519, PETRI_PLACES=247, PETRI_TRANSITIONS=256} [2025-01-10 01:15:39,097 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -14 predicate places. [2025-01-10 01:15:39,097 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 256 transitions, 519 flow [2025-01-10 01:15:39,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 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-01-10 01:15:39,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:39,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:15:39,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:15:39,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:39,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:39,098 INFO L85 PathProgramCache]: Analyzing trace with hash 69598829, now seen corresponding path program 1 times [2025-01-10 01:15:39,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:39,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882386992] [2025-01-10 01:15:39,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:39,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:39,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:15:39,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:15:39,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:39,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:39,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:39,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882386992] [2025-01-10 01:15:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882386992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:39,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:39,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:39,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128952996] [2025-01-10 01:15:39,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:39,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:39,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:39,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:39,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 319 [2025-01-10 01:15:39,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 256 transitions, 519 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-01-10 01:15:39,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:39,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 319 [2025-01-10 01:15:39,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:40,049 INFO L124 PetriNetUnfolderBase]: 2858/7282 cut-off events. [2025-01-10 01:15:40,049 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-10 01:15:40,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12648 conditions, 7282 events. 2858/7282 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 57116 event pairs, 2277 based on Foata normal form. 1/4464 useless extension candidates. Maximal degree in co-relation 12644. Up to 5342 conditions per place. [2025-01-10 01:15:40,079 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 145 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2025-01-10 01:15:40,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 253 transitions, 807 flow [2025-01-10 01:15:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2025-01-10 01:15:40,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49320794148380354 [2025-01-10 01:15:40,082 INFO L175 Difference]: Start difference. First operand has 247 places, 256 transitions, 519 flow. Second operand 3 states and 472 transitions. [2025-01-10 01:15:40,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 253 transitions, 807 flow [2025-01-10 01:15:40,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 253 transitions, 807 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:15:40,089 INFO L231 Difference]: Finished difference. Result has 246 places, 253 transitions, 517 flow [2025-01-10 01:15:40,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=246, PETRI_TRANSITIONS=253} [2025-01-10 01:15:40,091 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -15 predicate places. [2025-01-10 01:15:40,091 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 253 transitions, 517 flow [2025-01-10 01:15:40,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-01-10 01:15:40,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:40,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:15:40,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:15:40,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:40,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:40,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1828648986, now seen corresponding path program 1 times [2025-01-10 01:15:40,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:40,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097417505] [2025-01-10 01:15:40,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:40,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:40,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:15:40,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:15:40,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:40,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:40,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:40,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097417505] [2025-01-10 01:15:40,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097417505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:40,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:40,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:40,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588526198] [2025-01-10 01:15:40,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:40,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:40,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:40,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:40,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:40,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 319 [2025-01-10 01:15:40,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 253 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:40,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:40,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 319 [2025-01-10 01:15:40,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:40,936 INFO L124 PetriNetUnfolderBase]: 2858/7280 cut-off events. [2025-01-10 01:15:40,936 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-10 01:15:40,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12649 conditions, 7280 events. 2858/7280 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 57095 event pairs, 2277 based on Foata normal form. 1/4464 useless extension candidates. Maximal degree in co-relation 12644. Up to 5342 conditions per place. [2025-01-10 01:15:40,957 INFO L140 encePairwiseOnDemand]: 315/319 looper letters, 145 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2025-01-10 01:15:40,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 251 transitions, 807 flow [2025-01-10 01:15:40,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-01-10 01:15:40,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48798328108672934 [2025-01-10 01:15:40,959 INFO L175 Difference]: Start difference. First operand has 246 places, 253 transitions, 517 flow. Second operand 3 states and 467 transitions. [2025-01-10 01:15:40,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 251 transitions, 807 flow [2025-01-10 01:15:40,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 251 transitions, 803 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:40,962 INFO L231 Difference]: Finished difference. Result has 244 places, 251 transitions, 513 flow [2025-01-10 01:15:40,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=513, PETRI_PLACES=244, PETRI_TRANSITIONS=251} [2025-01-10 01:15:40,963 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -17 predicate places. [2025-01-10 01:15:40,963 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 251 transitions, 513 flow [2025-01-10 01:15:40,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:40,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:40,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:15:40,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:15:40,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:40,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1828648985, now seen corresponding path program 1 times [2025-01-10 01:15:40,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:40,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348875702] [2025-01-10 01:15:40,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:40,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:15:40,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:15:40,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:40,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:41,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:41,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348875702] [2025-01-10 01:15:41,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348875702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:41,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:41,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:15:41,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016053577] [2025-01-10 01:15:41,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:41,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:41,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:41,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:41,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:41,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 319 [2025-01-10 01:15:41,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 251 transitions, 513 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:41,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:41,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 319 [2025-01-10 01:15:41,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:41,720 INFO L124 PetriNetUnfolderBase]: 2858/7278 cut-off events. [2025-01-10 01:15:41,720 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-10 01:15:41,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12647 conditions, 7278 events. 2858/7278 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 57141 event pairs, 2277 based on Foata normal form. 1/4463 useless extension candidates. Maximal degree in co-relation 12642. Up to 5342 conditions per place. [2025-01-10 01:15:41,739 INFO L140 encePairwiseOnDemand]: 315/319 looper letters, 145 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2025-01-10 01:15:41,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 249 transitions, 803 flow [2025-01-10 01:15:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-01-10 01:15:41,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48798328108672934 [2025-01-10 01:15:41,740 INFO L175 Difference]: Start difference. First operand has 244 places, 251 transitions, 513 flow. Second operand 3 states and 467 transitions. [2025-01-10 01:15:41,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 249 transitions, 803 flow [2025-01-10 01:15:41,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 249 transitions, 799 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:41,744 INFO L231 Difference]: Finished difference. Result has 242 places, 249 transitions, 509 flow [2025-01-10 01:15:41,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=242, PETRI_TRANSITIONS=249} [2025-01-10 01:15:41,745 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -19 predicate places. [2025-01-10 01:15:41,745 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 249 transitions, 509 flow [2025-01-10 01:15:41,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:15:41,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:41,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:15:41,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:15:41,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:41,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1828651118, now seen corresponding path program 1 times [2025-01-10 01:15:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:41,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173649872] [2025-01-10 01:15:41,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:41,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:15:41,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:15:41,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:41,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:41,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:41,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173649872] [2025-01-10 01:15:41,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173649872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:41,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:41,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:41,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368367300] [2025-01-10 01:15:41,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:41,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:41,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:41,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:41,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:41,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 319 [2025-01-10 01:15:41,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 249 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-01-10 01:15:41,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:41,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 319 [2025-01-10 01:15:41,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:42,436 INFO L124 PetriNetUnfolderBase]: 2858/7275 cut-off events. [2025-01-10 01:15:42,436 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-10 01:15:42,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12643 conditions, 7275 events. 2858/7275 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 57108 event pairs, 2277 based on Foata normal form. 1/4460 useless extension candidates. Maximal degree in co-relation 12638. Up to 5342 conditions per place. [2025-01-10 01:15:42,459 INFO L140 encePairwiseOnDemand]: 316/319 looper letters, 144 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2025-01-10 01:15:42,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 246 transitions, 795 flow [2025-01-10 01:15:42,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-01-10 01:15:42,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49216300940438873 [2025-01-10 01:15:42,461 INFO L175 Difference]: Start difference. First operand has 242 places, 249 transitions, 509 flow. Second operand 3 states and 471 transitions. [2025-01-10 01:15:42,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 246 transitions, 795 flow [2025-01-10 01:15:42,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 246 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:42,464 INFO L231 Difference]: Finished difference. Result has 239 places, 246 transitions, 503 flow [2025-01-10 01:15:42,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, 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-01-10 01:15:42,465 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -22 predicate places. [2025-01-10 01:15:42,465 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 246 transitions, 503 flow [2025-01-10 01:15:42,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-01-10 01:15:42,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:42,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:42,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:15:42,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:42,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:42,466 INFO L85 PathProgramCache]: Analyzing trace with hash -689978397, now seen corresponding path program 1 times [2025-01-10 01:15:42,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:42,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839899970] [2025-01-10 01:15:42,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:42,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:42,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:15:42,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:15:42,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:42,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:42,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:42,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839899970] [2025-01-10 01:15:42,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839899970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:42,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:42,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:42,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266661912] [2025-01-10 01:15:42,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:42,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:42,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:42,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:42,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:42,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 319 [2025-01-10 01:15:42,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 246 transitions, 503 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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-01-10 01:15:42,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:42,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 319 [2025-01-10 01:15:42,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:43,388 INFO L124 PetriNetUnfolderBase]: 2858/7274 cut-off events. [2025-01-10 01:15:43,389 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-10 01:15:43,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12642 conditions, 7274 events. 2858/7274 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 57167 event pairs, 2199 based on Foata normal form. 0/4462 useless extension candidates. Maximal degree in co-relation 12637. Up to 5174 conditions per place. [2025-01-10 01:15:43,417 INFO L140 encePairwiseOnDemand]: 305/319 looper letters, 165 selfloop transitions, 10 changer transitions 0/274 dead transitions. [2025-01-10 01:15:43,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 274 transitions, 909 flow [2025-01-10 01:15:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:15:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:15:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2025-01-10 01:15:43,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4413793103448276 [2025-01-10 01:15:43,423 INFO L175 Difference]: Start difference. First operand has 239 places, 246 transitions, 503 flow. Second operand 5 states and 704 transitions. [2025-01-10 01:15:43,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 274 transitions, 909 flow [2025-01-10 01:15:43,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 274 transitions, 905 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:43,430 INFO L231 Difference]: Finished difference. Result has 238 places, 246 transitions, 534 flow [2025-01-10 01:15:43,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=534, PETRI_PLACES=238, PETRI_TRANSITIONS=246} [2025-01-10 01:15:43,432 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -23 predicate places. [2025-01-10 01:15:43,432 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 246 transitions, 534 flow [2025-01-10 01:15:43,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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-01-10 01:15:43,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:43,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:43,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:15:43,433 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:43,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:43,433 INFO L85 PathProgramCache]: Analyzing trace with hash -689978396, now seen corresponding path program 1 times [2025-01-10 01:15:43,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:43,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662327004] [2025-01-10 01:15:43,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:43,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:43,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:15:43,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:15:43,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:43,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:43,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:43,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662327004] [2025-01-10 01:15:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662327004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:43,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:43,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:43,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912436340] [2025-01-10 01:15:43,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:43,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:43,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:43,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:43,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 319 [2025-01-10 01:15:43,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 246 transitions, 534 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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-01-10 01:15:43,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:43,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 319 [2025-01-10 01:15:43,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:44,424 INFO L124 PetriNetUnfolderBase]: 2858/7273 cut-off events. [2025-01-10 01:15:44,424 INFO L125 PetriNetUnfolderBase]: For 174/176 co-relation queries the response was YES. [2025-01-10 01:15:44,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12988 conditions, 7273 events. 2858/7273 cut-off events. For 174/176 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 57190 event pairs, 2274 based on Foata normal form. 0/4635 useless extension candidates. Maximal degree in co-relation 12982. Up to 5345 conditions per place. [2025-01-10 01:15:44,438 INFO L140 encePairwiseOnDemand]: 314/319 looper letters, 141 selfloop transitions, 4 changer transitions 0/245 dead transitions. [2025-01-10 01:15:44,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 245 transitions, 822 flow [2025-01-10 01:15:44,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2025-01-10 01:15:44,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44357366771159873 [2025-01-10 01:15:44,440 INFO L175 Difference]: Start difference. First operand has 238 places, 246 transitions, 534 flow. Second operand 4 states and 566 transitions. [2025-01-10 01:15:44,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 245 transitions, 822 flow [2025-01-10 01:15:44,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 245 transitions, 809 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:44,447 INFO L231 Difference]: Finished difference. Result has 237 places, 245 transitions, 527 flow [2025-01-10 01:15:44,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=527, PETRI_PLACES=237, PETRI_TRANSITIONS=245} [2025-01-10 01:15:44,449 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -24 predicate places. [2025-01-10 01:15:44,449 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 245 transitions, 527 flow [2025-01-10 01:15:44,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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-01-10 01:15:44,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:44,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:44,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:15:44,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:44,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:44,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1644205560, now seen corresponding path program 1 times [2025-01-10 01:15:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:44,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118904580] [2025-01-10 01:15:44,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:44,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:15:44,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:15:44,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:44,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:44,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:44,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118904580] [2025-01-10 01:15:44,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118904580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:44,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:44,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:44,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873861557] [2025-01-10 01:15:44,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:44,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:44,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:44,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:44,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:44,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 319 [2025-01-10 01:15:44,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 245 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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-01-10 01:15:44,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:44,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 319 [2025-01-10 01:15:44,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:45,271 INFO L124 PetriNetUnfolderBase]: 2858/7272 cut-off events. [2025-01-10 01:15:45,271 INFO L125 PetriNetUnfolderBase]: For 90/92 co-relation queries the response was YES. [2025-01-10 01:15:45,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12900 conditions, 7272 events. 2858/7272 cut-off events. For 90/92 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 57188 event pairs, 2274 based on Foata normal form. 0/4635 useless extension candidates. Maximal degree in co-relation 12894. Up to 5345 conditions per place. [2025-01-10 01:15:45,286 INFO L140 encePairwiseOnDemand]: 314/319 looper letters, 140 selfloop transitions, 4 changer transitions 0/244 dead transitions. [2025-01-10 01:15:45,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 244 transitions, 813 flow [2025-01-10 01:15:45,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2025-01-10 01:15:45,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4427899686520376 [2025-01-10 01:15:45,288 INFO L175 Difference]: Start difference. First operand has 237 places, 245 transitions, 527 flow. Second operand 4 states and 565 transitions. [2025-01-10 01:15:45,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 244 transitions, 813 flow [2025-01-10 01:15:45,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 244 transitions, 805 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:45,294 INFO L231 Difference]: Finished difference. Result has 236 places, 244 transitions, 525 flow [2025-01-10 01:15:45,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=525, PETRI_PLACES=236, PETRI_TRANSITIONS=244} [2025-01-10 01:15:45,294 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -25 predicate places. [2025-01-10 01:15:45,294 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 244 transitions, 525 flow [2025-01-10 01:15:45,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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-01-10 01:15:45,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:45,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:45,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:15:45,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:45,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash 466492835, now seen corresponding path program 1 times [2025-01-10 01:15:45,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:45,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469655516] [2025-01-10 01:15:45,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:45,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:15:45,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:15:45,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:45,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:45,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:45,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469655516] [2025-01-10 01:15:45,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469655516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:45,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:45,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:45,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085712837] [2025-01-10 01:15:45,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:45,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:45,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:45,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:45,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:45,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 319 [2025-01-10 01:15:45,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 244 transitions, 525 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 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-01-10 01:15:45,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:45,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 319 [2025-01-10 01:15:45,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:46,380 INFO L124 PetriNetUnfolderBase]: 2858/7271 cut-off events. [2025-01-10 01:15:46,381 INFO L125 PetriNetUnfolderBase]: For 89/91 co-relation queries the response was YES. [2025-01-10 01:15:46,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12898 conditions, 7271 events. 2858/7271 cut-off events. For 89/91 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 57166 event pairs, 2274 based on Foata normal form. 0/4635 useless extension candidates. Maximal degree in co-relation 12892. Up to 5345 conditions per place. [2025-01-10 01:15:46,401 INFO L140 encePairwiseOnDemand]: 314/319 looper letters, 139 selfloop transitions, 4 changer transitions 0/243 dead transitions. [2025-01-10 01:15:46,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 243 transitions, 809 flow [2025-01-10 01:15:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2025-01-10 01:15:46,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44200626959247646 [2025-01-10 01:15:46,404 INFO L175 Difference]: Start difference. First operand has 236 places, 244 transitions, 525 flow. Second operand 4 states and 564 transitions. [2025-01-10 01:15:46,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 243 transitions, 809 flow [2025-01-10 01:15:46,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 243 transitions, 801 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:46,410 INFO L231 Difference]: Finished difference. Result has 235 places, 243 transitions, 523 flow [2025-01-10 01:15:46,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=523, PETRI_PLACES=235, PETRI_TRANSITIONS=243} [2025-01-10 01:15:46,412 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -26 predicate places. [2025-01-10 01:15:46,412 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 243 transitions, 523 flow [2025-01-10 01:15:46,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 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-01-10 01:15:46,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:46,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:46,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:15:46,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:46,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:46,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1623091873, now seen corresponding path program 1 times [2025-01-10 01:15:46,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:46,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864203322] [2025-01-10 01:15:46,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:46,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:15:46,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:15:46,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:46,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:46,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:46,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864203322] [2025-01-10 01:15:46,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864203322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:46,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:46,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:46,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016672869] [2025-01-10 01:15:46,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:46,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:46,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:46,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:46,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:46,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 319 [2025-01-10 01:15:46,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 243 transitions, 523 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 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-01-10 01:15:46,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:46,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 319 [2025-01-10 01:15:46,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:47,856 INFO L124 PetriNetUnfolderBase]: 2858/7270 cut-off events. [2025-01-10 01:15:47,856 INFO L125 PetriNetUnfolderBase]: For 89/91 co-relation queries the response was YES. [2025-01-10 01:15:47,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12896 conditions, 7270 events. 2858/7270 cut-off events. For 89/91 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 57190 event pairs, 2274 based on Foata normal form. 0/4635 useless extension candidates. Maximal degree in co-relation 12890. Up to 5345 conditions per place. [2025-01-10 01:15:47,875 INFO L140 encePairwiseOnDemand]: 315/319 looper letters, 139 selfloop transitions, 3 changer transitions 0/242 dead transitions. [2025-01-10 01:15:47,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 242 transitions, 805 flow [2025-01-10 01:15:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:47,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2025-01-10 01:15:47,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44122257053291536 [2025-01-10 01:15:47,880 INFO L175 Difference]: Start difference. First operand has 235 places, 243 transitions, 523 flow. Second operand 4 states and 563 transitions. [2025-01-10 01:15:47,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 242 transitions, 805 flow [2025-01-10 01:15:47,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 242 transitions, 797 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:47,885 INFO L231 Difference]: Finished difference. Result has 234 places, 242 transitions, 519 flow [2025-01-10 01:15:47,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=519, PETRI_PLACES=234, PETRI_TRANSITIONS=242} [2025-01-10 01:15:47,889 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -27 predicate places. [2025-01-10 01:15:47,889 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 242 transitions, 519 flow [2025-01-10 01:15:47,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 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-01-10 01:15:47,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:47,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:47,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:15:47,890 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:47,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:47,890 INFO L85 PathProgramCache]: Analyzing trace with hash 790418247, now seen corresponding path program 1 times [2025-01-10 01:15:47,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:47,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126480822] [2025-01-10 01:15:47,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:47,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:47,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:15:47,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:15:47,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:47,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:48,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:48,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126480822] [2025-01-10 01:15:48,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126480822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:48,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:48,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:48,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680935415] [2025-01-10 01:15:48,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:48,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:15:48,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:48,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:15:48,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:15:48,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 319 [2025-01-10 01:15:48,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 242 transitions, 519 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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-01-10 01:15:48,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:48,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 319 [2025-01-10 01:15:48,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:48,878 INFO L124 PetriNetUnfolderBase]: 2924/7559 cut-off events. [2025-01-10 01:15:48,878 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-01-10 01:15:48,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13312 conditions, 7559 events. 2924/7559 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 60566 event pairs, 2195 based on Foata normal form. 0/4836 useless extension candidates. Maximal degree in co-relation 13306. Up to 5472 conditions per place. [2025-01-10 01:15:48,898 INFO L140 encePairwiseOnDemand]: 312/319 looper letters, 146 selfloop transitions, 6 changer transitions 0/250 dead transitions. [2025-01-10 01:15:48,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 250 transitions, 839 flow [2025-01-10 01:15:48,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:15:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:15:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2025-01-10 01:15:48,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4498432601880878 [2025-01-10 01:15:48,900 INFO L175 Difference]: Start difference. First operand has 234 places, 242 transitions, 519 flow. Second operand 4 states and 574 transitions. [2025-01-10 01:15:48,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 250 transitions, 839 flow [2025-01-10 01:15:48,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 250 transitions, 833 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:15:48,908 INFO L231 Difference]: Finished difference. Result has 236 places, 247 transitions, 555 flow [2025-01-10 01:15:48,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=236, PETRI_TRANSITIONS=247} [2025-01-10 01:15:48,909 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -25 predicate places. [2025-01-10 01:15:48,912 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 247 transitions, 555 flow [2025-01-10 01:15:48,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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-01-10 01:15:48,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:48,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:48,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:15:48,913 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:48,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash 790418246, now seen corresponding path program 1 times [2025-01-10 01:15:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:48,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030561565] [2025-01-10 01:15:48,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:48,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:15:48,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:15:48,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:48,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:49,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:49,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030561565] [2025-01-10 01:15:49,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030561565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:49,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:49,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:49,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450792607] [2025-01-10 01:15:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:49,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:15:49,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:49,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:15:49,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:15:49,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 319 [2025-01-10 01:15:49,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 247 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-01-10 01:15:49,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:49,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 319 [2025-01-10 01:15:49,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:49,684 INFO L124 PetriNetUnfolderBase]: 2932/7650 cut-off events. [2025-01-10 01:15:49,685 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2025-01-10 01:15:49,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13718 conditions, 7650 events. 2932/7650 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 62416 event pairs, 2108 based on Foata normal form. 0/4955 useless extension candidates. Maximal degree in co-relation 13710. Up to 5170 conditions per place. [2025-01-10 01:15:49,706 INFO L140 encePairwiseOnDemand]: 312/319 looper letters, 273 selfloop transitions, 6 changer transitions 0/375 dead transitions. [2025-01-10 01:15:49,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 375 transitions, 1396 flow [2025-01-10 01:15:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:15:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:15:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2025-01-10 01:15:49,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6102403343782654 [2025-01-10 01:15:49,712 INFO L175 Difference]: Start difference. First operand has 236 places, 247 transitions, 555 flow. Second operand 3 states and 584 transitions. [2025-01-10 01:15:49,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 375 transitions, 1396 flow [2025-01-10 01:15:49,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 375 transitions, 1396 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:15:49,716 INFO L231 Difference]: Finished difference. Result has 240 places, 251 transitions, 601 flow [2025-01-10 01:15:49,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=240, PETRI_TRANSITIONS=251} [2025-01-10 01:15:49,717 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -21 predicate places. [2025-01-10 01:15:49,717 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 251 transitions, 601 flow [2025-01-10 01:15:49,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-01-10 01:15:49,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:49,717 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-01-10 01:15:49,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:15:49,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting writerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:49,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash -423984871, now seen corresponding path program 1 times [2025-01-10 01:15:49,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:49,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780384615] [2025-01-10 01:15:49,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:49,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:49,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:15:49,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:15:49,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:49,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:49,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780384615] [2025-01-10 01:15:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780384615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:15:49,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408383069] [2025-01-10 01:15:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:49,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:15:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:49,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:15:49,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:15:49,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 319 [2025-01-10 01:15:49,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 251 transitions, 601 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 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-01-10 01:15:49,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:49,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 319 [2025-01-10 01:15:49,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:50,728 INFO L124 PetriNetUnfolderBase]: 2912/7656 cut-off events. [2025-01-10 01:15:50,728 INFO L125 PetriNetUnfolderBase]: For 811/814 co-relation queries the response was YES. [2025-01-10 01:15:50,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13962 conditions, 7656 events. 2912/7656 cut-off events. For 811/814 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 62140 event pairs, 2066 based on Foata normal form. 3/4968 useless extension candidates. Maximal degree in co-relation 13952. Up to 4970 conditions per place. [2025-01-10 01:15:50,750 INFO L140 encePairwiseOnDemand]: 313/319 looper letters, 300 selfloop transitions, 7 changer transitions 0/405 dead transitions. [2025-01-10 01:15:50,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 405 transitions, 1553 flow [2025-01-10 01:15:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:15:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:15:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 819 transitions. [2025-01-10 01:15:50,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5134796238244514 [2025-01-10 01:15:50,753 INFO L175 Difference]: Start difference. First operand has 240 places, 251 transitions, 601 flow. Second operand 5 states and 819 transitions. [2025-01-10 01:15:50,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 405 transitions, 1553 flow [2025-01-10 01:15:50,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 405 transitions, 1539 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:15:50,760 INFO L231 Difference]: Finished difference. Result has 245 places, 254 transitions, 637 flow [2025-01-10 01:15:50,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=637, PETRI_PLACES=245, PETRI_TRANSITIONS=254} [2025-01-10 01:15:50,760 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, -16 predicate places. [2025-01-10 01:15:50,760 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 254 transitions, 637 flow [2025-01-10 01:15:50,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 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-01-10 01:15:50,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:50,762 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-01-10 01:15:50,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:15:50,762 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting writerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:50,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:50,762 INFO L85 PathProgramCache]: Analyzing trace with hash -423984870, now seen corresponding path program 1 times [2025-01-10 01:15:50,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:50,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141036352] [2025-01-10 01:15:50,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:50,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:50,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:15:50,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:15:50,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:50,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:51,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:51,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141036352] [2025-01-10 01:15:51,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141036352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:51,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:51,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:15:51,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849513925] [2025-01-10 01:15:51,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:51,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:15:51,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:51,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:15:51,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:15:52,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 319 [2025-01-10 01:15:52,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 254 transitions, 637 flow. Second operand has 9 states, 9 states have (on average 104.77777777777777) internal successors, (943), 9 states have internal predecessors, (943), 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-01-10 01:15:52,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:52,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 319 [2025-01-10 01:15:52,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:15:54,404 INFO L124 PetriNetUnfolderBase]: 5713/14285 cut-off events. [2025-01-10 01:15:54,404 INFO L125 PetriNetUnfolderBase]: For 2574/2582 co-relation queries the response was YES. [2025-01-10 01:15:54,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26499 conditions, 14285 events. 5713/14285 cut-off events. For 2574/2582 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 126222 event pairs, 3598 based on Foata normal form. 184/9287 useless extension candidates. Maximal degree in co-relation 26487. Up to 5061 conditions per place. [2025-01-10 01:15:54,441 INFO L140 encePairwiseOnDemand]: 306/319 looper letters, 701 selfloop transitions, 35 changer transitions 1/834 dead transitions. [2025-01-10 01:15:54,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 834 transitions, 3385 flow [2025-01-10 01:15:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:15:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 01:15:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2485 transitions. [2025-01-10 01:15:54,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45823345011985983 [2025-01-10 01:15:54,458 INFO L175 Difference]: Start difference. First operand has 245 places, 254 transitions, 637 flow. Second operand 17 states and 2485 transitions. [2025-01-10 01:15:54,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 834 transitions, 3385 flow [2025-01-10 01:15:54,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 834 transitions, 3379 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:15:54,487 INFO L231 Difference]: Finished difference. Result has 268 places, 275 transitions, 849 flow [2025-01-10 01:15:54,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=319, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=849, PETRI_PLACES=268, PETRI_TRANSITIONS=275} [2025-01-10 01:15:54,492 INFO L279 CegarLoopForPetriNet]: 261 programPoint places, 7 predicate places. [2025-01-10 01:15:54,492 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 275 transitions, 849 flow [2025-01-10 01:15:54,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.77777777777777) internal successors, (943), 9 states have internal predecessors, (943), 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-01-10 01:15:54,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:54,496 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-01-10 01:15:54,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:15:54,496 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 122 more)] === [2025-01-10 01:15:54,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:54,496 INFO L85 PathProgramCache]: Analyzing trace with hash -260084990, now seen corresponding path program 1 times [2025-01-10 01:15:54,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:54,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835618848] [2025-01-10 01:15:54,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:54,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:54,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:15:54,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:15:54,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:54,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:15:54,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:15:54,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:15:54,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:15:54,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:54,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:15:54,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:15:54,590 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:15:54,591 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (124 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (121 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (118 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 125 remaining) [2025-01-10 01:15:54,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK (93 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (86 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (81 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK (66 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 125 remaining) [2025-01-10 01:15:54,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK (49 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (46 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 125 remaining) [2025-01-10 01:15:54,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 125 remaining) [2025-01-10 01:15:54,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 125 remaining) [2025-01-10 01:15:54,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:15:54,595 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:15:54,597 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:15:54,597 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 01:15:54,657 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:15:54,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 367 transitions, 750 flow [2025-01-10 01:15:54,706 INFO L124 PetriNetUnfolderBase]: 209/1042 cut-off events. [2025-01-10 01:15:54,707 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:15:54,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 1042 events. 209/1042 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6197 event pairs, 0 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 546. Up to 12 conditions per place. [2025-01-10 01:15:54,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 305 places, 367 transitions, 750 flow [2025-01-10 01:15:54,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 305 places, 367 transitions, 750 flow [2025-01-10 01:15:54,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:15:54,717 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;@15c04dc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:15:54,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 145 error locations. [2025-01-10 01:15:54,718 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:15:54,718 INFO L124 PetriNetUnfolderBase]: 6/16 cut-off events. [2025-01-10 01:15:54,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:15:54,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:15:54,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:15:54,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 142 more)] === [2025-01-10 01:15:54,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:15:54,719 INFO L85 PathProgramCache]: Analyzing trace with hash 80901783, now seen corresponding path program 1 times [2025-01-10 01:15:54,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:15:54,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159693153] [2025-01-10 01:15:54,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:15:54,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:15:54,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:15:54,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:15:54,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:15:54,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:15:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:15:54,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:15:54,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159693153] [2025-01-10 01:15:54,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159693153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:15:54,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:15:54,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:15:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292143073] [2025-01-10 01:15:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:15:54,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:15:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:15:54,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:15:54,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:15:54,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 367 [2025-01-10 01:15:54,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 367 transitions, 750 flow. Second operand has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 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-01-10 01:15:54,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:15:54,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 367 [2025-01-10 01:15:54,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:13,020 INFO L124 PetriNetUnfolderBase]: 154637/273967 cut-off events. [2025-01-10 01:16:13,020 INFO L125 PetriNetUnfolderBase]: For 230/235 co-relation queries the response was YES. [2025-01-10 01:16:13,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498316 conditions, 273967 events. 154637/273967 cut-off events. For 230/235 co-relation queries the response was YES. Maximal size of possible extension queue 4139. Compared 2793201 event pairs, 128404 based on Foata normal form. 22185/186907 useless extension candidates. Maximal degree in co-relation 468387. Up to 224211 conditions per place. [2025-01-10 01:16:14,285 INFO L140 encePairwiseOnDemand]: 308/367 looper letters, 179 selfloop transitions, 0 changer transitions 0/301 dead transitions. [2025-01-10 01:16:14,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 301 transitions, 976 flow [2025-01-10 01:16:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:16:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 01:16:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 482 transitions. [2025-01-10 01:16:14,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6566757493188011 [2025-01-10 01:16:14,291 INFO L175 Difference]: Start difference. First operand has 305 places, 367 transitions, 750 flow. Second operand 2 states and 482 transitions. [2025-01-10 01:16:14,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 301 transitions, 976 flow [2025-01-10 01:16:14,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 301 transitions, 976 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:16:14,298 INFO L231 Difference]: Finished difference. Result has 289 places, 301 transitions, 618 flow [2025-01-10 01:16:14,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=367, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=618, PETRI_PLACES=289, PETRI_TRANSITIONS=301} [2025-01-10 01:16:14,299 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -16 predicate places. [2025-01-10 01:16:14,299 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 301 transitions, 618 flow [2025-01-10 01:16:14,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 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-01-10 01:16:14,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:14,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:16:14,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:16:14,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 142 more)] === [2025-01-10 01:16:14,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash 80896557, now seen corresponding path program 1 times [2025-01-10 01:16:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:14,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032475420] [2025-01-10 01:16:14,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:14,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:14,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:16:14,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:16:14,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:14,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:14,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032475420] [2025-01-10 01:16:14,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032475420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:14,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:14,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:14,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748919929] [2025-01-10 01:16:14,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:14,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:14,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:14,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:14,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:14,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 367 [2025-01-10 01:16:14,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 301 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-01-10 01:16:14,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:14,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 367 [2025-01-10 01:16:14,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand