./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:29:37,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:29:37,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:29:37,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:29:37,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:29:37,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:29:37,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:29:37,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:29:37,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:29:37,930 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:29:37,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:29:37,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:29:37,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:29:37,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:29:37,932 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:29:37,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:29:37,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:29:37,932 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:29:37,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:29:37,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:29:37,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:29:37,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:29:37,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:29:37,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:29:37,933 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:29:37,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:29:37,933 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:29:37,933 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:29:37,933 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:29:37,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:29:37,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:29:37,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:29:37,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:29:37,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:29:37,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:29:37,934 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:29:37,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:29:37,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:29:37,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:29:37,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:29:37,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:29:37,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:29:37,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:29:37,935 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe [2025-03-04 02:29:38,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:29:38,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:29:38,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:29:38,161 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:29:38,162 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:29:38,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-03-04 02:29:39,329 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d81f64a1/b5fd411bfd4944c0b05b2a87a2b1000a/FLAG94464226f [2025-03-04 02:29:39,703 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:29:39,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-03-04 02:29:39,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d81f64a1/b5fd411bfd4944c0b05b2a87a2b1000a/FLAG94464226f [2025-03-04 02:29:39,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d81f64a1/b5fd411bfd4944c0b05b2a87a2b1000a [2025-03-04 02:29:39,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:29:39,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:29:39,759 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:29:39,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:29:39,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:29:39,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:29:39" (1/1) ... [2025-03-04 02:29:39,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f1e748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:39, skipping insertion in model container [2025-03-04 02:29:39,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:29:39" (1/1) ... [2025-03-04 02:29:39,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:29:41,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-03-04 02:29:41,196 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-03-04 02:29:41,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-03-04 02:29:41,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-03-04 02:29:41,229 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-03-04 02:29:41,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-03-04 02:29:41,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-03-04 02:29:41,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:29:41,238 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:29:41,343 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-03-04 02:29:41,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-03-04 02:29:41,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-03-04 02:29:41,346 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-03-04 02:29:41,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-03-04 02:29:41,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-03-04 02:29:41,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-03-04 02:29:41,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-03-04 02:29:41,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-03-04 02:29:41,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-03-04 02:29:41,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-03-04 02:29:41,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-03-04 02:29:41,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-03-04 02:29:41,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-03-04 02:29:41,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-03-04 02:29:41,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-03-04 02:29:41,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-03-04 02:29:41,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-03-04 02:29:41,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-03-04 02:29:41,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-03-04 02:29:41,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-03-04 02:29:41,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-03-04 02:29:41,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-03-04 02:29:41,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-03-04 02:29:41,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-03-04 02:29:41,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-03-04 02:29:41,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-03-04 02:29:41,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-03-04 02:29:41,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-03-04 02:29:41,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-03-04 02:29:41,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-03-04 02:29:41,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-03-04 02:29:41,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-03-04 02:29:41,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-03-04 02:29:41,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-03-04 02:29:41,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-03-04 02:29:41,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-03-04 02:29:41,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-03-04 02:29:41,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-03-04 02:29:41,358 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-03-04 02:29:41,359 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-03-04 02:29:41,359 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-03-04 02:29:41,359 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-03-04 02:29:41,359 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-03-04 02:29:41,360 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-03-04 02:29:41,360 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-03-04 02:29:41,360 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-03-04 02:29:41,360 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-03-04 02:29:41,360 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-03-04 02:29:41,361 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-03-04 02:29:41,361 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-03-04 02:29:41,361 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-03-04 02:29:41,361 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-03-04 02:29:41,361 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-03-04 02:29:41,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-03-04 02:29:41,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-03-04 02:29:41,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-03-04 02:29:41,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-03-04 02:29:41,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-03-04 02:29:41,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-03-04 02:29:41,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-03-04 02:29:41,365 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-03-04 02:29:41,365 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-03-04 02:29:41,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-03-04 02:29:41,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-03-04 02:29:41,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-03-04 02:29:41,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-03-04 02:29:41,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-03-04 02:29:41,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-03-04 02:29:41,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-03-04 02:29:41,369 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-03-04 02:29:41,370 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-03-04 02:29:41,370 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-03-04 02:29:41,370 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-03-04 02:29:41,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-03-04 02:29:41,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-03-04 02:29:41,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-03-04 02:29:41,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-03-04 02:29:41,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-03-04 02:29:41,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-03-04 02:29:41,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-03-04 02:29:41,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-03-04 02:29:41,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-03-04 02:29:41,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-03-04 02:29:41,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-03-04 02:29:41,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-03-04 02:29:41,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-03-04 02:29:41,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-03-04 02:29:41,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-03-04 02:29:41,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-03-04 02:29:41,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-03-04 02:29:41,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-03-04 02:29:41,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-03-04 02:29:41,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-03-04 02:29:41,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-03-04 02:29:41,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-03-04 02:29:41,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-03-04 02:29:41,377 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-03-04 02:29:41,377 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-03-04 02:29:41,377 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-03-04 02:29:41,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-03-04 02:29:41,413 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-03-04 02:29:41,422 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-03-04 02:29:41,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-03-04 02:29:41,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-03-04 02:29:41,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-03-04 02:29:41,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-03-04 02:29:41,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:29:41,607 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:29:41,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41 WrapperNode [2025-03-04 02:29:41,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:29:41,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:29:41,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:29:41,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:29:41,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (1/1) ... [2025-03-04 02:29:41,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (1/1) ... [2025-03-04 02:29:41,707 INFO L138 Inliner]: procedures = 914, calls = 950, calls flagged for inlining = 815, calls inlined = 57, statements flattened = 628 [2025-03-04 02:29:41,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:29:41,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:29:41,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:29:41,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:29:41,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (1/1) ... [2025-03-04 02:29:41,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (1/1) ... [2025-03-04 02:29:41,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (1/1) ... [2025-03-04 02:29:41,756 INFO L175 MemorySlicer]: Split 65 memory accesses to 5 slices as follows [2, 2, 8, 44, 9]. 68 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 0, 4, 6, 5]. The 20 writes are split as follows [0, 1, 3, 14, 2]. [2025-03-04 02:29:41,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (1/1) ... [2025-03-04 02:29:41,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (1/1) ... [2025-03-04 02:29:41,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (1/1) ... [2025-03-04 02:29:41,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (1/1) ... [2025-03-04 02:29:41,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (1/1) ... [2025-03-04 02:29:41,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (1/1) ... [2025-03-04 02:29:41,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:29:41,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:29:41,794 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:29:41,794 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:29:41,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (1/1) ... [2025-03-04 02:29:41,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:29:41,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:29:41,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:29:41,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:29:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:29:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:29:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:29:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:29:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 02:29:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:29:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:29:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:29:41,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:29:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:29:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:29:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 02:29:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:29:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-03-04 02:29:41,840 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-03-04 02:29:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:29:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:29:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:29:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:29:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 02:29:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:29:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:29:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:29:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:29:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 02:29:41,842 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:29:42,000 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:29:42,001 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:29:42,562 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-03-04 02:29:42,562 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-9: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-03-04 02:29:42,562 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-18: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-03-04 02:29:42,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-04 02:29:42,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-04 02:29:42,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-04 02:29:42,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-9: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-04 02:29:42,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043: havoc main_~#r~0#1.base, main_~#r~0#1.offset; [2025-03-04 02:29:42,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-1: SUMMARY for call ULTIMATE.dealloc(main_~#r~0#1.base, main_~#r~0#1.offset); srcloc: null [2025-03-04 02:29:42,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-04 02:29:42,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-9: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-04 02:29:42,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-18: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-04 02:29:42,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-27: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-04 02:29:42,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808: havoc vatomic32_await_eq_rlx_#t~ret172#1; [2025-03-04 02:29:42,665 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-03-04 02:29:42,665 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-04 02:29:42,665 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6019: havoc ~#xbo~0#1.base, ~#xbo~0#1.offset; [2025-03-04 02:29:42,665 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6019-1: SUMMARY for call ULTIMATE.dealloc(~#xbo~0#1.base, ~#xbo~0#1.offset); srcloc: null [2025-03-04 02:29:42,665 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-04 02:29:42,666 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:29:42,666 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:29:43,027 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:29:43,027 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:29:43,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:29:43 BoogieIcfgContainer [2025-03-04 02:29:43,027 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:29:43,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:29:43,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:29:43,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:29:43,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:29:39" (1/3) ... [2025-03-04 02:29:43,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba4b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:29:43, skipping insertion in model container [2025-03-04 02:29:43,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:29:41" (2/3) ... [2025-03-04 02:29:43,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba4b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:29:43, skipping insertion in model container [2025-03-04 02:29:43,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:29:43" (3/3) ... [2025-03-04 02:29:43,034 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-03-04 02:29:43,049 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:29:43,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_mpmc_check_full.i that has 2 procedures, 118 locations, 1 initial locations, 16 loop locations, and 7 error locations. [2025-03-04 02:29:43,050 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:29:43,130 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 02:29:43,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 172 transitions, 351 flow [2025-03-04 02:29:43,218 INFO L124 PetriNetUnfolderBase]: 96/294 cut-off events. [2025-03-04 02:29:43,222 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:29:43,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 294 events. 96/294 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 837 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 146. Up to 12 conditions per place. [2025-03-04 02:29:43,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 172 transitions, 351 flow [2025-03-04 02:29:43,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 172 transitions, 351 flow [2025-03-04 02:29:43,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:29:43,256 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=LoopHeads, 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;@12aa144b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:29:43,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 02:29:43,260 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:29:43,260 INFO L124 PetriNetUnfolderBase]: 3/7 cut-off events. [2025-03-04 02:29:43,260 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:29:43,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:43,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 02:29:43,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:29:43,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1743798, now seen corresponding path program 1 times [2025-03-04 02:29:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:43,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197144669] [2025-03-04 02:29:43,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:43,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 02:29:43,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 02:29:43,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:43,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:43,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:43,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197144669] [2025-03-04 02:29:43,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197144669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:43,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:43,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:29:43,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381531556] [2025-03-04 02:29:43,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:43,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:43,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:43,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:43,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:43,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 172 [2025-03-04 02:29:43,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 172 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:43,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:43,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 172 [2025-03-04 02:29:43,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:44,003 INFO L124 PetriNetUnfolderBase]: 1229/2613 cut-off events. [2025-03-04 02:29:44,005 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:29:44,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4847 conditions, 2613 events. 1229/2613 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 13754 event pairs, 864 based on Foata normal form. 384/2523 useless extension candidates. Maximal degree in co-relation 4659. Up to 2220 conditions per place. [2025-03-04 02:29:44,022 INFO L140 encePairwiseOnDemand]: 129/172 looper letters, 91 selfloop transitions, 2 changer transitions 5/129 dead transitions. [2025-03-04 02:29:44,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 129 transitions, 455 flow [2025-03-04 02:29:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2025-03-04 02:29:44,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46705426356589147 [2025-03-04 02:29:44,034 INFO L175 Difference]: Start difference. First operand has 121 places, 172 transitions, 351 flow. Second operand 3 states and 241 transitions. [2025-03-04 02:29:44,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 129 transitions, 455 flow [2025-03-04 02:29:44,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 129 transitions, 455 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:29:44,041 INFO L231 Difference]: Finished difference. Result has 121 places, 124 transitions, 259 flow [2025-03-04 02:29:44,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=121, PETRI_TRANSITIONS=124} [2025-03-04 02:29:44,046 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 0 predicate places. [2025-03-04 02:29:44,047 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 124 transitions, 259 flow [2025-03-04 02:29:44,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:44,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:44,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 02:29:44,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:29:44,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:29:44,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1675962557, now seen corresponding path program 1 times [2025-03-04 02:29:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:44,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796355533] [2025-03-04 02:29:44,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:44,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 02:29:44,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 02:29:44,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:44,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796355533] [2025-03-04 02:29:44,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796355533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:44,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:44,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:29:44,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824253953] [2025-03-04 02:29:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:44,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:44,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:44,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:44,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 172 [2025-03-04 02:29:44,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 124 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:44,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:44,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 172 [2025-03-04 02:29:44,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:44,482 INFO L124 PetriNetUnfolderBase]: 1189/2481 cut-off events. [2025-03-04 02:29:44,483 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:29:44,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4642 conditions, 2481 events. 1189/2481 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12910 event pairs, 832 based on Foata normal form. 1/2017 useless extension candidates. Maximal degree in co-relation 4612. Up to 2144 conditions per place. [2025-03-04 02:29:44,491 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 91 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2025-03-04 02:29:44,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 122 transitions, 441 flow [2025-03-04 02:29:44,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2025-03-04 02:29:44,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3856589147286822 [2025-03-04 02:29:44,492 INFO L175 Difference]: Start difference. First operand has 121 places, 124 transitions, 259 flow. Second operand 3 states and 199 transitions. [2025-03-04 02:29:44,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 122 transitions, 441 flow [2025-03-04 02:29:44,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 122 transitions, 437 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:29:44,494 INFO L231 Difference]: Finished difference. Result has 114 places, 122 transitions, 255 flow [2025-03-04 02:29:44,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=114, PETRI_TRANSITIONS=122} [2025-03-04 02:29:44,495 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -7 predicate places. [2025-03-04 02:29:44,495 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 122 transitions, 255 flow [2025-03-04 02:29:44,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:44,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:44,495 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:44,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:29:44,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:29:44,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash -98404303, now seen corresponding path program 1 times [2025-03-04 02:29:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:44,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550321169] [2025-03-04 02:29:44,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:44,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:44,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:29:44,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:29:44,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:44,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:29:44,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:29:44,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:29:44,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:29:44,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:44,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:29:44,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:29:44,672 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:29:44,673 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-04 02:29:44,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-04 02:29:44,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-03-04 02:29:44,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-04 02:29:44,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-04 02:29:44,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-04 02:29:44,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-03-04 02:29:44,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-03-04 02:29:44,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:29:44,675 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 02:29:44,677 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:29:44,677 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 02:29:44,752 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:29:44,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 195 transitions, 406 flow [2025-03-04 02:29:44,799 INFO L124 PetriNetUnfolderBase]: 187/564 cut-off events. [2025-03-04 02:29:44,799 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 02:29:44,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 564 events. 187/564 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2231 event pairs, 0 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 296. Up to 24 conditions per place. [2025-03-04 02:29:44,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 195 transitions, 406 flow [2025-03-04 02:29:44,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 195 transitions, 406 flow [2025-03-04 02:29:44,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:29:44,806 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=LoopHeads, 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;@12aa144b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:29:44,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 02:29:44,807 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:29:44,807 INFO L124 PetriNetUnfolderBase]: 3/7 cut-off events. [2025-03-04 02:29:44,807 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:29:44,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:44,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 02:29:44,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:29:44,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1937433, now seen corresponding path program 1 times [2025-03-04 02:29:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:44,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507520042] [2025-03-04 02:29:44,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:44,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 02:29:44,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 02:29:44,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:44,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:44,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:44,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507520042] [2025-03-04 02:29:44,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507520042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:44,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:44,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:29:44,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110496599] [2025-03-04 02:29:44,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:44,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:44,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:44,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:44,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:44,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 195 [2025-03-04 02:29:44,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 195 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:44,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:44,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 195 [2025-03-04 02:29:44,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:49,481 INFO L124 PetriNetUnfolderBase]: 41903/65173 cut-off events. [2025-03-04 02:29:49,482 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-03-04 02:29:49,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124981 conditions, 65173 events. 41903/65173 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 441355 event pairs, 31376 based on Foata normal form. 6898/59958 useless extension candidates. Maximal degree in co-relation 96020. Up to 59707 conditions per place. [2025-03-04 02:29:49,706 INFO L140 encePairwiseOnDemand]: 151/195 looper letters, 113 selfloop transitions, 2 changer transitions 5/151 dead transitions. [2025-03-04 02:29:49,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 151 transitions, 552 flow [2025-03-04 02:29:49,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2025-03-04 02:29:49,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4512820512820513 [2025-03-04 02:29:49,708 INFO L175 Difference]: Start difference. First operand has 140 places, 195 transitions, 406 flow. Second operand 3 states and 264 transitions. [2025-03-04 02:29:49,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 151 transitions, 552 flow [2025-03-04 02:29:49,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 151 transitions, 552 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:29:49,711 INFO L231 Difference]: Finished difference. Result has 140 places, 146 transitions, 312 flow [2025-03-04 02:29:49,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=140, PETRI_TRANSITIONS=146} [2025-03-04 02:29:49,714 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 0 predicate places. [2025-03-04 02:29:49,714 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 146 transitions, 312 flow [2025-03-04 02:29:49,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:49,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:49,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 02:29:49,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:29:49,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:29:49,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:49,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1862052032, now seen corresponding path program 1 times [2025-03-04 02:29:49,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:49,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084810919] [2025-03-04 02:29:49,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:49,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:49,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 02:29:49,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 02:29:49,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:49,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:49,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:49,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084810919] [2025-03-04 02:29:49,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084810919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:49,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:49,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:29:49,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919032807] [2025-03-04 02:29:49,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:49,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:49,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:49,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:49,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:49,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 195 [2025-03-04 02:29:49,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 146 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:49,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:49,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 195 [2025-03-04 02:29:49,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:53,854 INFO L124 PetriNetUnfolderBase]: 40463/62111 cut-off events. [2025-03-04 02:29:53,854 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2025-03-04 02:29:53,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119834 conditions, 62111 events. 40463/62111 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 411574 event pairs, 30224 based on Foata normal form. 1/50288 useless extension candidates. Maximal degree in co-relation 119803. Up to 57619 conditions per place. [2025-03-04 02:29:54,116 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 113 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-03-04 02:29:54,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 144 transitions, 538 flow [2025-03-04 02:29:54,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:29:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:29:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2025-03-04 02:29:54,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2025-03-04 02:29:54,121 INFO L175 Difference]: Start difference. First operand has 140 places, 146 transitions, 312 flow. Second operand 3 states and 221 transitions. [2025-03-04 02:29:54,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 144 transitions, 538 flow [2025-03-04 02:29:54,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 144 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:29:54,126 INFO L231 Difference]: Finished difference. Result has 133 places, 144 transitions, 308 flow [2025-03-04 02:29:54,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=133, PETRI_TRANSITIONS=144} [2025-03-04 02:29:54,127 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, -7 predicate places. [2025-03-04 02:29:54,127 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 144 transitions, 308 flow [2025-03-04 02:29:54,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:54,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:54,127 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:54,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:29:54,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:29:54,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:54,128 INFO L85 PathProgramCache]: Analyzing trace with hash 713688723, now seen corresponding path program 1 times [2025-03-04 02:29:54,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:54,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485479870] [2025-03-04 02:29:54,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:54,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:29:54,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:29:54,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:54,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:54,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:54,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485479870] [2025-03-04 02:29:54,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485479870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:54,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:54,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:29:54,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12666179] [2025-03-04 02:29:54,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:54,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:29:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:54,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:29:54,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:29:54,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-04 02:29:54,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 144 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:54,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:54,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-04 02:29:54,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:29:59,006 INFO L124 PetriNetUnfolderBase]: 39765/64420 cut-off events. [2025-03-04 02:29:59,006 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-03-04 02:29:59,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121156 conditions, 64420 events. 39765/64420 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 475350 event pairs, 1 based on Foata normal form. 0/52392 useless extension candidates. Maximal degree in co-relation 121125. Up to 54878 conditions per place. [2025-03-04 02:29:59,200 INFO L140 encePairwiseOnDemand]: 191/195 looper letters, 213 selfloop transitions, 4 changer transitions 0/245 dead transitions. [2025-03-04 02:29:59,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 245 transitions, 942 flow [2025-03-04 02:29:59,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:29:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:29:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 400 transitions. [2025-03-04 02:29:59,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2025-03-04 02:29:59,202 INFO L175 Difference]: Start difference. First operand has 133 places, 144 transitions, 308 flow. Second operand 5 states and 400 transitions. [2025-03-04 02:29:59,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 245 transitions, 942 flow [2025-03-04 02:29:59,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 245 transitions, 934 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:29:59,208 INFO L231 Difference]: Finished difference. Result has 133 places, 144 transitions, 310 flow [2025-03-04 02:29:59,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=133, PETRI_TRANSITIONS=144} [2025-03-04 02:29:59,210 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, -7 predicate places. [2025-03-04 02:29:59,211 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 144 transitions, 310 flow [2025-03-04 02:29:59,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:59,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:29:59,212 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:29:59,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:29:59,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:29:59,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:29:59,212 INFO L85 PathProgramCache]: Analyzing trace with hash -620097678, now seen corresponding path program 1 times [2025-03-04 02:29:59,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:29:59,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970536504] [2025-03-04 02:29:59,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:29:59,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:29:59,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:29:59,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:29:59,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:29:59,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:29:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:29:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:29:59,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970536504] [2025-03-04 02:29:59,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970536504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:29:59,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:29:59,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:29:59,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878294235] [2025-03-04 02:29:59,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:29:59,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:29:59,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:29:59,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:29:59,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:29:59,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-04 02:29:59,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 144 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:29:59,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:29:59,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-04 02:29:59,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:00,180 INFO L124 PetriNetUnfolderBase]: 4813/8660 cut-off events. [2025-03-04 02:30:00,181 INFO L125 PetriNetUnfolderBase]: For 1207/1207 co-relation queries the response was YES. [2025-03-04 02:30:00,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17438 conditions, 8660 events. 4813/8660 cut-off events. For 1207/1207 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 51835 event pairs, 2448 based on Foata normal form. 0/7206 useless extension candidates. Maximal degree in co-relation 10416. Up to 5805 conditions per place. [2025-03-04 02:30:00,205 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 158 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-03-04 02:30:00,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 188 transitions, 722 flow [2025-03-04 02:30:00,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:30:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:30:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2025-03-04 02:30:00,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4581196581196581 [2025-03-04 02:30:00,207 INFO L175 Difference]: Start difference. First operand has 133 places, 144 transitions, 310 flow. Second operand 3 states and 268 transitions. [2025-03-04 02:30:00,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 188 transitions, 722 flow [2025-03-04 02:30:00,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 188 transitions, 720 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:30:00,211 INFO L231 Difference]: Finished difference. Result has 135 places, 145 transitions, 320 flow [2025-03-04 02:30:00,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=135, PETRI_TRANSITIONS=145} [2025-03-04 02:30:00,212 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, -5 predicate places. [2025-03-04 02:30:00,212 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 145 transitions, 320 flow [2025-03-04 02:30:00,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:00,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:00,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:00,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:30:00,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:30:00,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 37787147, now seen corresponding path program 1 times [2025-03-04 02:30:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550300804] [2025-03-04 02:30:00,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:00,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 02:30:00,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 02:30:00,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:00,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:00,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550300804] [2025-03-04 02:30:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550300804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:00,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:00,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:30:00,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525342465] [2025-03-04 02:30:00,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:00,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:30:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:00,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:30:00,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:30:00,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-04 02:30:00,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 145 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:00,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:00,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-04 02:30:00,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:01,506 INFO L124 PetriNetUnfolderBase]: 8074/13715 cut-off events. [2025-03-04 02:30:01,506 INFO L125 PetriNetUnfolderBase]: For 5089/5089 co-relation queries the response was YES. [2025-03-04 02:30:01,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28559 conditions, 13715 events. 8074/13715 cut-off events. For 5089/5089 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 82061 event pairs, 3879 based on Foata normal form. 0/11569 useless extension candidates. Maximal degree in co-relation 13592. Up to 7817 conditions per place. [2025-03-04 02:30:01,548 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 217 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2025-03-04 02:30:01,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 247 transitions, 983 flow [2025-03-04 02:30:01,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:30:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:30:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2025-03-04 02:30:01,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 02:30:01,549 INFO L175 Difference]: Start difference. First operand has 135 places, 145 transitions, 320 flow. Second operand 3 states and 325 transitions. [2025-03-04 02:30:01,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 247 transitions, 983 flow [2025-03-04 02:30:01,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 247 transitions, 979 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:30:01,553 INFO L231 Difference]: Finished difference. Result has 137 places, 146 transitions, 330 flow [2025-03-04 02:30:01,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=137, PETRI_TRANSITIONS=146} [2025-03-04 02:30:01,554 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, -3 predicate places. [2025-03-04 02:30:01,554 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 146 transitions, 330 flow [2025-03-04 02:30:01,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:01,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:01,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:01,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:30:01,555 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:30:01,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:01,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1584303282, now seen corresponding path program 1 times [2025-03-04 02:30:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:01,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156861096] [2025-03-04 02:30:01,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:01,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:01,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 02:30:01,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 02:30:01,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:01,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:01,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:01,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156861096] [2025-03-04 02:30:01,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156861096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:01,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:01,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:30:01,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829910792] [2025-03-04 02:30:01,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:01,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:30:01,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:01,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:30:01,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:30:01,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-04 02:30:01,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 146 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:01,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:01,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-04 02:30:01,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:03,915 INFO L124 PetriNetUnfolderBase]: 13216/21938 cut-off events. [2025-03-04 02:30:03,915 INFO L125 PetriNetUnfolderBase]: For 7418/7418 co-relation queries the response was YES. [2025-03-04 02:30:03,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46956 conditions, 21938 events. 13216/21938 cut-off events. For 7418/7418 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 134319 event pairs, 6414 based on Foata normal form. 0/18816 useless extension candidates. Maximal degree in co-relation 35684. Up to 12908 conditions per place. [2025-03-04 02:30:03,965 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 216 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2025-03-04 02:30:03,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 246 transitions, 990 flow [2025-03-04 02:30:03,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:30:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:30:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2025-03-04 02:30:03,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5521367521367522 [2025-03-04 02:30:03,967 INFO L175 Difference]: Start difference. First operand has 137 places, 146 transitions, 330 flow. Second operand 3 states and 323 transitions. [2025-03-04 02:30:03,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 246 transitions, 990 flow [2025-03-04 02:30:03,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 246 transitions, 986 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:30:03,973 INFO L231 Difference]: Finished difference. Result has 139 places, 147 transitions, 340 flow [2025-03-04 02:30:03,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=139, PETRI_TRANSITIONS=147} [2025-03-04 02:30:03,974 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, -1 predicate places. [2025-03-04 02:30:03,974 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 147 transitions, 340 flow [2025-03-04 02:30:03,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:03,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:03,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:03,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:30:03,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:30:03,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 656123225, now seen corresponding path program 1 times [2025-03-04 02:30:03,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:03,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209179209] [2025-03-04 02:30:03,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:04,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 02:30:04,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 02:30:04,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:04,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:04,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-03-04 02:30:04,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:04,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209179209] [2025-03-04 02:30:04,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209179209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:04,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:04,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:30:04,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067869379] [2025-03-04 02:30:04,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:04,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:30:04,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:04,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:30:04,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:30:04,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-04 02:30:04,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 147 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:04,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:04,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-04 02:30:04,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:07,247 INFO L124 PetriNetUnfolderBase]: 15076/25250 cut-off events. [2025-03-04 02:30:07,248 INFO L125 PetriNetUnfolderBase]: For 8893/8893 co-relation queries the response was YES. [2025-03-04 02:30:07,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54666 conditions, 25250 events. 15076/25250 cut-off events. For 8893/8893 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 160678 event pairs, 10169 based on Foata normal form. 0/22045 useless extension candidates. Maximal degree in co-relation 42645. Up to 20735 conditions per place. [2025-03-04 02:30:07,339 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 288 selfloop transitions, 4 changer transitions 0/320 dead transitions. [2025-03-04 02:30:07,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 320 transitions, 1328 flow [2025-03-04 02:30:07,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:30:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:30:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 429 transitions. [2025-03-04 02:30:07,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-04 02:30:07,341 INFO L175 Difference]: Start difference. First operand has 139 places, 147 transitions, 340 flow. Second operand 4 states and 429 transitions. [2025-03-04 02:30:07,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 320 transitions, 1328 flow [2025-03-04 02:30:07,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 320 transitions, 1322 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:30:07,348 INFO L231 Difference]: Finished difference. Result has 143 places, 150 transitions, 366 flow [2025-03-04 02:30:07,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=143, PETRI_TRANSITIONS=150} [2025-03-04 02:30:07,349 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 3 predicate places. [2025-03-04 02:30:07,349 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 150 transitions, 366 flow [2025-03-04 02:30:07,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:07,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:07,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:07,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:30:07,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:30:07,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1479017072, now seen corresponding path program 1 times [2025-03-04 02:30:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:07,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014229601] [2025-03-04 02:30:07,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:07,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:07,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 02:30:07,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 02:30:07,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:07,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:07,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-03-04 02:30:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:07,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014229601] [2025-03-04 02:30:07,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014229601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:07,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:07,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:30:07,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881434522] [2025-03-04 02:30:07,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:07,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:30:07,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:07,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:30:07,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:30:07,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-04 02:30:07,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 150 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:07,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:07,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-04 02:30:07,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:09,816 INFO L124 PetriNetUnfolderBase]: 17170/28706 cut-off events. [2025-03-04 02:30:09,817 INFO L125 PetriNetUnfolderBase]: For 14227/14227 co-relation queries the response was YES. [2025-03-04 02:30:09,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66563 conditions, 28706 events. 17170/28706 cut-off events. For 14227/14227 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 183639 event pairs, 11813 based on Foata normal form. 0/25691 useless extension candidates. Maximal degree in co-relation 55189. Up to 23687 conditions per place. [2025-03-04 02:30:09,999 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 291 selfloop transitions, 4 changer transitions 0/323 dead transitions. [2025-03-04 02:30:10,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 323 transitions, 1390 flow [2025-03-04 02:30:10,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:30:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:30:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2025-03-04 02:30:10,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2025-03-04 02:30:10,002 INFO L175 Difference]: Start difference. First operand has 143 places, 150 transitions, 366 flow. Second operand 4 states and 425 transitions. [2025-03-04 02:30:10,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 323 transitions, 1390 flow [2025-03-04 02:30:10,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 323 transitions, 1384 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:30:10,043 INFO L231 Difference]: Finished difference. Result has 147 places, 153 transitions, 392 flow [2025-03-04 02:30:10,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=392, PETRI_PLACES=147, PETRI_TRANSITIONS=153} [2025-03-04 02:30:10,044 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 7 predicate places. [2025-03-04 02:30:10,044 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 153 transitions, 392 flow [2025-03-04 02:30:10,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:10,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:10,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:10,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:30:10,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:30:10,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:10,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1123055270, now seen corresponding path program 1 times [2025-03-04 02:30:10,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:10,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195706901] [2025-03-04 02:30:10,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:10,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:10,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 02:30:10,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 02:30:10,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:10,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:10,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:10,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195706901] [2025-03-04 02:30:10,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195706901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:10,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:10,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:30:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835036043] [2025-03-04 02:30:10,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:10,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:30:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:10,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:30:10,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:30:10,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-04 02:30:10,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 153 transitions, 392 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:10,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:10,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-04 02:30:10,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:12,988 INFO L124 PetriNetUnfolderBase]: 19282/32198 cut-off events. [2025-03-04 02:30:12,988 INFO L125 PetriNetUnfolderBase]: For 18088/18088 co-relation queries the response was YES. [2025-03-04 02:30:13,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80039 conditions, 32198 events. 19282/32198 cut-off events. For 18088/18088 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 210072 event pairs, 13691 based on Foata normal form. 0/29415 useless extension candidates. Maximal degree in co-relation 66851. Up to 26999 conditions per place. [2025-03-04 02:30:13,213 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 300 selfloop transitions, 4 changer transitions 0/332 dead transitions. [2025-03-04 02:30:13,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 332 transitions, 1462 flow [2025-03-04 02:30:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:30:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:30:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 429 transitions. [2025-03-04 02:30:13,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-04 02:30:13,215 INFO L175 Difference]: Start difference. First operand has 147 places, 153 transitions, 392 flow. Second operand 4 states and 429 transitions. [2025-03-04 02:30:13,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 332 transitions, 1462 flow [2025-03-04 02:30:13,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 332 transitions, 1456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:30:13,317 INFO L231 Difference]: Finished difference. Result has 151 places, 156 transitions, 424 flow [2025-03-04 02:30:13,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=424, PETRI_PLACES=151, PETRI_TRANSITIONS=156} [2025-03-04 02:30:13,318 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 11 predicate places. [2025-03-04 02:30:13,318 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 156 transitions, 424 flow [2025-03-04 02:30:13,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:13,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:13,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:13,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:30:13,318 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:30:13,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:13,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1490628408, now seen corresponding path program 1 times [2025-03-04 02:30:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689434735] [2025-03-04 02:30:13,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:13,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 02:30:13,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 02:30:13,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:13,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:13,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:13,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689434735] [2025-03-04 02:30:13,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689434735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:13,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:13,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:30:13,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310206939] [2025-03-04 02:30:13,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:13,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:30:13,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:13,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:30:13,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:30:13,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-04 02:30:13,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 156 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:13,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:13,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-04 02:30:13,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:30:17,407 INFO L124 PetriNetUnfolderBase]: 21628/36050 cut-off events. [2025-03-04 02:30:17,407 INFO L125 PetriNetUnfolderBase]: For 27944/27944 co-relation queries the response was YES. [2025-03-04 02:30:17,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95099 conditions, 36050 events. 21628/36050 cut-off events. For 27944/27944 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 237675 event pairs, 15587 based on Foata normal form. 0/33553 useless extension candidates. Maximal degree in co-relation 80385. Up to 30347 conditions per place. [2025-03-04 02:30:17,575 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 303 selfloop transitions, 4 changer transitions 0/335 dead transitions. [2025-03-04 02:30:17,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 335 transitions, 1542 flow [2025-03-04 02:30:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:30:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:30:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2025-03-04 02:30:17,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2025-03-04 02:30:17,577 INFO L175 Difference]: Start difference. First operand has 151 places, 156 transitions, 424 flow. Second operand 4 states and 425 transitions. [2025-03-04 02:30:17,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 335 transitions, 1542 flow [2025-03-04 02:30:17,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 335 transitions, 1518 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-04 02:30:17,700 INFO L231 Difference]: Finished difference. Result has 155 places, 159 transitions, 450 flow [2025-03-04 02:30:17,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=450, PETRI_PLACES=155, PETRI_TRANSITIONS=159} [2025-03-04 02:30:17,701 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 15 predicate places. [2025-03-04 02:30:17,701 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 159 transitions, 450 flow [2025-03-04 02:30:17,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:17,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:30:17,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:30:17,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:30:17,701 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:30:17,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:30:17,702 INFO L85 PathProgramCache]: Analyzing trace with hash 392491672, now seen corresponding path program 1 times [2025-03-04 02:30:17,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:30:17,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164815390] [2025-03-04 02:30:17,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:30:17,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:30:17,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 02:30:17,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 02:30:17,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:30:17,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:30:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:30:17,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:30:17,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164815390] [2025-03-04 02:30:17,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164815390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:30:17,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:30:17,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:30:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840647365] [2025-03-04 02:30:17,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:30:17,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:30:17,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:30:17,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:30:17,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:30:17,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 195 [2025-03-04 02:30:17,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 159 transitions, 450 flow. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:30:17,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:30:17,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 195 [2025-03-04 02:30:17,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand